Submission #4060071
Source Code Expand
H,W = map(int,input().split()) A=[] for i in range(H): A.append(list(map(int,input().split()))) num=0 for i in range(H): for j in range(W): if i%2==0: n=j else: n=W-1-j if A[i][n]%2==1: A[i][n]-=1 if i!=H-1 and (i%2==0 and n==W-1) or (i%2==1 and n==0): num+=1 A[i+1][n]+=1 print(i+1,n+1,i+2,n+1) if (i%2==0 and n!=W-1) or (i%2==1 and n!=0): num+=1 A[i][n+(-1)**(i%2)]+=1 print(i+1,n+1,i+1,n+1+(-1)**(i%2))
Submission Info
Submission Time | |
---|---|
Task | A - ABC333 |
User | nuko274 |
Language | PyPy3 (2.4.0) |
Score | 0 |
Code Size | 623 Byte |
Status | RE |
Exec Time | 174 ms |
Memory | 38384 KB |
Judge Result
Set Name | All | Sample | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 100 | 0 / 0 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
All | sample_01, sample_02, sample_03, testcase0, testcase1, testcase2, testcase3, testcase4, testcase5 |
Sample | sample_01, sample_02, sample_03 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01 | RE | 170 ms | 38256 KB |
sample_02 | RE | 170 ms | 38256 KB |
sample_03 | RE | 172 ms | 38384 KB |
testcase0 | RE | 171 ms | 38256 KB |
testcase1 | RE | 170 ms | 38256 KB |
testcase2 | RE | 170 ms | 38256 KB |
testcase3 | RE | 171 ms | 38256 KB |
testcase4 | RE | 174 ms | 38256 KB |
testcase5 | RE | 174 ms | 38256 KB |