Submission #1306997
Source Code Expand
# -*- coding: utf-8 -*- N, K = map(int,input().split()) A = [] for i in range(K): a, b = map(int,input().split()) for j in range(b): A.append(a) if len(A) > K: print(A[K-1]) break
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | soneda0803 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 230 Byte |
Status | WA |
Exec Time | 2114 ms |
Memory | 172312 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_1.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_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 17 ms | 2940 KB |
sample_02.txt | AC | 82 ms | 7832 KB |
subtask_1_1.txt | WA | 1950 ms | 130712 KB |
subtask_1_10.txt | TLE | 2113 ms | 169368 KB |
subtask_1_11.txt | TLE | 2113 ms | 167832 KB |
subtask_1_12.txt | TLE | 2114 ms | 167420 KB |
subtask_1_13.txt | TLE | 2112 ms | 151088 KB |
subtask_1_14.txt | TLE | 2112 ms | 155160 KB |
subtask_1_15.txt | TLE | 2113 ms | 172312 KB |
subtask_1_2.txt | TLE | 2109 ms | 142104 KB |
subtask_1_3.txt | TLE | 2112 ms | 170032 KB |
subtask_1_4.txt | TLE | 2112 ms | 161712 KB |
subtask_1_5.txt | TLE | 2113 ms | 170264 KB |
subtask_1_6.txt | WA | 76 ms | 7064 KB |
subtask_1_7.txt | WA | 84 ms | 7832 KB |
subtask_1_8.txt | WA | 50 ms | 5400 KB |
subtask_1_9.txt | TLE | 2112 ms | 149680 KB |