結果
問題 | No.1640 簡単な色塗り |
ユーザー |
|
提出日時 | 2021-08-06 22:02:28 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,456 bytes |
コンパイル時間 | 2,526 ms |
コンパイル使用メモリ | 205,284 KB |
最終ジャッジ日時 | 2025-01-23 15:23:53 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 WA * 27 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i = 0; i < n; i++)#define rep2(i, x, n) for(int i = x; i <= n; i++)#define rep3(i, x, n) for(int i = x; i >= n; i--)#define each(e, v) for(auto &e: v)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;const int MOD = 1000000007;//const int MOD = 998244353;const int inf = (1<<30)-1;const ll INF = (1LL<<60)-1;template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};struct io_setup{io_setup(){ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;vector<int> u, v;template<bool directed = false>struct Graph{struct edge{int to, id;edge(int to, int id) : to(to), id(id) {}};vector<vector<edge>> es;const int n;int m;vector<int> ans;vector<bool> used;Graph(int n) : es(n), n(n), m(0), ans(n), used(n, false) {}void add_edge(int from, int to){es[from].emplace_back(to, m);if(!directed) es[to].emplace_back(from, m);m++;}vector<int> ids;void dfs1(int now, int pre = -1){used[now] = true;each(e, es[now]){if(e.to == pre) continue;if(used[e.to]) ids.eb(e.id);else dfs1(e.to, now);}}void dfs2(int now, int pre = -1){each(e, es[now]){if(e.to == pre || e.id == ids[0]) continue;ans[e.id] = e.to;dfs2(e.to, now);}}void solve(){rep(i, n){if(used[i]) continue;ids.clear();dfs1(i, -1);if(sz(ids) != 1){cout << "No\n";return;}int j = ids[0];dfs2(u[j]);ans[j] = u[j];}cout << "Yes\n";rep(i, n) cout << ans[i]+1 << '\n';}};int main(){int N; cin >> N;Graph G(N);u.resize(N), v.resize(N);rep(i, N){cin >> u[i] >> v[i]; u[i]--, v[i]--;G.add_edge(u[i], v[i]);}G.solve();}