Submission #255280


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<MAX_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 544 Byte
Status RE
Exec Time 362 ms
Memory 5744 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
RE × 2
RE × 17
RE × 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 RE 252 ms 4788 KB
subtask0_sample02.txt RE 260 ms 4792 KB
subtask1_01.txt RE 256 ms 4844 KB
subtask1_02.txt RE 256 ms 4788 KB
subtask1_03.txt RE 257 ms 4788 KB
subtask1_04.txt RE 259 ms 4844 KB
subtask1_05.txt RE 258 ms 4784 KB
subtask1_06.txt RE 259 ms 4788 KB
subtask1_07.txt RE 259 ms 4908 KB
subtask1_08.txt RE 262 ms 4900 KB
subtask1_09.txt RE 261 ms 4788 KB
subtask1_10.txt RE 265 ms 4932 KB
subtask1_11.txt RE 261 ms 4900 KB
subtask1_12.txt RE 253 ms 4792 KB
subtask1_13.txt RE 255 ms 4976 KB
subtask1_14.txt RE 258 ms 4788 KB
subtask1_15.txt RE 255 ms 4792 KB
subtask2_01.txt RE 334 ms 5552 KB
subtask2_02.txt RE 353 ms 5556 KB
subtask2_03.txt RE 335 ms 5560 KB
subtask2_04.txt RE 353 ms 5672 KB
subtask2_05.txt RE 348 ms 5560 KB
subtask2_06.txt RE 359 ms 5556 KB
subtask2_07.txt RE 356 ms 5552 KB
subtask2_08.txt RE 360 ms 5552 KB
subtask2_09.txt RE 358 ms 5556 KB
subtask2_10.txt RE 354 ms 5740 KB
subtask2_11.txt RE 354 ms 5560 KB
subtask2_12.txt RE 359 ms 5560 KB
subtask2_13.txt RE 359 ms 5556 KB
subtask2_14.txt RE 359 ms 5556 KB
subtask2_15.txt RE 359 ms 5556 KB
subtask2_16.txt RE 359 ms 5556 KB
subtask2_17.txt RE 360 ms 5600 KB
subtask2_18.txt RE 362 ms 5556 KB
subtask2_19.txt RE 353 ms 5556 KB
subtask2_20.txt RE 347 ms 5560 KB
subtask2_21.txt RE 351 ms 5556 KB
subtask2_22.txt RE 358 ms 5556 KB
subtask2_23.txt RE 355 ms 5744 KB
subtask2_24.txt RE 355 ms 5732 KB
subtask2_25.txt RE 354 ms 5560 KB