結果
問題 | No.1053 ゲーミング棒 |
ユーザー | LayCurse |
提出日時 | 2020-05-15 21:28:26 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 6 ms / 2,000 ms |
コード長 | 3,706 bytes |
コンパイル時間 | 2,552 ms |
コンパイル使用メモリ | 213,812 KB |
実行使用メモリ | 6,016 KB |
最終ジャッジ日時 | 2024-09-19 09:15:12 |
合計ジャッジ時間 | 3,540 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 1 ms
5,376 KB |
testcase_12 | AC | 1 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 1 ms
5,376 KB |
testcase_17 | AC | 1 ms
5,376 KB |
testcase_18 | AC | 1 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 1 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 1 ms
5,376 KB |
testcase_23 | AC | 5 ms
5,632 KB |
testcase_24 | AC | 5 ms
5,632 KB |
testcase_25 | AC | 6 ms
6,016 KB |
testcase_26 | AC | 5 ms
6,016 KB |
testcase_27 | AC | 2 ms
5,376 KB |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 4 ms
5,376 KB |
testcase_31 | AC | 4 ms
5,632 KB |
testcase_32 | AC | 4 ms
5,760 KB |
testcase_33 | AC | 3 ms
5,760 KB |
testcase_34 | AC | 4 ms
5,632 KB |
testcase_35 | AC | 5 ms
5,760 KB |
testcase_36 | AC | 4 ms
5,760 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);}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');}}template<class S, class T> inline S moddw_L(S a, const T b){a %= b;if(a < 0){a += b;}return a;}template<class S, class T> inline S chmin(S &a, T b){if(a>b){a=b;}return a;}template<class S, class T> inline S chmax(S &a, T b){if(a<b){a=b;}return a;}template<class T> void arrRot(int k, int N, T A[], T B[] = NULL, void *mem = wmem){int i;int fg = 0;(k = moddw_L(k,N));if(B==NULL){walloc1d(&B, N, &mem);fg = 1;}for(i=(k);i<(N);i++){B[i-k] = A[i];}for(i=(0);i<(k);i++){B[N-k+i] = A[i];}if(fg){for(i=(0);i<(N);i++){A[i] = B[i];}}}int N;int A[100000];int mn[100000];int mx[100000];int cnt[100000];int main(){int loop;wmem = memarr;rd(N);{int Lj4PdHRW;for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){rd(A[Lj4PdHRW]);A[Lj4PdHRW] += (-1);}}for(loop=(0);loop<(2);loop++){int i;for(i=(0);i<(N);i++){mn[i] = 1073709056;mx[i] = -1073709056;cnt[i] = 0;}for(i=(0);i<(N);i++){chmin(mn[A[i]], i);chmax(mx[A[i]], i);cnt[A[i]]++;}for(i=(0);i<(N);i++){if(cnt[i] && mx[i] - mn[i] + 1 != cnt[i]){break;}}if(i==N){wt_L(loop);wt_L('\n');return 0;}for(i=(1);i<(N);i++){if(A[i] != A[i-1]){break;}}arrRot(i, N, A);}wt_L(-1);wt_L('\n');return 0;}// cLay varsion 20200509-1// --- original code ---// int N, A[1d5];// int mn[1d5], mx[1d5], cnt[1d5];// {// rd(N,(A--)(N));// rep(loop,2){// rep(i,N) mn[i] = int_inf, mx[i] = -int_inf, cnt[i] = 0;// rep(i,N){// mn[A[i]] <?= i;// mx[A[i]] >?= i;// cnt[A[i]]++;// }// rep(i,N) if(cnt[i] && mx[i] - mn[i] + 1 != cnt[i]) break;// if(i==N) wt(loop), return 0;//// rep(i,1,N) if(A[i] != A[i-1]) break;// arrRot(i, N, A);// }// wt(-1);// }