Submission #255282
Source Code Expand
#include <iostream> #define MAX_N 1000000 using namespace std; int main(){ int n; cin >> n; int a[n],b[n]; for(int i=0; i<n; i++) cin >> a[i] >> b[i]; //いもす法 int table[MAX_N]; for(int i=0; i<MAX_N; i++) table[i] = 0; for(int i=0; i<n; i++){ table[a[i]]++; table[b[i]]--; } for(int i=1; i<=MAX_N; i++) table[i] += table[i-1]; int max = 0; for(int i = 0; i<MAX_N; i++){ if(max < table[i]) max = table[i]; } cout << max << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | tanishiking24 |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 543 Byte |
Status | WA |
Exec Time | 142 ms |
Memory | 5548 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 | 35 ms | 4716 KB |
subtask0_sample02.txt | WA | 34 ms | 4768 KB |
subtask1_01.txt | WA | 34 ms | 4724 KB |
subtask1_02.txt | WA | 36 ms | 4780 KB |
subtask1_03.txt | AC | 36 ms | 4716 KB |
subtask1_04.txt | AC | 36 ms | 4720 KB |
subtask1_05.txt | AC | 37 ms | 4776 KB |
subtask1_06.txt | AC | 37 ms | 4724 KB |
subtask1_07.txt | WA | 37 ms | 4716 KB |
subtask1_08.txt | AC | 37 ms | 4712 KB |
subtask1_09.txt | AC | 36 ms | 4716 KB |
subtask1_10.txt | AC | 36 ms | 4712 KB |
subtask1_11.txt | AC | 36 ms | 4708 KB |
subtask1_12.txt | AC | 38 ms | 4776 KB |
subtask1_13.txt | AC | 38 ms | 4724 KB |
subtask1_14.txt | AC | 38 ms | 4708 KB |
subtask1_15.txt | AC | 36 ms | 4776 KB |
subtask2_01.txt | AC | 114 ms | 5484 KB |
subtask2_02.txt | AC | 133 ms | 5484 KB |
subtask2_03.txt | AC | 110 ms | 5536 KB |
subtask2_04.txt | AC | 130 ms | 5476 KB |
subtask2_05.txt | WA | 122 ms | 5484 KB |
subtask2_06.txt | AC | 135 ms | 5484 KB |
subtask2_07.txt | AC | 134 ms | 5488 KB |
subtask2_08.txt | AC | 132 ms | 5544 KB |
subtask2_09.txt | AC | 131 ms | 5484 KB |
subtask2_10.txt | AC | 132 ms | 5484 KB |
subtask2_11.txt | AC | 142 ms | 5480 KB |
subtask2_12.txt | WA | 133 ms | 5472 KB |
subtask2_13.txt | AC | 133 ms | 5484 KB |
subtask2_14.txt | AC | 131 ms | 5492 KB |
subtask2_15.txt | AC | 131 ms | 5472 KB |
subtask2_16.txt | AC | 135 ms | 5476 KB |
subtask2_17.txt | AC | 131 ms | 5480 KB |
subtask2_18.txt | AC | 142 ms | 5464 KB |
subtask2_19.txt | AC | 133 ms | 5548 KB |
subtask2_20.txt | AC | 131 ms | 5488 KB |
subtask2_21.txt | AC | 133 ms | 5492 KB |
subtask2_22.txt | AC | 134 ms | 5484 KB |
subtask2_23.txt | AC | 131 ms | 5472 KB |
subtask2_24.txt | AC | 131 ms | 5488 KB |
subtask2_25.txt | AC | 132 ms | 5476 KB |