Submission #56754

#TimeUsernameProblemLanguageResultExecution timeMemory
56754SpeedOfMagicNetwork (BOI15_net)C++17
0 / 100
12 ms12272 KiB
/** MIT License Copyright (c) 2018 Vasilyev Daniil **/ #include <bits/stdc++.h> using namespace std; #pragma GCC optimize("Ofast") template<typename T> using v = vector<T>; //#define int long long typedef string str; typedef vector<int> vint; #define rep(a, l, r) for(int a = (l); a < (r); a++) #define pb push_back #define sz(a) ((int) a.size()) const long long inf = 4611686018427387903; //2^62 - 1 #if 0 //FileIO const string fileName = ""; ifstream fin ((fileName == "" ? "input.txt" : fileName + ".in" )); ofstream fout((fileName == "" ? "output.txt" : fileName + ".out")); #define get fin>> #define put fout<< #else #define get cin>> #define put cout<< #endif #define eol put endl void read() {} template<typename Arg,typename... Args> void read (Arg& arg,Args&... args){get (arg) ;read(args...) ;} void print(){} template<typename Arg,typename... Args> void print(Arg arg,Args... args){put (arg)<<" ";print(args...);} void debug(){eol;} template<typename Arg,typename... Args> void debug(Arg arg,Args... args){put (arg)<<" ";debug(args...);} int getInt(){int a; get a; return a;} //code goes here const int N = 5e5 + 1; vint leaves; vint g[N]; void dfs(int cur = 1, int p = -1) { if (sz(g[cur]) == 1) leaves.pb(cur); for (int i : g[cur]) if (i != p) dfs(i, cur); } void run() { int n; get n; n++; rep(i, 2, n) { int v, u; read(v, u); g[v].pb(u); g[u].pb(v); } dfs(); put sz(leaves) / 2 + sz(leaves) % 2; eol; if (sz(leaves) % 2) leaves.pb(leaves[0]); for (int i = 0; i < sz(leaves); i += 2) { print(leaves[i], leaves[i + 1]); eol; } } int32_t main() {srand(time(0)); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); put fixed; put setprecision(15); run(); return 0;}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...