Submission #3053980
Source Code Expand
N = int(input()) box = [0 for i in range(N)] for i in range(N): w, h = map(int,input().split()) box[i] = (i,w,h) #print(box) box.sort(key = lambda x: x[1]) box.sort(key = lambda x: x[2]) #print(box) dp = [1 for i in range(N)] for i in range(N): for j in range(N): if box[i][1] > box[j][1] and box[i][2] > box[j][2]: dp[i] = max(dp[i],dp[j]+1) #print(dp) print(max(dp))
Submission Info
Submission Time | |
---|---|
Task | D - プレゼント |
User | xagawa |
Language | Python (3.4.3) |
Score | 30 |
Code Size | 398 Byte |
Status | TLE |
Exec Time | 2105 ms |
Memory | 22112 KB |
Judge Result
Set Name | Sample | Subtask0 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 0 / 70 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample0.txt, sample1.txt, sample2.txt, sample3.txt |
Subtask0 | subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, sample0.txt, sample1.txt, sample2.txt, sample3.txt |
All | sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample0.txt | AC | 17 ms | 3064 KB |
sample1.txt | AC | 17 ms | 3064 KB |
sample2.txt | AC | 17 ms | 3064 KB |
sample3.txt | AC | 17 ms | 3064 KB |
subtask0_0.txt | AC | 63 ms | 3064 KB |
subtask0_1.txt | AC | 19 ms | 3064 KB |
subtask0_10.txt | AC | 431 ms | 3188 KB |
subtask0_11.txt | AC | 244 ms | 3188 KB |
subtask0_12.txt | AC | 338 ms | 3188 KB |
subtask0_13.txt | AC | 341 ms | 3188 KB |
subtask0_14.txt | AC | 335 ms | 3188 KB |
subtask0_2.txt | AC | 21 ms | 3064 KB |
subtask0_3.txt | AC | 32 ms | 3064 KB |
subtask0_4.txt | AC | 212 ms | 3064 KB |
subtask0_5.txt | AC | 23 ms | 3064 KB |
subtask0_6.txt | AC | 264 ms | 3188 KB |
subtask0_7.txt | AC | 316 ms | 3188 KB |
subtask0_8.txt | AC | 243 ms | 3188 KB |
subtask0_9.txt | AC | 56 ms | 3064 KB |
subtask1_0.txt | TLE | 2104 ms | 14660 KB |
subtask1_1.txt | AC | 1201 ms | 3316 KB |
subtask1_10.txt | TLE | 2105 ms | 21288 KB |
subtask1_11.txt | TLE | 2105 ms | 21288 KB |
subtask1_12.txt | TLE | 2105 ms | 22112 KB |
subtask1_13.txt | TLE | 2105 ms | 22104 KB |
subtask1_14.txt | TLE | 2105 ms | 22108 KB |
subtask1_2.txt | TLE | 2104 ms | 6012 KB |
subtask1_3.txt | TLE | 2104 ms | 19248 KB |
subtask1_4.txt | TLE | 2105 ms | 21912 KB |
subtask1_5.txt | TLE | 2104 ms | 5748 KB |
subtask1_6.txt | TLE | 2104 ms | 17128 KB |
subtask1_7.txt | TLE | 2104 ms | 10756 KB |
subtask1_8.txt | TLE | 2104 ms | 19472 KB |
subtask1_9.txt | TLE | 2104 ms | 11508 KB |