using System; using System.Collections.Generic; class Program { static void Main() { var input = Console.ReadLine().Split(); int N = int.Parse(input[0]); int M = int.Parse(input[1]); int[,] city = new int[N, N]; List<(int, int)> chickenZips = new List<(int, int)>(); for(int i=0; i survivedChickens = new List<(int, int)>(); int leastTotalChickenDistance = int.MaxValue; int counter = 0; while(counter < chickenZips.Count - M + 1) { for(int i = counter; i < chickenZips.Count; i++) { survivedChickens.Add(chickenZips[i]); if (survivedChickens.Count == M) { leastTotalChickenDistance = Math.Min(FindTotalChickenDistance(survivedChickens), leastTotalChickenDistance); survivedChickens.Remove(chickenZips[i]); } } survivedChickens.Clear(); counter++; } Console.WriteLine(leastTotalChickenDistance); } int FindTotalChickenDistance(List<(int, int)> survivedChickenZips) { int totalChickenDistance = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if (city[i, j] == 1) { int shortest = int.MaxValue; foreach (var chicken in survivedChickenZips) { int distance = GetDistance(i, chicken.Item1, j, chicken.Item2); shortest = Math.Min(shortest, distance); } totalChickenDistance += shortest; } } } return totalChickenDistance; } int GetDistance(int x1, int x2, int y1, int y2) { return Math.Abs((x1 - x2)) + Math.Abs((y1 - y2)); } } }

제출 #136771

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: