Submission #229782
Source Code Expand
import std.stdio, std.algorithm, std.array, std.range; const int N = 1000; void main() { int n; readf("%d\n", &n); int[] sum = new int[1000002/N+2]; int[] sum2 = new int[1000002]; for(int i = 0; i < n; i++) { int a,b; readf("%d %d\n", &a, &b); b++; for(int x = a; x < b; x++) { if(x % N == 0 && x + N < b) { sum[x/N]++; x += N - 1; }else { sum2[x]++; } } } for(int i = 0; i < sum2.length; i++) { sum2[i] += sum[i / N]; } writeln(sum2.reduce!max); }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | staka |
Language | D (DMD 2.060) |
Score | 100 |
Code Size | 560 Byte |
Status | AC |
Exec Time | 1752 ms |
Memory | 4764 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.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, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask0_sample01.txt, subtask0_sample02.txt |
Subtask2 | subtask0_sample01.txt, subtask0_sample02.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, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.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, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 57 ms | 4696 KB |
subtask0_sample02.txt | AC | 55 ms | 4644 KB |
subtask1_01.txt | AC | 55 ms | 4636 KB |
subtask1_02.txt | AC | 54 ms | 4636 KB |
subtask1_03.txt | AC | 87 ms | 4636 KB |
subtask1_04.txt | AC | 92 ms | 304 KB |
subtask1_05.txt | AC | 82 ms | 4760 KB |
subtask1_06.txt | AC | 92 ms | 4636 KB |
subtask1_07.txt | AC | 57 ms | 4764 KB |
subtask1_08.txt | AC | 77 ms | 4764 KB |
subtask1_09.txt | AC | 75 ms | 4648 KB |
subtask1_10.txt | AC | 76 ms | 4640 KB |
subtask1_11.txt | AC | 77 ms | 4640 KB |
subtask1_12.txt | AC | 76 ms | 4760 KB |
subtask1_13.txt | AC | 76 ms | 4636 KB |
subtask1_14.txt | AC | 77 ms | 4720 KB |
subtask1_15.txt | AC | 75 ms | 4760 KB |
subtask2_01.txt | AC | 1286 ms | 4716 KB |
subtask2_02.txt | AC | 1539 ms | 4644 KB |
subtask2_03.txt | AC | 1487 ms | 4716 KB |
subtask2_04.txt | AC | 1752 ms | 4648 KB |
subtask2_05.txt | AC | 265 ms | 4640 KB |
subtask2_06.txt | AC | 1196 ms | 4640 KB |
subtask2_07.txt | AC | 1175 ms | 4644 KB |
subtask2_08.txt | AC | 1181 ms | 4640 KB |
subtask2_09.txt | AC | 1175 ms | 4640 KB |
subtask2_10.txt | AC | 1182 ms | 4636 KB |
subtask2_11.txt | AC | 1191 ms | 4764 KB |
subtask2_12.txt | AC | 1202 ms | 4636 KB |
subtask2_13.txt | AC | 1190 ms | 4756 KB |
subtask2_14.txt | AC | 1191 ms | 4636 KB |
subtask2_15.txt | AC | 1195 ms | 4648 KB |
subtask2_16.txt | AC | 1201 ms | 4632 KB |
subtask2_17.txt | AC | 1195 ms | 4636 KB |
subtask2_18.txt | AC | 1191 ms | 4640 KB |
subtask2_19.txt | AC | 1197 ms | 4760 KB |
subtask2_20.txt | AC | 1193 ms | 4644 KB |
subtask2_21.txt | AC | 1184 ms | 4636 KB |
subtask2_22.txt | AC | 1191 ms | 4640 KB |
subtask2_23.txt | AC | 1190 ms | 4640 KB |
subtask2_24.txt | AC | 1184 ms | 4644 KB |
subtask2_25.txt | AC | 1185 ms | 4640 KB |