結果
問題 | No.74 貯金箱の退屈 |
ユーザー |
![]() |
提出日時 | 2014-11-20 23:39:58 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,825 bytes |
コンパイル時間 | 1,608 ms |
コンパイル使用メモリ | 159,304 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2025-01-02 19:27:51 |
合計ジャッジ時間 | 2,392 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
#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 llvoid 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);}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(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');}int binaryGaussJordan(int r, int c, int right, ull **mat){int i,j,k,b =(c+right+63)/64,a=0;rep(j,c){REP(i,a,r)if(mat[i][j>>6]&(1ULL<<(j&63))) break;if(i==r)continue;if(i!=a)REP(k,j>>6,b)swap(mat[i][k],mat[a][k]);REP(i,a+1,r)if(mat[i][j>>6]&(1ULL<<(j&63)))REP(k,j>>6,b)mat[i][k]^=mat[a][k];a++;}return a;}int N;int D[1000], W[1000];ull *mat[222];int main(){int i, j, k;reader(&N);rep(i,N) reader(D+i);rep(i,N) reader(W+i);rep(i,N) mat[i] = (ull*)malloc(10000);rep(i,N){j = (i + D[i]) % N;k = (i - D[i] + 100000*N) % N;mat[j][i/64] |= 1ULL<<(i%64);mat[k][i/64] |= 1ULL<<(i%64);}rep(i,N) if(W[i]==0) mat[i][N/64] |= 1ULL<<(N%64);k = binaryGaussJordan(N, N, 1, mat);REP(i,k,N) if(mat[i][N/64]&(1ULL<<(N%64))) break;writerLn(i==N?"Yes":"No");return 0;}