結果
問題 | No.74 貯金箱の退屈 |
ユーザー |
|
提出日時 | 2019-04-15 20:17:42 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,762 bytes |
コンパイル時間 | 1,833 ms |
コンパイル使用メモリ | 178,184 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-22 08:01:51 |
合計ジャッジ時間 | 2,872 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
// includes#include <bits/stdc++.h>// macros#define ll long long int#define pb emplace_back#define mk make_pair#define pq priority_queue#define FOR(i, a, b) for(int i=(a);i<(b);++i)#define rep(i, n) FOR(i, 0, n)#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)#define all(x) (x).begin(),(x).end()#define sz(x) ((int)(x).size())#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())#define FI first#define SE secondusing namespace std;// typestypedef pair<int, int> P;typedef pair<ll, int> Pl;typedef pair<ll, ll> Pll;typedef pair<double, double> Pd;// constantsconst int inf = 1e9;const ll linf = 1LL << 50;const double EPS = 1e-10;const int mod = 1e9 + 7;// solvetemplate <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}const int MAX_H = 510, MAX_W = 510;struct MatrixB {int H, W;bitset<MAX_W> val[MAX_H];MatrixB(int m = 1, int n = 1): H(m), W(n){}inline bitset<MAX_W>& operator[](size_t i){return val[i];}int gauss_jordan(bool is_extended = false){int rank = 0;for(int col = 0; col < W; col++){if(col == W - 1 && is_extended)break;int pivot = -1;for(int row = rank; row < H; row++){if(val[row][col]){pivot = row;break;}}if(pivot == -1)continue;swap(val[pivot], val[rank]);for(int row = 0; row < H; row++){if(row != rank && val[row][col])val[row] ^= val[rank];}rank++;}return rank;}};int linear_eq(MatrixB &A, vector<int> b, vector<int> & res){int m = A.H, n = A.W;MatrixB M(m, n + 1);for(int i = 0; i < m; i++){for(int j = 0; j < n; j++){M[i][j] = A[i][j];}M[i][n] = b[i];}int rank = M.gauss_jordan(true);for(int row = rank; row < m; row++){if(M[row][n])return -1;}res.assign(n, 0);for(int i = 0; i < rank; i++)res[i] = M[i][n];return rank;}set<int> v[101];int main(int argc, char const* argv[]){ios_base::sync_with_stdio(false);cin.tie(0);int n;cin >> n;vector<int> d(n), w(n);cin >> d >> w;rep(i, n){int in = (i + d[i]) % n;v[in].insert(i);in = (i - d[i]) % n;if(in < 0)in += n;v[in].insert(i);}MatrixB M(n, n);vector<int> b(n);rep(i, n){for(auto itr = v[i].begin(); itr != v[i].end(); ++itr){M[i][*itr] = 1;}if(w[i] == 0)b[i] = 1;else b[i] = 0;}vector<int> res;int rank = linear_eq(M, b, res);if(rank == -1)cout << "No" << endl;else cout << "Yes" << endl;return 0;}