Submission #1438898


Source Code Expand

#include <iostream>
using namespace std;

const int MAX = 1e6 + 10;
int arr[MAX];

int main() {
  int n;
  cin >> n;
  int a, b;
  for (int i = 0; i < n; i++) {
    cin >> a >> b;
    arr[a]++;
    arr[b+1]--;
  }

  // 累積和をとる
  for (int i = 1; i < MAX; i++) arr[i] += arr[i-1];

  // 最大値を探す
  int maxi = 0;
  for (int i = 0; i < MAX; i++) {
    maxi = max(maxi, arr[i]);
  }

  // 解答
  cout << maxi << endl;

  return 0;
}

Submission Info

Submission Time
Task C - AtColor
User university
Language C++14 (GCC 5.4.1)
Score 100
Code Size 482 Byte
Status AC
Exec Time 94 ms
Memory 4224 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 2
AC × 17
AC × 42
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 6 ms 4096 KB
subtask0_sample02.txt AC 6 ms 4096 KB
subtask1_01.txt AC 6 ms 4096 KB
subtask1_02.txt AC 6 ms 4096 KB
subtask1_03.txt AC 8 ms 4096 KB
subtask1_04.txt AC 8 ms 4096 KB
subtask1_05.txt AC 8 ms 4096 KB
subtask1_06.txt AC 8 ms 4096 KB
subtask1_07.txt AC 8 ms 4096 KB
subtask1_08.txt AC 8 ms 4096 KB
subtask1_09.txt AC 8 ms 4096 KB
subtask1_10.txt AC 8 ms 4096 KB
subtask1_11.txt AC 8 ms 4096 KB
subtask1_12.txt AC 8 ms 4096 KB
subtask1_13.txt AC 8 ms 4096 KB
subtask1_14.txt AC 8 ms 4096 KB
subtask1_15.txt AC 8 ms 4096 KB
subtask2_01.txt AC 67 ms 4096 KB
subtask2_02.txt AC 86 ms 4096 KB
subtask2_03.txt AC 63 ms 4096 KB
subtask2_04.txt AC 81 ms 4096 KB
subtask2_05.txt AC 75 ms 4096 KB
subtask2_06.txt AC 92 ms 4096 KB
subtask2_07.txt AC 90 ms 4096 KB
subtask2_08.txt AC 91 ms 4096 KB
subtask2_09.txt AC 86 ms 4096 KB
subtask2_10.txt AC 86 ms 4096 KB
subtask2_11.txt AC 94 ms 4096 KB
subtask2_12.txt AC 86 ms 4096 KB
subtask2_13.txt AC 91 ms 4096 KB
subtask2_14.txt AC 89 ms 4096 KB
subtask2_15.txt AC 88 ms 4096 KB
subtask2_16.txt AC 87 ms 4096 KB
subtask2_17.txt AC 90 ms 4096 KB
subtask2_18.txt AC 89 ms 4224 KB
subtask2_19.txt AC 84 ms 4096 KB
subtask2_20.txt AC 88 ms 4096 KB
subtask2_21.txt AC 89 ms 4096 KB
subtask2_22.txt AC 85 ms 4096 KB
subtask2_23.txt AC 89 ms 4096 KB
subtask2_24.txt AC 86 ms 4096 KB
subtask2_25.txt AC 92 ms 4096 KB