結果
問題 |
No.1640 簡単な色塗り
|
ユーザー |
![]() |
提出日時 | 2025-08-26 22:11:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 4,436 bytes |
コンパイル時間 | 3,656 ms |
コンパイル使用メモリ | 191,712 KB |
実行使用メモリ | 22,400 KB |
最終ジャッジ日時 | 2025-08-26 22:11:54 |
合計ジャッジ時間 | 18,847 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 52 RE * 1 |
ソースコード
#include <algorithm> #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T>& v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>>& v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>>& v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T>& st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T>& ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T>& mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } using mint = modint998244353; void debug_mint1(vector<mint>& vec) { for (int i = 0; i < vec.size(); i++) { cerr << vec[i].val() << " "; } cerr << endl; } void debug_mint2(vector<vector<mint>>& vec) { for (int i = 0; i < vec.size(); i++) { for (int j = 0; j < vec[i].size(); j++) { cerr << vec[i][j].val() << " "; } cerr << endl; } } void dfs(vector<vector<pll>>& graph, vector<bool>& isvisited, ll v, vector<ll>& ans) { isvisited[v] = true; for (pll p : graph[v]) { if (isvisited[p.first]) { continue; } dfs(graph, isvisited, p.first, ans); ans[p.second] = p.first; } } int main() { ll N; cin >> N; vector<ll> A(N); vector<ll> B(N); for (ll i = 0; i < N; i++) { cin >> A[i] >> B[i]; A[i]--; B[i]--; } dsu tree(N); vector<ll> rem_i(N, -1); for (ll i = 0; i < N; i++) { if (tree.same(A[i], B[i])) { rem_i[i] = A[i]; } else { tree.merge(A[i], B[i]); } } vector<ll> tp(N, -1); vector<ll> ans(N, -1); ll cnt = 0; for (ll i = 0; i < N; i++) { if (rem_i[i] != -1) { tp[tree.leader(A[i])] = A[i]; cnt += tree.size(A[i]); ans[i] = A[i]; } } if (cnt != N) { cout << "No" << endl; return 0; } cout << "Yes" << endl; // DFS をする vector<vector<pll>> graph(N, vector<pll>(0)); for (ll i = 0; i < N; i++) { if (rem_i[i] != -1) { continue; } graph[A[i]].push_back(make_pair(B[i], i)); graph[B[i]].push_back(make_pair(A[i], i)); } vector<bool> isvisited(N, false); for (ll i = 0; i < N; i++) { if (tree.leader(i) == i) { dfs(graph, isvisited, tp[i], ans); } } for (ll i = 0; i < N; i++) { cout << ans[i] + 1 << endl; } }