Submission #280194


Source Code Expand

#include <iostream>
#include <stdlib.h>
using namespace std;

int main()
{
  int n, ans;
  int *data, *aary, *bary;
  int i;

  data = (int *)malloc(sizeof(int)*1000001);
  aary = (int *)malloc(sizeof(int)*100000);
  bary = (int *)malloc(sizeof(int)*100000);

  for(int i=0;i<1000000;i++)
    data[i]=0;

  cin >> n;

  for(i=0;i<n;i++)
    cin >> aary[i] >> bary[i];

  for(i=0;i<n;i++){
    data[aary[i]]++;
    data[bary[i]+1]--;
  }

  for(i=1;i<1000000;i++){
    data[i] += data[i-1];
  }

  ans = data[0];
  for(i=1;i<1000000;i++){
    if(data[i]>data[i-1]) ans = data[i];
  }

  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task C - AtColor
User haneuma0628
Language C++ (G++ 4.6.4)
Score 0
Code Size 660 Byte
Status WA
Exec Time 140 ms
Memory 5476 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 1
WA × 1
AC × 8
WA × 9
AC × 13
WA × 29
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 33 ms 4648 KB
subtask0_sample02.txt WA 32 ms 4648 KB
subtask1_01.txt AC 32 ms 4648 KB
subtask1_02.txt AC 32 ms 4640 KB
subtask1_03.txt AC 34 ms 4708 KB
subtask1_04.txt AC 35 ms 4652 KB
subtask1_05.txt AC 35 ms 4704 KB
subtask1_06.txt AC 35 ms 4648 KB
subtask1_07.txt AC 33 ms 4648 KB
subtask1_08.txt WA 34 ms 4772 KB
subtask1_09.txt WA 34 ms 4592 KB
subtask1_10.txt WA 34 ms 4656 KB
subtask1_11.txt WA 34 ms 4768 KB
subtask1_12.txt WA 35 ms 4648 KB
subtask1_13.txt WA 34 ms 4644 KB
subtask1_14.txt WA 34 ms 4768 KB
subtask1_15.txt WA 34 ms 4652 KB
subtask2_01.txt AC 119 ms 5420 KB
subtask2_02.txt AC 140 ms 5416 KB
subtask2_03.txt AC 112 ms 5412 KB
subtask2_04.txt AC 137 ms 5416 KB
subtask2_05.txt AC 128 ms 5420 KB
subtask2_06.txt WA 135 ms 5416 KB
subtask2_07.txt WA 140 ms 5416 KB
subtask2_08.txt WA 138 ms 5468 KB
subtask2_09.txt WA 135 ms 5420 KB
subtask2_10.txt WA 136 ms 5412 KB
subtask2_11.txt WA 135 ms 5416 KB
subtask2_12.txt WA 135 ms 5416 KB
subtask2_13.txt WA 139 ms 5420 KB
subtask2_14.txt WA 138 ms 5416 KB
subtask2_15.txt WA 138 ms 5424 KB
subtask2_16.txt WA 136 ms 5408 KB
subtask2_17.txt WA 138 ms 5408 KB
subtask2_18.txt WA 139 ms 5416 KB
subtask2_19.txt WA 135 ms 5416 KB
subtask2_20.txt WA 136 ms 5416 KB
subtask2_21.txt WA 137 ms 5416 KB
subtask2_22.txt WA 139 ms 5420 KB
subtask2_23.txt WA 138 ms 5412 KB
subtask2_24.txt WA 140 ms 5416 KB
subtask2_25.txt WA 136 ms 5476 KB