Submission #255290


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 + 2]; //0~1000001---1000001はb[i]=1000000+1
  for(int i=0; i<=MAX_N; i++) table[i] = 0;

  for(int i=0; i<n; i++){
    table[a[i]]++;
    table[b[i]+1]--;
  }

  for(int i=1; i<=MAX_N; i++) table[i] += table[i-1];

  int max = table[0];
  for(int i = 0; i<=MAX_N; i++){
    if(max < table[i])
      max = table[i];
  }

  cout << max << endl;

  return 0;
}

Submission Info

Submission Time
Task C - AtColor
User tanishiking24
Language C++ (G++ 4.6.4)
Score 100
Code Size 595 Byte
Status AC
Exec Time 162 ms
Memory 5732 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 43 ms 4828 KB
subtask0_sample02.txt AC 41 ms 4828 KB
subtask1_01.txt AC 42 ms 4968 KB
subtask1_02.txt AC 42 ms 4824 KB
subtask1_03.txt AC 43 ms 4828 KB
subtask1_04.txt AC 47 ms 4824 KB
subtask1_05.txt AC 45 ms 4952 KB
subtask1_06.txt AC 45 ms 4948 KB
subtask1_07.txt AC 45 ms 4952 KB
subtask1_08.txt AC 44 ms 4968 KB
subtask1_09.txt AC 45 ms 4952 KB
subtask1_10.txt AC 43 ms 4948 KB
subtask1_11.txt AC 46 ms 4948 KB
subtask1_12.txt AC 44 ms 4824 KB
subtask1_13.txt AC 45 ms 4824 KB
subtask1_14.txt AC 47 ms 4824 KB
subtask1_15.txt AC 45 ms 4824 KB
subtask2_01.txt AC 141 ms 5592 KB
subtask2_02.txt AC 157 ms 5716 KB
subtask2_03.txt AC 132 ms 5608 KB
subtask2_04.txt AC 157 ms 5592 KB
subtask2_05.txt AC 149 ms 5592 KB
subtask2_06.txt AC 159 ms 5720 KB
subtask2_07.txt AC 158 ms 5592 KB
subtask2_08.txt AC 159 ms 5720 KB
subtask2_09.txt AC 158 ms 5592 KB
subtask2_10.txt AC 157 ms 5592 KB
subtask2_11.txt AC 162 ms 5720 KB
subtask2_12.txt AC 157 ms 5592 KB
subtask2_13.txt AC 157 ms 5592 KB
subtask2_14.txt AC 160 ms 5592 KB
subtask2_15.txt AC 159 ms 5588 KB
subtask2_16.txt AC 156 ms 5600 KB
subtask2_17.txt AC 159 ms 5588 KB
subtask2_18.txt AC 159 ms 5596 KB
subtask2_19.txt AC 158 ms 5596 KB
subtask2_20.txt AC 159 ms 5716 KB
subtask2_21.txt AC 158 ms 5592 KB
subtask2_22.txt AC 157 ms 5732 KB
subtask2_23.txt AC 160 ms 5592 KB
subtask2_24.txt AC 160 ms 5596 KB
subtask2_25.txt AC 156 ms 5592 KB