Submission #57514648
Source Code Expand
N = int(input())
A = [list(map(int, input().split())) for _ in range(N)]
i = 1
for j in range(1, N + 1):
if i >= j:
i = A[i - 1][j - 1]
else:
i = A[j - 1][i - 1]
print(i)
Submission Info
| Submission Time | |
|---|---|
| Task | B - Binary Alchemy |
| User | yefllower |
| Language | Python (PyPy 3.10-v7.3.12) |
| Score | 200 |
| Code Size | 202 Byte |
| Status | AC |
| Exec Time | 57 ms |
| Memory | 80936 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample00.txt, sample01.txt, sample02.txt |
| All | sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample00.txt | AC | 54 ms | 76400 KiB |
| sample01.txt | AC | 54 ms | 76324 KiB |
| sample02.txt | AC | 54 ms | 76388 KiB |
| testcase00.txt | AC | 55 ms | 76444 KiB |
| testcase01.txt | AC | 54 ms | 76308 KiB |
| testcase02.txt | AC | 57 ms | 80588 KiB |
| testcase03.txt | AC | 56 ms | 80652 KiB |
| testcase04.txt | AC | 56 ms | 80904 KiB |
| testcase05.txt | AC | 56 ms | 80704 KiB |
| testcase06.txt | AC | 56 ms | 80756 KiB |
| testcase07.txt | AC | 57 ms | 80580 KiB |
| testcase08.txt | AC | 57 ms | 80936 KiB |
| testcase09.txt | AC | 56 ms | 80804 KiB |
| testcase10.txt | AC | 57 ms | 80808 KiB |
| testcase11.txt | AC | 57 ms | 80780 KiB |
| testcase12.txt | AC | 56 ms | 80676 KiB |