CodeForces 1286B :Numbers on Tree 思维构造

传送门

题意

分析

一开始想的是从下向上暴力赋值排序，然后对子树进行合并，但是后来发现好像不好处理冲突问题
所以我们需要维护的是一个相对关系，离散化即可
首先这个树上点权最小的值一定是深度最大并且$a_i$为$0$的点，我们把这个点或者这些点丢到队列中，然后不停向上维护相对关系即可，这个过程可以参考拓扑排序
那么我们怎么去维护队列中的深度关系内，用优先队列即可
复杂度为$O(n^{2}logn)$

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10,M = N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],e[M],ne[M],idx;
int n;
int dep[N];
int fa[N];
int a[N];
int p[N];
struct cmp {
    bool operator () (int a,int b) {return dep[a]>dep[b];}
};
priority_queue <int,vector<int>,cmp> q;

void add(int x,int y){
    ne[idx] = h[x],e[idx] = y,h[x] = idx++;
}

void dfs(int u,int d){
    dep[u] = d;
    for(int i = h[u];~i;i = ne[i]){
        dfs(e[i],d + 1);
    }
    if(!p[u] && u) q.push(u);
}

int main() {
    read(n);
    memset(h,-1,sizeof h);
    for(int i = 1;i <= n;i++){
        int x;
        read(x),read(p[i]);
        add(x,i);
        fa[i] = x;
    }
    dfs(0,0);
    int cnt = 1;
    while(q.size()){
        int t = q.top();
        q.pop();
        a[t] = cnt++;
        while(t){
            if(--p[t] == 0) q.push(t);
            t = fa[t];
        }
    }   
    if(cnt != n + 1) puts("NO");
    else {
        puts("YES");
        for(int i = 1;i <= n;i++) printf("%d ",a[i]);
    }
    return 0;
}