codeforces 1029E Tree with Small Distances（基础图）

E - Tree with Small Distances

赛后补题，算是一道思维图论题吧

复习了一下链式前向星，优先队列是对pair的first元素排序

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 200005;
int n, cnt;
int head[maxn], d[maxn], fa[maxn];
bool vis[maxn];
struct node
{
    int to, next;
}e[maxn*2];
void add(int u, int v)
{
    e[cnt].to = v;
    e[cnt].next = head[u];
    head[u] = cnt ++;
}
void init()
{
    cnt = 0;
    memset(head, -1, sizeof(head));
    memset(d, 0, sizeof(d));
    memset(vis, 0, sizeof(vis));
}
void dfs(int u, int f)
{
    for(int i = head[u]; ~ i; i = e[i].next)
    {
        int v = e[i].to;
        if(v == f) continue;
        d[v] = d[u] + 1, fa[v] = u;
        dfs(v, u);
    }
}
typedef pair<int, int> P;
int main()
{
    while(scanf("%d", &n) != EOF)
    {
        int u, v;
        init();
        for(int i = 1; i < n; i ++)
        {
            scanf("%d%d", &u, &v);
            add(u, v);
            add(v, u);
        }
        dfs(1, 0);
        int ans = 0;
        priority_queue<P, vector<P>, less<P> > q;
        for(int i = 1; i <= n; i ++)
            if(d[i] > 2)
                q.push(P(d[i], i));
        while(! q.empty())
        {
            //cout<<1<<endl;
            P h = q.top();
            q.pop();
            int u = h.second;
            if(vis[u]) continue;
            ans ++;
            int v = fa[u];
            vis[v] = 1;
            for(int i = head[v]; ~ i; i = e[i].next)
                vis[e[i].to] = 1;
        }
        printf("%d\n", ans);
    }
    return 0;
}