Codeforces Round #670 (Div. 2) C. Link Cut Centroids

只能说将近一年没打建图都不会建了.......

就是只有偶数个，并且当前节点的所有子节点加自身正好是n/2时，才会出现这样的情况。

思路一眼就出了，但是忘了需要按照无向图建图，我给默认有向建了个图....wa的自闭

手速也明显不如以前了

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
vector<int>v[200000];
int ins[200000];
int out[200000];
int vis[200000];
int fa[200000];
int dfs(int st){
    int temp = 1;
    for(int i = 0;i<v[st].size();++i){
        if(!vis[v[st][i]]){
            fa[v[st][i]] = st;
            vis[v[st][i]] = 1;
            temp+=dfs(v[st][i]);
        }

    }
    out[st] = temp;
    return temp;

}

int main(){
int t;
cin>>t;
while(t--){
    int n;
    scanf("%d",&n);
    for(int i= 0;i<n-1;++i){
        int x,y;
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
        v[y].push_back(x);
    }

    int st = 1;

    if(n&1){

           printf("%d %d\n",st,v[st][0]);
            printf("%d %d\n",st,v[st][0]);
        for(int i =1;i<=n;++i){
        ins[i] = 0;
        out[i] = 0;
        vis[i] = 0;
        fa[i] = 0;
        v[i].clear();

        }
        continue;
    }


    vis[st] = 1;
    dfs(st);
    int num = 1,x1 = 0,x2 = 0;
    for(int i =1;i<=n;++i){
        if(out[i]==n/2){
            num = 2;
            x1 = fa[i];
            x2 = i;
        }
    }



    if(num==1){
        printf("%d %d\n",st,v[st][0]);
        printf("%d %d\n",st,v[st][0]);
    }
    else{
        int temp = 0;
        for(int i = 0;i<v[x2].size();++i){
            if(v[x2][i]!=x1){
                temp = i;
                break;
            }
        }
        printf("%d %d\n",x2,v[x2][temp]);

        printf("%d %d\n",x1,v[x2][temp]);

    }


    for(int i =1;i<=n;++i){
        ins[i] = 0;
        vis[i] = 0;
        fa[i] = 0;
        out[i] = 0;
        v[i].clear();
    }

}

}