結果

問題 No.74 貯金箱の退屈
コンテスト
ユーザー heno239
提出日時 2020-01-26 00:15:15
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 8 ms / 5,000 ms
コード長 3,863 bytes
コンパイル時間 1,241 ms
コンパイル使用メモリ 122,116 KB
実行使用メモリ 20,036 KB
最終ジャッジ日時 2024-09-14 04:18:27
合計ジャッジ時間 2,615 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };


typedef vector<int> vec;
typedef vector<vec> mat;
int Gaussian_elimination(mat &A) {
	int n = A.size(); int m = A[0].size();
	int le = 0;
	rep(j, m) {
		Rep(i, le, n) {
			if (A[i][j]) {
				swap(A[le], A[i]);
				Rep(i2, le + 1, n) {
					if (A[i2][j]) {
						rep(k, m) {
							A[i2][k] ^= A[le][k];
						}
					}
				}
				le++; break;
			}
		}
	}
	return le;
}
bool can(vector<int> a, mat A) {
	int r = Gaussian_elimination(A);
	int n = a.size();
	rep(i, r) {
		rep(j, n)if (A[i][j]) {
			if (a[j]) {
				rep(k, n) {
					a[k] ^= A[i][k];
				}
			}
			break;
		}
	}
	bool f = true;
	rep(i, n) {
		if (a[i])f = false;
	}
	return f;
}
void solve() {
	int n; cin >> n;
	vector<int> d(n),w(n);
	rep(i, n)cin >> d[i];
	rep(i, n)cin >> w[i];
	mat A;
	rep(i, n) {
		int le = i - d[i];
		le = (le%n + n) % n;
		int ri = i + d[i];
		ri = (ri%n + n) % n;
		vector<int> ad(n, 0);
		ad[le] = ad[ri] = 1;
		A.push_back(ad);
	}
	vector<int> e(n); rep(i, n)e[i] = !w[i];
	if (can(e, A)) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init();
	//int t; cin >> t; rep(i, t)solve();
	//while (cin >> n, n)solve();
	solve();
	stop
		return 0;
}
0