結果
問題 | No.74 貯金箱の退屈 |
ユーザー |
|
提出日時 | 2019-10-25 12:27:21 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,597 bytes |
コンパイル時間 | 660 ms |
コンパイル使用メモリ | 86,872 KB |
最終ジャッジ日時 | 2024-11-14 21:47:21 |
合計ジャッジ時間 | 1,217 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:17:39: error: '::numeric_limits' has not been declared 17 | template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; | ^~~~~~~~~~~~~~ main.cpp:17:55: error: expected primary-expression before '>' token 17 | template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; | ^ main.cpp:17:61: error: no matching function for call to 'max()' 17 | template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; | ~~~~~^~ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:50, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:38, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39, from main.cpp:1: /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)' 254 | max(const _Tp& __a, const _Tp& __b) | ^~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: template argument deduction/substitution failed: main.cpp:17:61: note: candidate expects 2 arguments, 0 provided 17 | template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; | ~~~~~^~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:300:5: n
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <map>#include <set>#include <queue>#include <stack>#include <numeric>#include <bitset>#include <cmath>static const int MOD = 1000000007;using ll = long long;using u32 = uint32_t;using namespace std;template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;class UnionFind {int n;vector<int> uni;public:explicit UnionFind(int n) : uni(static_cast<u32>(n), -1) , n(n){};int root(int a){if (uni[a] < 0) return a;else return (uni[a] = root(uni[a]));}bool unite(int a, int b) {a = root(a);b = root(b);if(a == b) return false;if(uni[a] > uni[b]) swap(a, b);uni[a] += uni[b];uni[b] = a;return true;}int size(int i){ return -uni[root(i)]; }bool same(int a, int b) { return root(a) == root(b); }};int main() {int n;cin >> n;vector<int> d(n), w(n);for (auto &&i : d) scanf("%d", &i);for (auto &&j : w) scanf("%d", &j);vector<int> ok(n), cnt(n);UnionFind uf(n);for (int i = 0; i < n; ++i) {int l = (i+(n-1)*d[i])%n, r = (i+d[i])%n;if(l == r) ok[l] = 1;uf.unite(l, r);}for (int i = 0; i < n; ++i) {cnt[uf.root(i)] += 1-w[i];ok[uf.root(i)] += ok[i];}for (int i = 0; i < n; ++i) {if(uf.root(i) == i){if(!ok[i] && cnt[i] & 1){puts("No");return 0;}}}puts("Yes");return 0;}