結果

問題 No.190 Dry Wet Moist
ユーザー LayCurse
提出日時 2015-04-22 00:20:38
言語 C++11
(gcc 4.8.5)
結果
AC  
実行時間 33 ms
コード長 3,608 Byte
コンパイル時間 1,041 ms
使用メモリ 8,380 KB
最終ジャッジ日時 2019-05-12 17:37:33

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
00_sample_01.in AC 4 ms
3,512 KB
00_sample_02.in AC 4 ms
3,516 KB
10_small_01.in AC 3 ms
3,556 KB
10_small_02.in AC 4 ms
3,608 KB
10_small_03.in AC 4 ms
3,588 KB
10_small_04.in AC 4 ms
3,624 KB
10_small_05.in AC 4 ms
3,564 KB
20_small_01.in AC 6 ms
5,272 KB
20_small_02.in AC 5 ms
4,844 KB
20_small_03.in AC 5 ms
4,472 KB
20_small_04.in AC 5 ms
4,396 KB
20_small_05.in AC 6 ms
4,504 KB
30_large_01.in AC 20 ms
8,032 KB
30_large_02.in AC 22 ms
8,144 KB
30_large_03.in AC 19 ms
8,016 KB
30_large_04.in AC 24 ms
8,192 KB
30_large_05.in AC 28 ms
8,356 KB
30_large_06.in AC 10 ms
7,692 KB
30_large_07.in AC 17 ms
7,948 KB
30_large_08.in AC 27 ms
8,348 KB
30_large_09.in AC 21 ms
8,108 KB
30_large_10.in AC 10 ms
7,636 KB
40_corner_01.in AC 32 ms
8,372 KB
40_corner_02.in AC 33 ms
8,380 KB
40_corner_03.in AC 29 ms
4,288 KB
40_corner_04.in AC 4 ms
3,500 KB
40_corner_05.in AC 5 ms
3,504 KB
system_test1.txt AC 25 ms
8,092 KB
system_test2.txt AC 15 ms
7,820 KB
system_test3.txt AC 17 ms
7,880 KB
テストケース一括ダウンロード

ソースコード

diff #
#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(ll *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(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

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);}
void writer(ll x, char c){int s=0,m=0;char f[20];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);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

char memarr[17000000]; void *mem = memarr;
#define MD 1000000007

template<class T>
struct ullHash{
  ull *key; T *val; unsigned memory, size, mask;

  void clear(){memset(val,0,size*sizeof(T));}
  void clear(int sz){size=1;while(size<sz)size*=2;mask=size-1;clear();}
  void init(int mem, int sz){memory=mem;size=1;while(size<sz)size*=2;mask=size-1;if(memory<size)memory=size;key=(ull*)malloc(memory*sizeof(ull));val=(T*)malloc(memory*sizeof(T));if(size)clear();}
  int function(ull a){return (((a*123456789789ULL)>>32)*987654321321ULL)&mask;}
  T get(ull a){int i=function(a);for(;key[i]!=a&&val[i]!=0;)i=(i+1)&mask;if(key[i]!=a) return 0;return val[i];}
  void set(ull a, T v){int i=function(a);for(;key[i]!=a&&val[i]!=0;)i=(i+1)&mask;key[i]=a;val[i]=v;}
  T increase(ull a, T v = 1){int i=function(a);for(;key[i]!=a&&val[i]!=0;)i=(i+1)&mask;key[i]=a;return val[i]+=v;}
};


int N;
int A[300000];
int res[3];

int main(){
  int i, j, k, m, loop;
  int zero;
  ullHash<int> hs;

  hs.init(300000, 300000);

  reader(&N);
  N *= 2;
  rep(i,N) reader(A+i);
  sort(A, A+N);

  zero = 0;
  rep(i,N) if(A[i]==0) zero++;
  rep(i,N) if(A[i] > 0) hs.increase(A[i]);
  rep(i,N) if(A[i] < 0){
    k = -A[i];
    m = hs.get(k);
    if(m<=0) continue;
    res[2]++;

    m--;
    if(m==0) m -= 10;
    hs.set(k,m);
  }
  res[2] += zero/2;

  rep(loop,2){
    j = N-1;
    rep(i,N){
      while(i < j && A[i] + A[j] >= 0) j--;
      if(i >= j) break;
      res[loop]++;
      j--;
    }

    rep(i,N) A[i] *= -1;
    reverse(A, A+N);
  }

  writerArr(res,3);

  return 0;
}
0