Submission #229954
Source Code Expand
#include<iostream> #include<bitset> using namespace std; int main(){ static int out[1000001]={0}; int i, j, n, a, b, max=0, t; cin >> n; for(i=0;i<n;i++){ cin >> a >> b; for(j=a;j<=b;j++){ out[j]++; } } for(i=0;i<1000001;i++){ if(max<out[i]){ max = out[i]; t = i; } } cout << out[t]; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | sejimhp |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 349 Byte |
Status | WA |
Exec Time | 3038 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 | WA | 28 ms | 796 KB |
subtask0_sample02.txt | WA | 32 ms | 4640 KB |
subtask1_01.txt | WA | 26 ms | 804 KB |
subtask1_02.txt | WA | 26 ms | 800 KB |
subtask1_03.txt | TLE | 3032 ms | 4772 KB |
subtask1_04.txt | TLE | 3031 ms | 4776 KB |
subtask1_05.txt | TLE | 3032 ms | 4776 KB |
subtask1_06.txt | TLE | 3032 ms | 4772 KB |
subtask1_07.txt | WA | 30 ms | 924 KB |
subtask1_08.txt | WA | 1038 ms | 4648 KB |
subtask1_09.txt | WA | 1027 ms | 4644 KB |
subtask1_10.txt | WA | 1220 ms | 4700 KB |
subtask1_11.txt | WA | 1023 ms | 4652 KB |
subtask1_12.txt | WA | 1009 ms | 4648 KB |
subtask1_13.txt | WA | 1024 ms | 4636 KB |
subtask1_14.txt | WA | 992 ms | 4596 KB |
subtask1_15.txt | WA | 1011 ms | 4700 KB |
subtask2_01.txt | TLE | 3031 ms | 4776 KB |
subtask2_02.txt | TLE | 3033 ms | 4772 KB |
subtask2_03.txt | TLE | 3031 ms | 4780 KB |
subtask2_04.txt | TLE | 3031 ms | 4768 KB |
subtask2_05.txt | WA | 117 ms | 1184 KB |
subtask2_06.txt | TLE | 3032 ms | 4724 KB |
subtask2_07.txt | TLE | 3033 ms | 4756 KB |
subtask2_08.txt | TLE | 3038 ms | 4772 KB |
subtask2_09.txt | TLE | 3031 ms | 4772 KB |
subtask2_10.txt | TLE | 3032 ms | 4776 KB |
subtask2_11.txt | TLE | 3032 ms | 4780 KB |
subtask2_12.txt | TLE | 3031 ms | 4776 KB |
subtask2_13.txt | TLE | 3031 ms | 4704 KB |
subtask2_14.txt | TLE | 3032 ms | 4780 KB |
subtask2_15.txt | TLE | 3033 ms | 4772 KB |
subtask2_16.txt | TLE | 3032 ms | 4772 KB |
subtask2_17.txt | TLE | 3031 ms | 4764 KB |
subtask2_18.txt | TLE | 3032 ms | 4776 KB |
subtask2_19.txt | TLE | 3032 ms | 4772 KB |
subtask2_20.txt | TLE | 3031 ms | 4768 KB |
subtask2_21.txt | TLE | 3032 ms | 4768 KB |
subtask2_22.txt | TLE | 3031 ms | 4760 KB |
subtask2_23.txt | TLE | 3033 ms | 4768 KB |
subtask2_24.txt | TLE | 3032 ms | 4772 KB |
subtask2_25.txt | TLE | 3033 ms | 4756 KB |