Submission #711358

#	Time	Username	Problem	Language	Result	Execution time	Memory
711358		sysia	Village (BOI20_village)	C++17	0 / 100	1 ms	212 KiB

Village

//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

void solve(){
    int n; cin >> n;
    vector<vector<int>>g(n+1);
    for (int i = 1; i<n; i++){
        int a, b; cin >> a >> b;
        g[a].emplace_back(b);
        g[b].emplace_back(a);
    }
    int ans = 0;
    vector<int>mn(n+1);
    function<int(int, int)>dfs = [&](int v, int pa){
        int ile = -1;
        for (auto x: g[v]){
            if (x == pa) continue;
            auto now = dfs(x, v);
            if (now != -1) {
                if (ile != -1){
                    mn[now] = ile;
                    mn[ile] = now;
                    ans += 4;
                    ile = -1;
                } else {
                    ile = now;
                }
            }
        }
        if (ile != -1) {
            mn[v] = ile;
            mn[ile] = v;
            ans += 2;
            return -1LL;
        }
        return v;
    };
    dfs(1, 1);
    if (n&1){
        int x = g[1][0];
        int y = mn[x];
        mn[1] = x;
        mn[x] = y;
        mn[y] = 1;
        ans += 2;
    }
    cout << ans << " " << 2137 << "\n";
    for (int i = 1; i<=n; i++) cout << mn[i] << " ";
    cout << "\n";
    for (int i = 1; i<=n; i++) cout << 1 << " ";
    cout << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) solve();

    return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 38
• Subtask 3: 0 / 50