Submission #940745

#TimeUsernameProblemLanguageResultExecution timeMemory
940745PringVillage (BOI20_village)C++17
100 / 100
149 ms23680 KiB
#include <bits/stdc++.h> using namespace std; #ifdef MIKU const string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m"; #define debug(x...) cout << dbmc << '[' << #x << "] : ", dout(x) void dout() { cout << dbrs << endl; } template <typename T, typename ...U> void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); } #else #define debug(...) 39 #endif #define int long long #define fs first #define sc second #define mp make_pair #define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++) typedef pair<int, int> pii; const int MXN = 100005; int n; vector<int> edge[MXN]; namespace NSA { int ans, va[MXN], sz[MXN]; int bind[MXN]; bool DFS(int id, int par) { debug(id, par); vector<int> odd; for (auto &i : edge[id]) { if (i == par) continue; if (DFS(i, id)) odd.push_back(i); } // for (auto &i : odd) cout << i << ' '; // cout << endl; if (odd.empty()) return 1; if (odd.size() >= 2) { ans += 2 * odd.size(); odd.push_back(id); odd.push_back(odd[0]); FOR(i, 1, odd.size()) bind[odd[i - 1]] = odd[i]; } else { ans += 2; bind[id] = odd[0]; bind[odd[0]] = id; } return 0; } void DO() { if (DFS(1, 0)) { ans += 2; bind[1] = 1; int a = edge[1][0]; swap(bind[1], bind[a]); } copy(bind + 1, bind + n + 1, va + 1); } } namespace NSB { int ans, va[MXN]; int sz[MXN]; bitset<MXN> ban; int GET_ANS(int id, int par) { sz[id] = 1; int ans = 0; for (auto &i : edge[id]) { if (i == par) continue; ans += GET_ANS(i, id); sz[id] += sz[i]; } return (ans + min(n - sz[id], sz[id]) * 2); } void GET_SZ(int id, int par) { sz[id] = 1; for (auto &i : edge[id]) { if (i == par) continue; if (ban[i]) continue; GET_SZ(i, id); sz[id] += sz[i]; } } int GET_CD(int id, int par, int N) { for (auto &i : edge[id]) { if (i == par) continue; if (ban[i]) continue; if (sz[i] > N / 2) return GET_CD(i, id, N); } return id; } vector<int> CD(int id) { GET_SZ(id, 0); if (sz[id] == 1) return vector<int>(1, id); vector<int> w(sz[id]), wid; for (int i = 0; i < sz[id]; i += 2) wid.push_back(i); for (int i = 1; i < sz[id]; i += 2) wid.push_back(i); int cd = GET_CD(id, 0, sz[id]); vector<vector<int>> v; ban[cd] = true; for (auto &i : edge[cd]) { if (ban[i]) continue; v.push_back(CD(i)); } sort(v.begin(), v.end(), [&](vector<int> &a, vector<int> &b) -> bool { return a.size() > b.size(); }); v.back().push_back(cd); int C = 0; for (auto &i : v) for (auto &j : i) w[wid[C++]] = j; return w; } void DO() { ans = GET_ANS(1, 0); vector<int> v = CD(1); v.push_back(v[0]); FOR(i, 1, n + 1) va[v[i - 1]] = v[i]; } } void miku() { int x, y; cin >> n; FOR(i, 1, n) { cin >> x >> y; edge[x].push_back(y); edge[y].push_back(x); } NSB::DO(); NSA::DO(); cout << NSA::ans << ' ' << NSB::ans << '\n'; FOR(i, 1, n + 1) cout << NSA::va[i] << ' '; cout << '\n'; FOR(i, 1, n + 1) cout << NSB::va[i] << ' '; cout << '\n'; } int32_t main() { cin.tie(0) -> sync_with_stdio(false); cin.exceptions(iostream::failbit); miku(); return 0; }

Compilation message (stderr)

Village.cpp: In function 'bool NSA::DFS(long long int, long long int)':
Village.cpp:11:20: warning: statement has no effect [-Wunused-value]
   11 | #define debug(...) 39
      |                    ^~
Village.cpp:30:9: note: in expansion of macro 'debug'
   30 |         debug(id, par);
      |         ^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...