문제 https://www.acmicpc.net/problem/6156 6156번: Cow Contest N (1 N >> M; vectordist(N + 1, vector(N + 1, INF)); for (int cow = 0; cow > cow1 >> cow2; dist[cow1][cow2] = 1; } for (int mid = 1; mid
