Submission #1372928
Source Code Expand
def is_possible(N, M, m): if M >= 2 * m: r = M - 2 * m t = r // 2 if N + t >= m: return True return False def solve(N, M): a = 0 b = 10 ** 20 while b - a > 1: m = (a + b) // 2 if is_possible(N, M, m): a = m else: b = m return a N, M = map(int, input().split()) res = solve(N, M) print(res)
Submission Info
Submission Time | |
---|---|
Task | C - Scc Puzzle |
User | xiaodidi |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 424 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
All | 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 17 ms | 2940 KB |
00_example_02.txt | AC | 17 ms | 3060 KB |
01.txt | AC | 17 ms | 3060 KB |
02.txt | AC | 17 ms | 2940 KB |
03.txt | AC | 17 ms | 3060 KB |
04.txt | AC | 17 ms | 3060 KB |
05.txt | AC | 17 ms | 2940 KB |
06.txt | AC | 17 ms | 3060 KB |
07.txt | AC | 17 ms | 3064 KB |