[ 补题 | 题解 ] Codeforces Round #743 (Div. 2)

A

不讲

B

暂时不会 – 玄学

C 思路

拓扑排序 (忙)

CODE

#include 
using namespace std;
const int N = 3e5+10;
int h[N],e[N],ne[N],idx;
int d[N];
void add(int a,int b)
{
    e[idx] = b,ne[idx] = h[a],h[a] =idx++;
}

void solve()
{
    memset(h,-1,sizeof h);
    memset(d,0,sizeof d);
    idx = 0;
    int n;
    cin>>n;
    for(int i = 1; i>k;
        d[i] = k;
        for(int j  = 1; j>x;
            add(x,i);
        }
    }

   priority_queue q,q1;
    for(int i = 1; i