Submission #2526048
Source Code Expand
da = list(map(int,input().split())) k = [0]*da[1] ta = [0]*da[0] t = [0]*da[0] a = [0]*da[1] p = 0 co = 0 for i in range(da[1]): k[i] = list(map(int,input().split())) for j in range(k[i][0],k[i][1] + 1): if ta[j-1] >= 2: continue ta[j-1] += 1 for i in range(da[0]): if ta[i] == 2: t[i] = 1 for i in range(da[1]): for j in range(k[i][0],k[i][1] + 1): if t[j-1] != 1: break else: co += 1 if co == k[i][1] - k[i][0] + 1: a[i] = 1 p += 1 co = 0 print(p) for i in range(da[1]): if a[i] ==1: print(i+1)
Submission Info
Submission Time | |
---|---|
Task | B - ドキドキデート大作戦高橋君 |
User | renoyu |
Language | PyPy3 (2.4.0) |
Score | 30 |
Code Size | 604 Byte |
Status | TLE |
Exec Time | 2106 ms |
Memory | 66252 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 | 166 ms | 38256 KB |
subtask0_sample_02.txt | AC | 163 ms | 38256 KB |
subtask0_sample_03.txt | AC | 167 ms | 38256 KB |
subtask1_01.txt | AC | 618 ms | 61772 KB |
subtask1_02.txt | AC | 685 ms | 65612 KB |
subtask1_03.txt | AC | 633 ms | 61260 KB |
subtask1_04.txt | AC | 696 ms | 66252 KB |
subtask1_05.txt | AC | 702 ms | 66124 KB |
subtask1_06.txt | AC | 173 ms | 38896 KB |
subtask1_07.txt | AC | 173 ms | 38256 KB |
subtask1_08.txt | AC | 167 ms | 38256 KB |
subtask1_09.txt | AC | 163 ms | 38256 KB |
subtask2_01.txt | TLE | 2106 ms | 50380 KB |
subtask2_02.txt | TLE | 2106 ms | 50380 KB |
subtask2_03.txt | AC | 172 ms | 38640 KB |
subtask2_04.txt | AC | 173 ms | 38640 KB |
subtask2_05.txt | AC | 172 ms | 38640 KB |
subtask2_06.txt | AC | 171 ms | 38640 KB |
subtask2_07.txt | AC | 173 ms | 38640 KB |
subtask2_08.txt | TLE | 2106 ms | 50764 KB |