結果

問題 No.74 貯金箱の退屈
ユーザー ir5ir5
提出日時 2024-06-21 23:29:08
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 3,505 bytes
コンパイル時間 2,048 ms
コンパイル使用メモリ 146,920 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-21 23:29:12
合計ジャッジ時間 3,251 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;
class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};
template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}";
    }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}";
    }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", ";
    return os << "}"; }
template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; }
#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif
struct UnionFindWithWeights {
vector<int> data, weights;
UnionFindWithWeights(int n) : data(n, -1), weights(n, 1) {}
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
bool find(int x, int y) { return root(x) == root(y); }
void uni(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
int new_weight = weights[x] + weights[y];
if (data[x] < data[y])
swap(x, y);
data[x] += data[y];
data[y] = x;
weights[x] = new_weight;
}
}
int weight(int x) { return weights[root(x)]; }
};
namespace solver {
template<typename T1, typename T2> struct In2 {
T1 a; T2 b;
friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; }
};
template<typename T1, typename T2, typename T3> struct In3 {
T1 a; T2 b; T3 c;
friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; }
};
int n;
vector<int> vd, vw;
void read() {
cin >> n;
take(vd, n);
take(vw, n);
}
using RetType = string;
RetType run() {
UnionFindWithWeights uf(n);
vector<int> selfloop;
for (int i : range(n)) {
int j = (i + vd[i]) % n;
int k = ((i - vd[i]) % n + n) % n;
if (j == k) selfloop.push_back(j);
else uf.uni(j, k);
}
vector<int> parity(n);
vector<int> ignore(n);
for (int i : range(n)) {
parity[uf.root(i)] ^= vw[i];
}
for (int i : selfloop) {
ignore[uf.root(i)] = 1;
}
for (int i : range(n)) {
int r = uf.root(i);
if (ignore[uf.root(i)]) continue;
if (parity[r] != (uf.weight(r) & 1)) return "No";
}
return "Yes";
}
} // namespace
template <typename F>
void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }
int main(int argc, char** argv) {
cerr << fixed << setprecision(12);
cout << fixed << setprecision(12);
int testcase = 1;
if (argc > 1) testcase = atoi(argv[1]);
while (testcase--) {
solver::read();
}
run(solver::run);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0