Submission #2521256


Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <numeric>
#include <complex>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)n;i++)

int a[100010];
int b[100010];
int sum[1000010];

int main() {
    int n;
    cin >> n;
    rep(i, n) {
        cin >> a[i] >> b[i];
    }
    rep(i, n) {
        for (int j = a[i]; j <= b[i]; j++) {
            sum[j]++;
        }
    }
    cout << *max_element(sum, sum + 1000010) << endl;
}

Submission Info

Submission Time
Task C - AtColor
User bplain
Language C++14 (GCC 5.4.1)
Score 30
Code Size 503 Byte
Status TLE
Exec Time 3155 ms
Memory 4864 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 2
AC × 17
AC × 18
TLE × 24
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 3 ms 2304 KB
subtask0_sample02.txt AC 5 ms 4352 KB
subtask1_01.txt AC 3 ms 2304 KB
subtask1_02.txt AC 3 ms 2304 KB
subtask1_03.txt AC 1402 ms 4352 KB
subtask1_04.txt AC 1401 ms 4352 KB
subtask1_05.txt AC 1401 ms 4352 KB
subtask1_06.txt AC 1400 ms 4352 KB
subtask1_07.txt AC 4 ms 2304 KB
subtask1_08.txt AC 472 ms 4352 KB
subtask1_09.txt AC 473 ms 4352 KB
subtask1_10.txt AC 469 ms 4352 KB
subtask1_11.txt AC 482 ms 4352 KB
subtask1_12.txt AC 463 ms 4352 KB
subtask1_13.txt AC 476 ms 4352 KB
subtask1_14.txt AC 459 ms 4352 KB
subtask1_15.txt AC 472 ms 4352 KB
subtask2_01.txt TLE 3155 ms 4864 KB
subtask2_02.txt TLE 3155 ms 4864 KB
subtask2_03.txt TLE 3155 ms 4864 KB
subtask2_04.txt TLE 3155 ms 4864 KB
subtask2_05.txt AC 73 ms 3328 KB
subtask2_06.txt TLE 3155 ms 4864 KB
subtask2_07.txt TLE 3155 ms 4864 KB
subtask2_08.txt TLE 3155 ms 4864 KB
subtask2_09.txt TLE 3155 ms 4864 KB
subtask2_10.txt TLE 3155 ms 4864 KB
subtask2_11.txt TLE 3155 ms 4864 KB
subtask2_12.txt TLE 3155 ms 4864 KB
subtask2_13.txt TLE 3155 ms 4864 KB
subtask2_14.txt TLE 3155 ms 4864 KB
subtask2_15.txt TLE 3155 ms 4864 KB
subtask2_16.txt TLE 3155 ms 4864 KB
subtask2_17.txt TLE 3155 ms 4864 KB
subtask2_18.txt TLE 3155 ms 4864 KB
subtask2_19.txt TLE 3155 ms 4864 KB
subtask2_20.txt TLE 3155 ms 4864 KB
subtask2_21.txt TLE 3155 ms 4864 KB
subtask2_22.txt TLE 3155 ms 4864 KB
subtask2_23.txt TLE 3155 ms 4864 KB
subtask2_24.txt TLE 3155 ms 4864 KB
subtask2_25.txt TLE 3155 ms 4864 KB