Submission #3140352


Source Code Expand

import sys
stdin = sys.stdin

def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(ns())
def nf(): return float(ns())


from itertools import permutations

grid = []
for _ in range(5):
    grid.append(li())

# 0の位置を登録, 使われていない数字を検索
z_point = []
not_used = {i for i in range(1,26)}
for i in range(5):
    for j in range(5):
        if grid[i][j] == 0:
            z_point.append((i,j))
        else:
            not_used.remove(grid[i][j])
            
cands = list(permutations(not_used))
            
# 割り当て
ans = 0
for cand in cands:
    c = list(cand)
    for cnt, (i,j) in enumerate(z_point):
        grid[i][j] = c[cnt]
                
        
    # チェック
    ok = True
    
    # 行ごと
    for i in range(5):
        for j in range(3):
            if grid[i][j] < grid[i][j+1] < grid[i][j+2]:
                ok = False
                break
            elif grid[i][j] > grid[i][j+1] > grid[i][j+2]:
                ok = False
                break
                
    # 列ごと
    for j in range(5):
        for i in range(3):
            if grid[i][j] < grid[i+1][j] < grid[i+2][j]:
                ok = False
                break
            elif grid[i][j] > grid[i+1][j] > grid[i+2][j]:
                ok = False
                break
                
    if ok:
        ans += 1

            
print(ans)

Submission Info

Submission Time
Task D - 25個の整数
User polarbear08
Language Python (3.4.3)
Score 30
Code Size 1711 Byte
Status RE
Exec Time 6540 ms
Memory 10044 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 4
AC × 19
AC × 19
TLE × 8
RE × 2
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Subtask1 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt
Subtask2 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt, test-2-01.txt, test-2-02.txt, test-2-03.txt, test-2-04.txt, test-2-05.txt, test-2-06.txt, test-2-07.txt, test-2-08.txt, test-2-09.txt, test-2-10.txt
Case Name Status Exec Time Memory
sample-01.txt AC 30 ms 3188 KB
sample-02.txt AC 938 ms 7992 KB
sample-03.txt AC 19 ms 3188 KB
sample-04.txt AC 18 ms 3188 KB
test-1-01.txt AC 688 ms 7996 KB
test-1-02.txt AC 20 ms 3192 KB
test-1-03.txt AC 32 ms 3188 KB
test-1-04.txt AC 120 ms 3572 KB
test-1-05.txt AC 113 ms 3572 KB
test-1-06.txt AC 798 ms 7992 KB
test-1-07.txt AC 673 ms 7992 KB
test-1-08.txt AC 781 ms 7996 KB
test-1-09.txt AC 710 ms 10044 KB
test-1-10.txt AC 17 ms 3188 KB
test-1-11.txt AC 17 ms 3188 KB
test-1-12.txt AC 711 ms 7992 KB
test-1-13.txt AC 17 ms 3188 KB
test-1-14.txt AC 773 ms 7992 KB
test-1-15.txt AC 792 ms 7996 KB
test-2-01.txt RE 4913 ms -807944 KB
test-2-02.txt RE 4964 ms -807312 KB
test-2-03.txt TLE 5525 ms -807104 KB
test-2-04.txt TLE 5545 ms -806992 KB
test-2-05.txt TLE 5549 ms -807012 KB
test-2-06.txt TLE 6540 ms -806920 KB
test-2-07.txt TLE 5540 ms -806772 KB
test-2-08.txt TLE 5533 ms -806624 KB
test-2-09.txt TLE 5523 ms -806536 KB
test-2-10.txt TLE 6524 ms -806584 KB