Submission #230453
Source Code Expand
#include <iostream>
using namespace std;
int main(void)
{
int n, a, b, c[1000001] = {0}, max = 0;
int i;
cin >> n;
for (i = 0; i < n; ++i)
for (cin >> a >> b; a <= b; ++a)
if (c[max] < ++c[a])
max = a;
cout << c[max] << endl;
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | C - AtColor |
| User | owl |
| Language | C++ (G++ 4.6.4) |
| Score | 0 |
| Code Size | 266 Byte |
| Status | TLE |
| Exec Time | 3035 ms |
| Memory | 4780 KB |
Judge Result
| Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | 30 ms | 4772 KB |
| subtask0_sample02.txt | AC | 37 ms | 4756 KB |
| subtask1_01.txt | AC | 30 ms | 4644 KB |
| subtask1_02.txt | AC | 31 ms | 4652 KB |
| subtask1_03.txt | TLE | 3033 ms | 4776 KB |
| subtask1_04.txt | TLE | 3031 ms | 4772 KB |
| subtask1_05.txt | TLE | 3034 ms | 4768 KB |
| subtask1_06.txt | TLE | 3031 ms | 4768 KB |
| subtask1_07.txt | AC | 32 ms | 4632 KB |
| subtask1_08.txt | AC | 1210 ms | 4576 KB |
| subtask1_09.txt | AC | 1219 ms | 4584 KB |
| subtask1_10.txt | AC | 1211 ms | 4644 KB |
| subtask1_11.txt | AC | 1237 ms | 4648 KB |
| subtask1_12.txt | AC | 1185 ms | 4636 KB |
| subtask1_13.txt | AC | 1230 ms | 4768 KB |
| subtask1_14.txt | AC | 1176 ms | 4760 KB |
| subtask1_15.txt | AC | 1205 ms | 4640 KB |
| subtask2_01.txt | TLE | 3033 ms | 4720 KB |
| subtask2_02.txt | TLE | 3033 ms | 4772 KB |
| subtask2_03.txt | TLE | 3033 ms | 4780 KB |
| subtask2_04.txt | TLE | 3033 ms | 4764 KB |
| subtask2_05.txt | AC | 136 ms | 4584 KB |
| subtask2_06.txt | TLE | 3033 ms | 4776 KB |
| subtask2_07.txt | TLE | 3033 ms | 4764 KB |
| subtask2_08.txt | TLE | 3033 ms | 4772 KB |
| subtask2_09.txt | TLE | 3033 ms | 4772 KB |
| subtask2_10.txt | TLE | 3034 ms | 4696 KB |
| subtask2_11.txt | TLE | 3033 ms | 4768 KB |
| subtask2_12.txt | TLE | 3034 ms | 4760 KB |
| subtask2_13.txt | TLE | 3034 ms | 4768 KB |
| subtask2_14.txt | TLE | 3035 ms | 4764 KB |
| subtask2_15.txt | TLE | 3034 ms | 4768 KB |
| subtask2_16.txt | TLE | 3034 ms | 4692 KB |
| subtask2_17.txt | TLE | 3033 ms | 4772 KB |
| subtask2_18.txt | TLE | 3033 ms | 4776 KB |
| subtask2_19.txt | TLE | 3032 ms | 4768 KB |
| subtask2_20.txt | TLE | 3033 ms | 4780 KB |
| subtask2_21.txt | TLE | 3033 ms | 4780 KB |
| subtask2_22.txt | TLE | 3033 ms | 4764 KB |
| subtask2_23.txt | TLE | 3033 ms | 4772 KB |
| subtask2_24.txt | TLE | 3033 ms | 4716 KB |
| subtask2_25.txt | TLE | 3033 ms | 4768 KB |