Submission #3424690
Source Code Expand
import sys stdin = sys.stdin sys.setrecursionlimit(10**5) def li(): return map(int, stdin.readline().split()) def li_(): return map(lambda x: int(x)-1, stdin.readline().split()) def lf(): return map(float, stdin.readline().split()) def ls(): return stdin.readline().split() def ns(): return stdin.readline().rstrip() def lc(): return list(ns()) def ni(): return int(stdin.readline()) def nf(): return float(stdin.readline()) def judge(k:int, a:list): mi = ma = 2 for ai in a[::-1]: # miをaiの倍数に切り上げる if mi%ai: mi += ai - mi%ai ma += (ai - 1) - (ma % ai) if ma < mi: return False, (-1,-1) return True, (mi,ma) k = ni() a = list(li()) tf, (mi,ma) = judge(k,a) if tf: print(mi,ma) else: print(-1)
Submission Info
Submission Time | |
---|---|
Task | B - Ice Rink Game |
User | polarbear08 |
Language | Python (3.4.3) |
Score | 500 |
Code Size | 861 Byte |
Status | AC |
Exec Time | 84 ms |
Memory | 14168 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 21 ms | 3444 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
sample_03.txt | AC | 17 ms | 3064 KB |
subtask_1_01.txt | AC | 17 ms | 3064 KB |
subtask_1_02.txt | AC | 17 ms | 3064 KB |
subtask_1_03.txt | AC | 17 ms | 3064 KB |
subtask_1_04.txt | AC | 17 ms | 3064 KB |
subtask_1_05.txt | AC | 17 ms | 3064 KB |
subtask_1_06.txt | AC | 51 ms | 4964 KB |
subtask_1_07.txt | AC | 44 ms | 14076 KB |
subtask_1_08.txt | AC | 17 ms | 3064 KB |
subtask_1_09.txt | AC | 17 ms | 3064 KB |
subtask_1_10.txt | AC | 21 ms | 3572 KB |
subtask_1_11.txt | AC | 84 ms | 14168 KB |
subtask_1_12.txt | AC | 84 ms | 14076 KB |
subtask_1_13.txt | AC | 70 ms | 13304 KB |
subtask_1_14.txt | AC | 57 ms | 14168 KB |
subtask_1_15.txt | AC | 81 ms | 14168 KB |
subtask_1_16.txt | AC | 24 ms | 3952 KB |
subtask_1_17.txt | AC | 81 ms | 12832 KB |
subtask_1_18.txt | AC | 82 ms | 12720 KB |
subtask_1_19.txt | AC | 74 ms | 11180 KB |
subtask_1_20.txt | AC | 47 ms | 12832 KB |
subtask_1_21.txt | AC | 45 ms | 12724 KB |
subtask_1_22.txt | AC | 43 ms | 12840 KB |
subtask_1_23.txt | AC | 17 ms | 3064 KB |
subtask_1_24.txt | AC | 18 ms | 3064 KB |
subtask_1_25.txt | AC | 84 ms | 14008 KB |
subtask_1_26.txt | AC | 18 ms | 3064 KB |
subtask_1_27.txt | AC | 84 ms | 14008 KB |