Course Schedule

#include <iostream>
#include <vector>
#include <cstdint>
#include <algorithm>
#include <stack>

int main() {
    int n, m;
    std::cin >> n >> m;

    std::vector<std::vector<int>> course_needed_for(n);
    for (int i = 0; i < m; ++i) {
        int a, b;
        std::cin >> a >> b;
        course_needed_for[a-1].push_back(b-1);
    }

    std::vector<int> order(n);
    int order_idx = n-1;
    std::vector<int> process_state(n, 0);
    std::stack<int> stack;
    int last_start = 0;
    while (order_idx >= 0) {
        if (stack.empty()) {
            for (int i = last_start; i < n; ++i) {
                if (process_state[i] != 0) continue;
                stack.push(i);
            }
        }

        int course = stack.top();
        if (process_state[course] == 1) {
            stack.pop();
            process_state[course] = 2;
            order[order_idx--] = course;
            continue;
        }

        process_state[course] = 1;
        for (auto next_course : course_needed_for[course]) {
            if (process_state[next_course] == 1) {
                std::cout << "IMPOSSIBLE";
                return 0;
            }
            if (process_state[next_course] == 2) continue;
            stack.push(next_course);
        }
    }

    for (auto course : order) {
        std::cout << course << " ";
    }
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED