Submission #2559387
Source Code Expand
import sys H,W = map(int,input().split()) if H%3 ==0: print(0) sys.exit() if W%3 ==0: print(0) sys.exit() A=[H,W] for i in range(H%3+1): M = H//3 if W%2==0: N = W//2 A.append(abs((M+i)*W-(2*M+2-i)*N)) else: N = W//2 A.append(max((M+i)*W,(2*M+2-i)*N,(2*M+2-i)*(N+1)) -min((M+i)*W,(2*M+2-i)*N,(2*M+2-i)*(N+1)) ) for i in range(W%3+1): M = W//3 if H%2==0: N = H//2 A.append(abs((M+i)*H-(2*M+2-i)*N)) else: N = H//2 A.append(max((M+i)*H,(2*M+2-i)*N,(2*M+2-i)*(N+1)) -min((M+i)*H,(2*M+2-i)*N,(2*M+2-i)*(N+1)) ) print(min(A))
Submission Info
Submission Time | |
---|---|
Task | C - Chocolate Bar |
User | okumura |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 690 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 17 ms | 3064 KB |
0_01.txt | AC | 17 ms | 3064 KB |
0_02.txt | AC | 17 ms | 3064 KB |
0_03.txt | AC | 17 ms | 3064 KB |
0_04.txt | AC | 17 ms | 3064 KB |
1_00.txt | AC | 17 ms | 3064 KB |
1_01.txt | AC | 17 ms | 3064 KB |
1_02.txt | AC | 17 ms | 3064 KB |
1_03.txt | AC | 17 ms | 3064 KB |
1_04.txt | AC | 17 ms | 3064 KB |
1_05.txt | AC | 17 ms | 3064 KB |
1_06.txt | AC | 17 ms | 3064 KB |
1_07.txt | AC | 17 ms | 3064 KB |
1_08.txt | AC | 17 ms | 3064 KB |
1_09.txt | AC | 17 ms | 3064 KB |
1_10.txt | AC | 17 ms | 3064 KB |
1_11.txt | AC | 17 ms | 3064 KB |
1_12.txt | AC | 17 ms | 3064 KB |
1_13.txt | AC | 17 ms | 3064 KB |
1_14.txt | AC | 17 ms | 3064 KB |