Submission #2702458

---

Source Code Expand

import java.util.*;

public class Main {
    public static void main(String... args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int c = sc.nextInt();
        int[][] differences = new int[c][c];
        int[][] patterns = new int[3][c];
        for (int i = 0; i < c ; i++) {
            for (int j = 0 ; j < c ; j++) {
                differences[i][j] = sc.nextInt();
            }
        }
        for (int i = 0; i < n ; i++) {
            for (int j = 0 ; j < n ; j++) {
                patterns[(i+j)%3][sc.nextInt()-1]++;
            }
        }

        long min = Long.MAX_VALUE;
        for (int i = 0 ; i < c ; i++) {
            for (int j = 0 ; j < c ; j++) {
                if (i != j) {
                    for (int k = 0 ; k < c ; k++) {
                        if (i != k && j != k) {
                            long tmp = 0;
                            for (int m = 0 ; m < c ; m++) {
                                tmp += patterns[0][m] * differences[m][i];
                                tmp += patterns[1][m] * differences[m][j];
                                tmp += patterns[2][m] * differences[m][k];
                            }
                            min = Math.min(tmp, min);
                        }
                    }
                }
            }
        }
        System.out.println(min);
    }
}

Submission Info

Judge Result