Submission #2527922
Source Code Expand
n,m = (int(i) for i in input().split()) s = [[int(i) for i in input().split()] for i in range(m)] x,y,ans = [0 for i in range(n+2)],[],[] for i,j in s: x[i],x[j+1] = x[i]+1,x[j+1]-1 for i in range(1,n+2): x[i] += x[i-1] if x[i]==1: y.append(i) from bisect import bisect from bisect import bisect_left for i in range(m): if bisect_left(y,s[i][0])==bisect(y,s[i][1]): ans.append(i+1) print(len(ans)) for i in ans: print(i)
Submission Info
Submission Time | |
---|---|
Task | B - ドキドキデート大作戦高橋君 |
User | Clamperl |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 435 Byte |
Status | AC |
Exec Time | 586 ms |
Memory | 37924 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 17 ms | 3064 KB |
subtask0_sample_02.txt | AC | 17 ms | 3064 KB |
subtask0_sample_03.txt | AC | 17 ms | 3064 KB |
subtask1_01.txt | AC | 555 ms | 35508 KB |
subtask1_02.txt | AC | 522 ms | 28348 KB |
subtask1_03.txt | AC | 514 ms | 26768 KB |
subtask1_04.txt | AC | 586 ms | 28952 KB |
subtask1_05.txt | AC | 574 ms | 28992 KB |
subtask1_06.txt | AC | 18 ms | 3064 KB |
subtask1_07.txt | AC | 18 ms | 3064 KB |
subtask1_08.txt | AC | 17 ms | 3064 KB |
subtask1_09.txt | AC | 18 ms | 3064 KB |
subtask2_01.txt | AC | 544 ms | 34776 KB |
subtask2_02.txt | AC | 552 ms | 37924 KB |
subtask2_03.txt | AC | 18 ms | 3064 KB |
subtask2_04.txt | AC | 18 ms | 3064 KB |
subtask2_05.txt | AC | 18 ms | 3064 KB |
subtask2_06.txt | AC | 18 ms | 3064 KB |
subtask2_07.txt | AC | 18 ms | 3064 KB |
subtask2_08.txt | AC | 527 ms | 33944 KB |