Submission #1679718


Source Code Expand

def calc(board,b,c,ms):
    ret = -ms
    if (board[0*3+0] == board[1*3+0]): ret += 2*b[0]
    if (board[0*3+1] == board[1*3+1]): ret += 2*b[1]
    if (board[0*3+2] == board[1*3+2]): ret += 2*b[2]
    if (board[1*3+0] == board[2*3+0]): ret += 2*b[3]
    if (board[1*3+1] == board[2*3+1]): ret += 2*b[4]
    if (board[1*3+2] == board[2*3+2]): ret += 2*b[5]
    if (board[0*3+0] == board[0*3+1]): ret += 2*c[0]
    if (board[0*3+1] == board[0*3+2]): ret += 2*c[1]
    if (board[1*3+0] == board[1*3+1]): ret += 2*c[2]
    if (board[1*3+1] == board[1*3+2]): ret += 2*c[3]
    if (board[2*3+0] == board[2*3+1]): ret += 2*c[4]
    if (board[2*3+1] == board[2*3+2]): ret += 2*c[5]
    return ret

def dai(board,count,b,c,ms):
    if count == 5: return calc(board,b,c,ms)
    score = -10000
    for i in range(9):
        if board[i] != 0: continue
        nb = [board[i] for i in range(9)]
        nb[i] = 1
        score = max(score, ko(nb,count,b,c,ms))
    return score

def ko(board,count,b,c,ms):
    score = 10000
    for i in range(9):
        if board[i] != 0: continue
        nb = [board[i] for i in range(9)]
        nb[i] = -1
        score = min(score,dai(nb,count+1,b,c,ms))
    return score

def main():
    board = [0]*9
    b = list(map(int,input().split()))
    b.extend(list(map(int,input().split())))
    c = list(map(int,input().split()))
    c.extend(list(map(int,input().split())))
    c.extend(list(map(int,input().split())))
    score = 0
    for i in range(6):
        score += b[i] + c[i]
    sa = dai(board,1,b,c,score)
    dais = (score + sa)//2
    kos = (score - sa)//2
    print(dais)
    print(kos)

main()

Submission Info

Submission Time
Task A - 25個の文字列
User omi
Language Python (3.4.3)
Score 0
Code Size 1685 Byte
Status RE
Exec Time 19 ms
Memory 3192 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
RE × 3
RE × 36
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All sample-01.txt, sample-02.txt, sample-03.txt, test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt, test-21.txt, test-22.txt, test-23.txt, test-24.txt, test-25.txt, test-26.txt, test-27.txt, test-28.txt, test-29.txt, test-30.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
sample-01.txt RE 19 ms 3192 KB
sample-02.txt RE 19 ms 3192 KB
sample-03.txt RE 19 ms 3192 KB
test-01.txt RE 19 ms 3192 KB
test-02.txt RE 19 ms 3192 KB
test-03.txt RE 19 ms 3192 KB
test-04.txt RE 19 ms 3192 KB
test-05.txt RE 19 ms 3192 KB
test-06.txt RE 19 ms 3192 KB
test-07.txt RE 19 ms 3192 KB
test-08.txt RE 19 ms 3192 KB
test-09.txt RE 19 ms 3192 KB
test-10.txt RE 19 ms 3192 KB
test-11.txt RE 19 ms 3192 KB
test-12.txt RE 19 ms 3192 KB
test-13.txt RE 18 ms 3192 KB
test-14.txt RE 19 ms 3192 KB
test-15.txt RE 19 ms 3192 KB
test-16.txt RE 19 ms 3192 KB
test-17.txt RE 18 ms 3192 KB
test-18.txt RE 19 ms 3192 KB
test-19.txt RE 19 ms 3192 KB
test-20.txt RE 19 ms 3192 KB
test-21.txt RE 19 ms 3192 KB
test-22.txt RE 18 ms 3192 KB
test-23.txt RE 19 ms 3192 KB
test-24.txt RE 19 ms 3192 KB
test-25.txt RE 19 ms 3192 KB
test-26.txt RE 18 ms 3192 KB
test-27.txt RE 19 ms 3192 KB
test-28.txt RE 19 ms 3192 KB
test-29.txt RE 19 ms 3192 KB
test-30.txt RE 19 ms 3192 KB