Submission #8807057


Source Code Expand

n,C = map(int,input().split())

d = [0 for i in range(C)]
for i in range(C):
    d_xy =  list(map(int,input().split()))
    d[i] = d_xy

c = [0 for i in range(n)]
for i in range(n):
    c_xy =  list(map(int,input().split()))
    c[i] = c_xy

li0 = [0 for i in range(C)]
li1 = [0 for i in range(C)]
li2 = [0 for i in range(C)]

for i in range(n):
    for j in range(n):
        a=i+1
        b=j+1
        if (a+b)%3==0:
            li0[c[i][j]-1] += 1
        elif (a+b)%3==1:
            li1[c[i][j]-1] += 1
        elif (a+b)%3==2:
            li2[c[i][j]-1] += 1

ans = (10**3)*500


for c0 in range(C):
    for c1 in range(C):
        for c2 in range(C):
            cst = 0
            if (c0==c1) or (c1==c2) or (c2==c0):
                continue

            for i in range(C):
                cst += d[i][c0]*li0[i]
                cst += d[i][c1]*li1[i]
                cst += d[i][c2]*li2[i]
            ans = min(ans,cst)

print(ans)


Submission Info

Submission Time
Task D - Good Grid
User kato1999
Language Python (3.4.3)
Score 0
Code Size 993 Byte
Status WA
Exec Time 724 ms
Memory 5620 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 10
WA × 8
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
01.txt AC 720 ms 5364 KB
02.txt WA 715 ms 4852 KB
03.txt AC 498 ms 3064 KB
04.txt WA 88 ms 3700 KB
05.txt AC 17 ms 3064 KB
06.txt WA 654 ms 5364 KB
07.txt WA 716 ms 5364 KB
08.txt AC 715 ms 5620 KB
09.txt WA 83 ms 3700 KB
10.txt AC 84 ms 3316 KB
11.txt WA 60 ms 3444 KB
12.txt WA 84 ms 3828 KB
13.txt AC 595 ms 4980 KB
14.txt WA 234 ms 4852 KB
15.txt AC 724 ms 5364 KB
16.txt AC 555 ms 3956 KB
sample_01.txt AC 17 ms 3064 KB
sample_02.txt AC 17 ms 3064 KB