Submission #230436
Source Code Expand
#include <iostream> using namespace std; int main() { int x[1000001]={0}; int t, a, b, i,j, max; cin >> t; //for(i = 0; i < 1000001; i++) { // x[i] = 0; //} for(i = 0; i < t; i++) { cin >> a >> b; for (j = a; j <= b; j++) { x[j]++; } } max = 0; for(i = 0; i < 1000001; i++) { if (max < x[i]) max = x[i]; } cout << max; return 0; } /* x = Array.new(1000001, 0) t = gets.chomp.to_i t.times { a, b = gets.chomp.split(" ").map(&:to_i) for i in a..b do x[i] += 1 end } puts x.max */
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | hafeos |
Language | C++11 (GCC 4.8.1) |
Score | 0 |
Code Size | 572 Byte |
Status | WA |
Exec Time | 3034 ms |
Memory | 4776 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 | 32 ms | 4768 KB |
subtask0_sample02.txt | WA | 35 ms | 4636 KB |
subtask1_01.txt | WA | 32 ms | 4580 KB |
subtask1_02.txt | WA | 32 ms | 4768 KB |
subtask1_03.txt | WA | 2482 ms | 4576 KB |
subtask1_04.txt | WA | 2484 ms | 4760 KB |
subtask1_05.txt | WA | 2497 ms | 4640 KB |
subtask1_06.txt | WA | 2477 ms | 4644 KB |
subtask1_07.txt | WA | 35 ms | 4760 KB |
subtask1_08.txt | WA | 850 ms | 4644 KB |
subtask1_09.txt | WA | 850 ms | 4640 KB |
subtask1_10.txt | WA | 845 ms | 4636 KB |
subtask1_11.txt | WA | 869 ms | 4764 KB |
subtask1_12.txt | WA | 836 ms | 4768 KB |
subtask1_13.txt | WA | 856 ms | 4764 KB |
subtask1_14.txt | WA | 827 ms | 4768 KB |
subtask1_15.txt | WA | 848 ms | 4644 KB |
subtask2_01.txt | TLE | 3033 ms | 4768 KB |
subtask2_02.txt | TLE | 3033 ms | 4776 KB |
subtask2_03.txt | TLE | 3033 ms | 4772 KB |
subtask2_04.txt | TLE | 3032 ms | 4772 KB |
subtask2_05.txt | WA | 138 ms | 4648 KB |
subtask2_06.txt | TLE | 3033 ms | 4772 KB |
subtask2_07.txt | TLE | 3033 ms | 4772 KB |
subtask2_08.txt | TLE | 3033 ms | 4768 KB |
subtask2_09.txt | TLE | 3033 ms | 4772 KB |
subtask2_10.txt | TLE | 3033 ms | 4768 KB |
subtask2_11.txt | TLE | 3032 ms | 4772 KB |
subtask2_12.txt | TLE | 3032 ms | 4772 KB |
subtask2_13.txt | TLE | 3033 ms | 4768 KB |
subtask2_14.txt | TLE | 3033 ms | 4764 KB |
subtask2_15.txt | TLE | 3033 ms | 4772 KB |
subtask2_16.txt | TLE | 3032 ms | 4764 KB |
subtask2_17.txt | TLE | 3033 ms | 4768 KB |
subtask2_18.txt | TLE | 3032 ms | 4768 KB |
subtask2_19.txt | TLE | 3034 ms | 4772 KB |
subtask2_20.txt | TLE | 3032 ms | 4772 KB |
subtask2_21.txt | TLE | 3033 ms | 4776 KB |
subtask2_22.txt | TLE | 3033 ms | 4764 KB |
subtask2_23.txt | TLE | 3033 ms | 4768 KB |
subtask2_24.txt | TLE | 3034 ms | 4700 KB |
subtask2_25.txt | TLE | 3033 ms | 4772 KB |