Submission #229766


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(int *x, int *y){reader(x);reader(y);}
void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
template<class T1, class T2> void sort(int N, T1 a[], T2 b[], void *mem){int i;pair<T1,T2> *r=(pair<T1, T2>*)mem;rep(i,N)r[i].first=a[i],r[i].second=b[i];sort(r,r+N);rep(i,N)a[i]=r[i].first,b[i]=r[i].second;}

int N;
int val[1000000], add[1000000];

int main(){
  int i, j, k;
  int now, res;
  void *mem = malloc(10000000);

  reader(&N);
  rep(i,N){
    reader(&j,&k);
    val[2*i] = 2*j;
    val[2*i+1] = 2*j+1;
    add[2*i] = 1;
    add[2*i+1] = -1;
  }
  N *= 2;

  sort(N, val, add, mem);

  res = now = 0;
  rep(i,N){
    now += add[i];
    res = max(res, now);
  }

  writer(res,'\n');

  return 0;
}

Submission Info

Submission Time
Task C - AtColor
User LayCurse
Language C++ (G++ 4.6.4)
Score 0
Code Size 1279 Byte
Status WA
Exec Time 60 ms
Memory 3996 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
WA × 2
AC × 5
WA × 12
AC × 8
WA × 34
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 WA 24 ms 928 KB
subtask0_sample02.txt WA 25 ms 928 KB
subtask1_01.txt AC 24 ms 800 KB
subtask1_02.txt AC 25 ms 796 KB
subtask1_03.txt AC 25 ms 924 KB
subtask1_04.txt WA 24 ms 928 KB
subtask1_05.txt AC 23 ms 924 KB
subtask1_06.txt WA 23 ms 800 KB
subtask1_07.txt AC 25 ms 916 KB
subtask1_08.txt WA 26 ms 916 KB
subtask1_09.txt WA 26 ms 788 KB
subtask1_10.txt WA 25 ms 916 KB
subtask1_11.txt WA 24 ms 920 KB
subtask1_12.txt WA 24 ms 928 KB
subtask1_13.txt WA 27 ms 792 KB
subtask1_14.txt WA 25 ms 924 KB
subtask1_15.txt WA 25 ms 928 KB
subtask2_01.txt AC 46 ms 3820 KB
subtask2_02.txt WA 41 ms 3868 KB
subtask2_03.txt AC 42 ms 3868 KB
subtask2_04.txt WA 41 ms 3872 KB
subtask2_05.txt AC 39 ms 3872 KB
subtask2_06.txt WA 60 ms 3928 KB
subtask2_07.txt WA 58 ms 3876 KB
subtask2_08.txt WA 59 ms 3868 KB
subtask2_09.txt WA 59 ms 3868 KB
subtask2_10.txt WA 59 ms 3884 KB
subtask2_11.txt WA 58 ms 3868 KB
subtask2_12.txt WA 58 ms 3868 KB
subtask2_13.txt WA 58 ms 3876 KB
subtask2_14.txt WA 58 ms 3884 KB
subtask2_15.txt WA 58 ms 3872 KB
subtask2_16.txt WA 59 ms 3996 KB
subtask2_17.txt WA 56 ms 3872 KB
subtask2_18.txt WA 58 ms 3876 KB
subtask2_19.txt WA 58 ms 3876 KB
subtask2_20.txt WA 58 ms 3872 KB
subtask2_21.txt WA 59 ms 3872 KB
subtask2_22.txt WA 57 ms 3992 KB
subtask2_23.txt WA 59 ms 3872 KB
subtask2_24.txt WA 59 ms 3880 KB
subtask2_25.txt WA 59 ms 3872 KB