結果

問題 No.74 貯金箱の退屈
ユーザー keikei
提出日時 2018-04-24 19:21:16
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 3,285 bytes
コンパイル時間 1,792 ms
コンパイル使用メモリ 180,948 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-27 16:02:45
合計ジャッジ時間 2,771 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

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

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " "
    ;} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out
    << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out <<
    it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
/*
<url:https://yukicoder.me/problems/no/74>
============================================================
退
N
N 1
D D D
1
=================================================================
=============================================================
================================================================
*/
void dfs(ll n,int group,vector<int>& check,vector<vector<ll>>&G){
if(check[n] != 0) return;
check[n] = group;
for(auto next:G[n]){
dfs(next,group,check,G);
}
}
string solve(){
ll N; cin >> N;
vector<ll> D(N); for(auto& in:D) cin >> in;
vector<int> W(N); for(auto& in:W) cin >> in;
vector<vector<ll>> G(N);
vector<ll> roots;
for(int i = 0; i < N;i++){
if((i+D[i])%N == (i-D[i]+10000*N)%N){
roots.push_back((i+D[i])%N);
}
else{
G[(i+D[i])%N].push_back((i-D[i]+10000*N)%N);
G[(i-D[i]+10000*N)%N].push_back((i+D[i])%N);
}
}
int group = 1;
vector<int> check(N,0);
for(int i = 0; i < N;i++){
if(check[i] != 0) continue;
dfs(i,group++,check,G);
}
map<ll,ll> mp;
for(int i = 0; i < N;i++) if(W[i] == 0) mp[check[i]]++;
for(auto root:roots) mp[check[root]] = 0;
for(auto p:mp){
if(p.second&1) return "No";
}
return "Yes";
}
int main(void) {
cin.tie(0); ios_base::sync_with_stdio(false);
cout << solve() << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0