結果
問題 | No.1285 ゴミ捨て |
ユーザー | LayCurse |
提出日時 | 2020-11-15 09:58:58 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 6 ms / 2,000 ms |
コード長 | 4,687 bytes |
コンパイル時間 | 3,006 ms |
コンパイル使用メモリ | 223,556 KB |
実行使用メモリ | 8,312 KB |
最終ジャッジ日時 | 2024-05-06 14:36:35 |
合計ジャッジ時間 | 4,028 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 3 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,948 KB |
testcase_07 | AC | 6 ms
6,948 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 4 ms
6,948 KB |
testcase_10 | AC | 6 ms
6,944 KB |
testcase_11 | AC | 6 ms
6,940 KB |
testcase_12 | AC | 5 ms
6,940 KB |
testcase_13 | AC | 5 ms
6,944 KB |
testcase_14 | AC | 6 ms
6,944 KB |
testcase_15 | AC | 5 ms
6,940 KB |
testcase_16 | AC | 3 ms
6,944 KB |
testcase_17 | AC | 3 ms
6,944 KB |
testcase_18 | AC | 3 ms
6,944 KB |
testcase_19 | AC | 4 ms
6,944 KB |
testcase_20 | AC | 3 ms
6,944 KB |
testcase_21 | AC | 3 ms
6,944 KB |
testcase_22 | AC | 6 ms
8,312 KB |
testcase_23 | AC | 6 ms
6,944 KB |
ソースコード
#pragma GCC optimize ("Ofast") #include<bits/stdc++.h> using namespace std; void*wmem; char memarr[96000000]; template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){ static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1}; (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] ); (*arr)=(T*)(*mem); (*mem)=((*arr)+x); } template<class T> inline void walloc1d(T **arr, int x1, int x2, void **mem = &wmem){ walloc1d(arr, x2-x1, mem); (*arr) -= x1; } void sortF_L(int N, unsigned A[], void *mem = wmem){ int i; int m; int bt; unsigned*arr; unsigned c; int*sz; if(N < 256){ sort(A, A+N); return; } bt = sizeof(unsigned) * 8; walloc1d(&arr, N, &mem); walloc1d(&sz, N, &mem); for(m=0;m<bt;m+=8){ for(i=(0);i<(257);i++){ sz[i] = 0; } for(i=(0);i<(N);i++){ sz[ 1+((A[i]>>m)&255u) ]++; } for(i=(1);i<(257);i++){ sz[i] += sz[i-1]; } for(i=(0);i<(N);i++){ c = ((A[i]>>m)&255u); arr[sz[c]++] = A[i]; } swap(A, arr); } } void sortF_L(int N, int A[], void *mem = wmem){ int i; int x; int y; int z; int*arr; unsigned*send; if(N < 256){ sort(A, A+N); return; } send = (unsigned*)A; sortF_L(N, send, mem); if(A[0] < 0 || A[N-1] >= 0){ return; } x = 0; y = N; while(x < y){ z = (x+y) / 2; if(A[z] < 0){ y = z; } else{ x = z+1; } } walloc1d(&arr, N, &mem); z = 0; for(i=(x);i<(N);i++){ arr[z++] = A[i]; } for(i=(0);i<(x);i++){ arr[z++] = A[i]; } for(i=(0);i<(N);i++){ A[i] = arr[i]; } } void sortF_L(int N, unsigned long long A[], void *mem = wmem){ int i; int m; int bt; unsigned long long*arr; unsigned c; int*sz; if(N < 512){ sort(A, A+N); return; } bt = sizeof(unsigned long long) * 8; walloc1d(&arr, N, &mem); walloc1d(&sz, N, &mem); for(m=0;m<bt;m+=8){ for(i=(0);i<(257);i++){ sz[i] = 0; } for(i=(0);i<(N);i++){ sz[ 1+((A[i]>>m)&255u) ]++; } for(i=(1);i<(257);i++){ sz[i] += sz[i-1]; } for(i=(0);i<(N);i++){ c = ((A[i]>>m)&255u); arr[sz[c]++] = A[i]; } swap(A, arr); } } void sortF_L(int N, long long A[], void *mem = wmem){ int i; int x; int y; int z; long long*arr; unsigned long long*send; if(N < 512){ sort(A, A+N); return; } send = (unsigned long long*)A; sortF_L(N, send, mem); if(A[0] < 0 || A[N-1] >= 0){ return; } x = 0; y = N; while(x < y){ z = (x+y) / 2; if(A[z] < 0){ y = z; } else{ x = z+1; } } walloc1d(&arr, N, &mem); z = 0; for(i=(x);i<(N);i++){ arr[z++] = A[i]; } for(i=(0);i<(x);i++){ arr[z++] = A[i]; } for(i=(0);i<(N);i++){ A[i] = arr[i]; } } inline int my_getchar_unlocked(){ static char buf[1048576]; static int s = 1048576; static int e = 1048576; if(s == e && e == 1048576){ e = fread_unlocked(buf, 1, 1048576, stdin); s = 0; } if(s == e){ return EOF; } return buf[s++]; } inline void rd(int &x){ int k; int m=0; x=0; for(;;){ k = my_getchar_unlocked(); if(k=='-'){ m=1; break; } if('0'<=k&&k<='9'){ x=k-'0'; break; } } for(;;){ k = my_getchar_unlocked(); if(k<'0'||k>'9'){ break; } x=x*10+k-'0'; } if(m){ x=-x; } } struct MY_WRITER{ char buf[1048576]; int s; int e; MY_WRITER(){ s = 0; e = 1048576; } ~MY_WRITER(){ if(s){ fwrite_unlocked(buf, 1, s, stdout); } } } ; MY_WRITER MY_WRITER_VAR; void my_putchar_unlocked(int a){ if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){ fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout); MY_WRITER_VAR.s = 0; } MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a; } inline void wt_L(char a){ my_putchar_unlocked(a); } inline void wt_L(int x){ int s=0; int 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){ my_putchar_unlocked('-'); } while(s--){ my_putchar_unlocked(f[s]+'0'); } } int N; int A[100000]; int main(){ int i; wmem = memarr; rd(N); { int Lj4PdHRW; for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){ rd(A[Lj4PdHRW]); } } sortF_L(N,A); for(i=(1);i<(N);i++){ if(A[i]==A[i-1]+1){ wt_L(2); wt_L('\n'); return 0; } } wt_L(1); wt_L('\n'); return 0; } // cLay varsion 20201115-1 // --- original code --- // int N, A[1d5]; // { // rd(N,A(N)); // sortF(N,A); // rep(i,1,N) if(A[i]==A[i-1]+1) wt(2), return 0; // wt(1); // }