Submission #3019138
Source Code Expand
N,M=map( int, raw_input().split() ) S=[ map( int, raw_input().split() ) for i in range(M) ] C=[ 0 for i in range(N+1) ] for l,r in S: for i in range(l,r+1): C[i]+=1 A=[] ans=0 for idx,x in enumerate(S): l=x[0] r=x[1] for i in range(l,r+1): if C[i]>1: continue else: break else: A.append(idx+1) ans+=1 print ans for x in A: print x
Submission Info
Submission Time | |
---|---|
Task | B - ドキドキデート大作戦高橋君 |
User | KUMAWO |
Language | PyPy2 (5.6.0) |
Score | 30 |
Code Size | 383 Byte |
Status | TLE |
Exec Time | 2106 ms |
Memory | 50588 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 0 / 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 | 35 ms | 27116 KB |
subtask0_sample_02.txt | AC | 34 ms | 27628 KB |
subtask0_sample_03.txt | AC | 34 ms | 26476 KB |
subtask1_01.txt | AC | 157 ms | 44060 KB |
subtask1_02.txt | AC | 182 ms | 50588 KB |
subtask1_03.txt | AC | 147 ms | 42780 KB |
subtask1_04.txt | AC | 182 ms | 44828 KB |
subtask1_05.txt | AC | 180 ms | 45468 KB |
subtask1_06.txt | AC | 38 ms | 28652 KB |
subtask1_07.txt | AC | 34 ms | 27244 KB |
subtask1_08.txt | AC | 34 ms | 26604 KB |
subtask1_09.txt | AC | 34 ms | 26860 KB |
subtask2_01.txt | TLE | 2106 ms | 43292 KB |
subtask2_02.txt | TLE | 2106 ms | 43292 KB |
subtask2_03.txt | AC | 41 ms | 28908 KB |
subtask2_04.txt | AC | 40 ms | 28780 KB |
subtask2_05.txt | AC | 41 ms | 29804 KB |
subtask2_06.txt | AC | 41 ms | 30572 KB |
subtask2_07.txt | AC | 43 ms | 29804 KB |
subtask2_08.txt | TLE | 2106 ms | 42524 KB |