제출 #712784

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
712784		Charizard2021	Network (BOI15_net)	C++17	63 / 100	2091 ms	62688 KiB

net

#include<bits/stdc++.h>
using namespace std;
const int N = 500001;
#define IOS ios::sync_with_stdio(false);; cin.tie(NULL)
bool visited[N];
int LeavesInsubtee[N];
vector<int> adj[N];
vector<int> res[N];
int n;
int ans = 0;
int cur_ans = 0;
int subtreeValue = 0;
void dfs(int u){
    visited[u] = true;
    if((int)adj[u].size() == 1){
        LeavesInsubtee[u] = 1;
    }
    for(int v : adj[u]){
        if(!visited[v]){
            dfs(v);
            LeavesInsubtee[u] += LeavesInsubtee[v];
        }
    }
}
void dfs2(int u){
    visited[u] = true;
    if((int)adj[u].size() == 1){
        res[subtreeValue].push_back(u);
    }
    for(int v : adj[u]){
        if(!visited[v]){
            dfs2(v);
        }
    }
}
int cutlocation(int u){
    visited[u] = true;
    for(int v : adj[u]){
        if(!visited[v]){
            if(LeavesInsubtee[v] > floor((cur_ans)/2)){
                return cutlocation(v);
            }
        }
    }
    return u;
}
int cut(int u){
    dfs(1);
    for(int i = 1; i <= n; i++){
        visited[i] = false;
    }
    int x = cutlocation(1);
    for(int i = 1; i <= n; i++){
        visited[i] = false;
    }
    visited[x] = true;
    for(int v : adj[x]){
        subtreeValue++;
        dfs2(v);
    }
    return x;
}
bool cmp(const vector<int>& a, const vector<int>& b){
    if(a.size() == b.size()){
        if(a.empty()){
            return true;
        }
        return a[0] > b[0];
    }
    return a.size() > b.size();
}
int main(){
    IOS;
    cin >> n;
    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    for(int i = 1; i <= n; i++){
        if((int)adj[i].size() == 1){
            ans++;
        }
    }
    cur_ans = ans;
    ans = (ans + 1)/2;
    cout << ans << "\n";
    int x12 = cut(n);
    int idx = 0;
    vector<int> finalAns(2 * ans);
    set<vector<int>, bool (*)(const vector<int> &, const vector<int> &)> s(cmp);
    for(int i = 1; i <= subtreeValue; i++){
        s.insert(res[i]);
    }
    while(true){
        vector<int> a = *(s.begin());
        auto it = s.begin();
        it++;
        vector<int> b = *(it);
        if(a.size() == 0 && b.size() == 0){
            break;
        }
        else if(b.size() == 0){
            finalAns[idx] = a[0];
            idx++;
            s.erase(s.begin());
            a.erase(a.begin());
            s.insert(a);
        }
        else{
            finalAns[idx] = a[0];
            finalAns[idx + 1] = b[0];
            idx += 2;
            s.erase(s.begin());
            s.erase(it);
            a.erase(a.begin());
            b.erase(b.begin());
            s.insert(a);
            s.insert(b);
        }
    }
    if(!(finalAns.empty()) && finalAns.back() == 0){
        finalAns.back() = x12;
    }
    for(int i = 0; i < (int)finalAns.size(); i += 2){
        cout << finalAns[i] << " " << finalAns[i + 1] << "\n";
    }
}

• Subtask 1: 18 / 18
• Subtask 2: 45 / 45
• Subtask 3: 0 / 37