CSES - Course Schedule II

Author: Benjamin Qi

Table of Contents


Edit on Github

This problem is equivalent to Minimal Labels from CodeForces. Treat the "label" of a vertex in "Minimal Labels" as the completion time of a course in "Course Schedule II." So it suffices to solve the CF problem (editorial) and then output the inverse permutation.

1#include <bits/stdc++.h>
2using namespace std;
3
4using ll = long long;
5using ld = long double;
6using db = double;
7using str = string; // yay python!
8
9using pi = pair<int,int>;
10using pl = pair<ll,ll>;

Give Us Feedback on CSES - Course Schedule II!

Join the Discussion!

Feel free to voice your thoughts in the comments section.