Submission #2380233
Source Code Expand
row, col = 30, 30 board = [[0 for i in range(30)] for i in range(30)] def _input(): for i in range(30): l = map(int, input().split()) for j, v in enumerate(l): board[i][j] = v def solve_fool(): global board for i in range(row): for j in range(col): while(board[i][j] > 0): board[i][j] -= 1 print(i+1, j+1) def solve(): _input() solve_fool() if __name__ == "__main__": solve()
Submission Info
Submission Time | |
---|---|
Task | A - 高橋君の山崩しゲーム |
User | a_key_bako |
Language | Python (3.4.3) |
Score | 541032 |
Code Size | 509 Byte |
Status | AC |
Exec Time | 84 ms |
Memory | 3996 KB |
Judge Result
Set Name | test_01 | test_02 | test_03 | test_04 | test_05 | test_06 | test_07 | test_08 | test_09 | test_10 | ||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 55534 / 100000 | 53221 / 100000 | 54807 / 100000 | 51866 / 100000 | 54778 / 100000 | 54564 / 100000 | 53691 / 100000 | 55284 / 100000 | 53781 / 100000 | 53506 / 100000 | ||||||||||||||||||||
Status |
|
|
|
|
|
|
|
|
|
|
Set Name | Test Cases |
---|---|
test_01 | subtask_01_01.txt |
test_02 | subtask_01_02.txt |
test_03 | subtask_01_03.txt |
test_04 | subtask_01_04.txt |
test_05 | subtask_01_05.txt |
test_06 | subtask_01_06.txt |
test_07 | subtask_01_07.txt |
test_08 | subtask_01_08.txt |
test_09 | subtask_01_09.txt |
test_10 | subtask_01_10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask_01_01.txt | AC | 70 ms | 3900 KB |
subtask_01_02.txt | AC | 72 ms | 3992 KB |
subtask_01_03.txt | AC | 71 ms | 3896 KB |
subtask_01_04.txt | AC | 84 ms | 3896 KB |
subtask_01_05.txt | AC | 71 ms | 3904 KB |
subtask_01_06.txt | AC | 75 ms | 3916 KB |
subtask_01_07.txt | AC | 77 ms | 3996 KB |
subtask_01_08.txt | AC | 69 ms | 3908 KB |
subtask_01_09.txt | AC | 73 ms | 3904 KB |
subtask_01_10.txt | AC | 74 ms | 3904 KB |