結果
問題 | No.1640 簡単な色塗り |
ユーザー | akua |
提出日時 | 2022-09-18 16:26:37 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,487 bytes |
コンパイル時間 | 4,277 ms |
コンパイル使用メモリ | 214,260 KB |
実行使用メモリ | 335,276 KB |
最終ジャッジ日時 | 2024-06-01 15:35:39 |
合計ジャッジ時間 | 43,022 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 391 ms
315,720 KB |
testcase_01 | AC | 390 ms
315,748 KB |
testcase_02 | AC | 389 ms
315,812 KB |
testcase_03 | AC | 389 ms
315,720 KB |
testcase_04 | AC | 636 ms
335,276 KB |
testcase_05 | AC | 630 ms
335,228 KB |
testcase_06 | AC | 380 ms
315,720 KB |
testcase_07 | AC | 380 ms
315,708 KB |
testcase_08 | AC | 377 ms
315,720 KB |
testcase_09 | AC | 379 ms
315,764 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 392 ms
317,792 KB |
testcase_31 | AC | 503 ms
329,508 KB |
testcase_32 | AC | 481 ms
327,628 KB |
testcase_33 | AC | 439 ms
323,848 KB |
testcase_34 | AC | 458 ms
325,840 KB |
testcase_35 | AC | 445 ms
323,864 KB |
testcase_36 | AC | 393 ms
317,788 KB |
testcase_37 | AC | 399 ms
318,600 KB |
testcase_38 | AC | 488 ms
328,192 KB |
testcase_39 | AC | 415 ms
321,096 KB |
testcase_40 | AC | 415 ms
321,260 KB |
testcase_41 | AC | 470 ms
326,192 KB |
testcase_42 | AC | 426 ms
321,960 KB |
testcase_43 | AC | 427 ms
322,236 KB |
testcase_44 | AC | 426 ms
322,008 KB |
testcase_45 | AC | 414 ms
320,548 KB |
testcase_46 | AC | 398 ms
318,204 KB |
testcase_47 | AC | 388 ms
317,212 KB |
testcase_48 | AC | 489 ms
328,424 KB |
testcase_49 | AC | 386 ms
316,360 KB |
testcase_50 | AC | 383 ms
315,720 KB |
testcase_51 | AC | 383 ms
315,808 KB |
testcase_52 | WA | - |
testcase_53 | WA | - |
07_evil_01.txt | WA | - |
07_evil_02.txt | WA | - |
ソースコード
#include <atcoder/all> #include <iostream> // cout, endl, cin #include <string> // string, to_string, stoi #include <vector> // vector #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound #include <utility> // pair, make_pair #include <tuple> // tuple, make_tuple #include <cstdint> // int64_t, int*_t #include <cstdio> // printf #include <map> // map #include <queue> // queue, priority_queue #include <set> // set #include <stack> // stack #include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset #include <cctype> // isupper, islower, isdigit, toupper, tolower #include <math.h> #include <iomanip> using namespace std; using namespace atcoder; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++) typedef long long ll; typedef unsigned long long ull; const ll inf=1e18; using graph = vector<vector<int> > ; using P= pair<ll,ll>; using vi=vector<int>; using vvi=vector<vi>; using vll=vector<ll>; using vvll=vector<vll>; using vp=vector<P>; using vpp=vector<vp>; //string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; //string S="abcdefghijklmnopqrstuvwxyz"; //g++ main.cpp -std=c++14 -I . //cout <<setprecision(20); //cout << fixed << setprecision(10); //cin.tie(0); ios::sync_with_stdio(false); const double PI = acos(-1); int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1}; ll pow_pow(ll x,ll n,ll mod){ if(n==0) return 1; x%=mod; ll res=pow_pow(x*x%mod,n/2,mod); if(n&1)res=res*x%mod; return res; } struct UnionFind { vector<int> par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x; else return par[x] = root(par[x]); } bool issame(int x, int y) { return root(x) == root(y); } bool unite(int x, int y) { x = root(x), y = root(y); if (x == y) return false; if (siz[x] < siz[y]) swap(x, y); par[y] = x; siz[x] += siz[y]; return true; } int size(int x) { return siz[root(x)]; } }; ll gcd(ll x,ll y){ if(y==0)return x; return gcd(y,x%y); } ll lcm(ll x,ll y){ return ll(x/gcd(x,y))*y; } template<class T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else return false; } template<class T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else return false; } // https://youtu.be/L8grWxBlIZ4?t=9858 // https://youtu.be/ERZuLAxZffQ?t=4807 : optimize // https://youtu.be/8uowVvQ_-Mo?t=1329 : division const ll mod =1e9+7; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, const mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} // combination mod prime // https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619 struct combination { vector<mint> fact, ifact; combination(int n):fact(n+1),ifact(n+1) { //assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(20000050); using vm=vector<mint> ; using vvm=vector<vm> ; ll sqrt_(ll x) { ll l = 0, r = ll(3e9)+1; while (l+1<r) { ll c = (l+r)/2; if (c*c <= x) l = c; else r = c; } return l; } int valid(int x,int y,int h,int w){ if(x>=0 && y>=0 && x<h && y<w)return 1; else return 0; } ll comb[51][51]; void init_comb(){ comb[0][0]=1; for(int i=1; i<=50; i++){ for(int j=0; j<=i; j++){ if(j==0 || j==i)comb[i][j]=1; else comb[i][j]=comb[i-1][j]+comb[i-1][j-1]; } } } ll nCk(int n,int k){ return comb[n][k]; } struct edge{ int to; int id; edge(int to,int id) : to(to),id(id) {} }; using ve=vector<edge>; using vve =vector<ve>; map<ll,ll>d; void comp(vll&a){ set<ll>s(a.begin(),a.end()); int cnt=0; for(auto y:s)d[y]=cnt++; for(auto&y:a)y=d[y]; } int main(){cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; vi a(n),b(n),edges(n),deg(n); vve g(n); map<P,int> mp; UnionFind uf(n); rep(i,n)cin >> a[i] >> b[i],a[i]--,b[i]--; rep(i,n)if(a[i]>b[i])swap(a[i],b[i]); int ok=1; rep(i,n){ mp[P(a[i],b[i])]++; if(mp[P(a[i],b[i])]>=3)ok=0; } if(!ok){ cout << "No" << endl; return 0; } rep(i,n){ deg[a[i]]++;deg[b[i]]++; g[a[i]].push_back(edge(b[i],i)); g[b[i]].push_back(edge(a[i],i)); int pa=uf.root(a[i]),pb=uf.root(b[i]); if(uf.issame(a[i],b[i])){ edges[pa]++;continue; } uf.unite(a[i],b[i]); if(uf.root(pa)!=pa)edges[pb]+=(edges[pa]+1); else edges[pa]+=(edges[pb]+1); } rep(i,n){ if(i!=uf.root(i))continue; if(edges[i]!=uf.size(i)){ ok=0; } } if(!ok){ cout << "No" << endl; return 0; } set<int> st; queue<int> q; vi used(n); rep(i,n)if(deg[i]==1)q.push(i); vi anss(n); while(!q.empty()){ int v=q.front();q.pop(); anss[g[v][0].id]=v; used[g[v][0].id]=1; st.insert(v); } rep(v,n){ for(auto u:g[v]){ int id=u.id; if(used[id])continue; if(st.find(v)==st.end()){ anss[id]=v;st.insert(v); } else { anss[id]=u.to;st.insert(u.to); } used[id]=1; } } cout << "Yes" << endl; rep(i,n)anss[i]++; rep(i,n)cout << anss[i] << endl; }