CSES - Aalto Competitive Programming 2024 - wk6 - Homework - Results
Submission details
Task:Course Schedule
Sender:htoik
Submission time:2024-10-07 01:11:53 +0300
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1--details
#2--details
#3ACCEPTED0.00 sdetails
#4--details
#5--details
#6--details
#7--details
#8--details
#9--details
#10--details
#11ACCEPTED0.23 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.18 sdetails
#15--details
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.19 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:34:19: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   34 |     for(int i=0; i<m; i++){
      |                  ~^~
input/code.cpp:71:19: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   71 |     for(int i=1; i<n; i++){
      |                  ~^~

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

int p[100001];
map<int, vector<int>> adj;
vector<int> order;

bool process(int a){
    if(p[a] == 2) return true;
    if(p[a] == 1) return false;

    p[a] = 1;
    for(auto b : adj[a]){
        if(p[b] == 0){
            if(!process(b)){
                return false;
            }
        }
        if(p[b] == 1){
            return false;
        }
    }
    p[a] = 2;
    order.push_back(a);
    return true;
}

int main(){
    unsigned n, m;
    cin >> n >> m;

    for(int i=0; i<m; i++){
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
    }

    order.reserve(n);
    for(auto&[x,_] : adj){
        if(p[x] == 2)
            continue;
        priority_queue<int> q;
        q.push(x);

        while(!q.empty()){
            int a = q.top();
            p[a] = 1;
            bool ps = true;
            for(auto b : adj[a]){
                if(p[b] == 0){
                    q.push(b);
                    ps = false;
                }
                if(p[b] == 1){
                    cout << "IMPOSSIBLE" << endl;
                    return 0;
                }
            }
            if(ps){
                p[a] = 2;
                q.pop();
                order.push_back(a);
            }
        }
    }

    order = vector(order.rbegin(), order.rend());
    cout << order[0];
    for(int i=1; i<n; i++){
        cout << " " << order[i];
    }
    cout << endl;
}

Test details

Test 1

Verdict:

input
10 20
5 2
2 4
8 9
6 4
...

correct output
5 7 10 2 1 8 3 9 6 4 

user output
(empty)

Test 2

Verdict:

input
10 20
2 7
1 10
9 5
9 7
...

correct output
1 8 3 6 10 2 9 4 5 7 

user output
(empty)

Test 3

Verdict: ACCEPTED

input
10 20
8 5
2 3
10 1
9 1
...

correct output
4 6 7 9 10 2 8 3 1 5 

user output
9 7 10 6 8 4 2 3 1 5

Test 4

Verdict:

input
10 20
5 10
10 3
9 10
6 2
...

correct output
7 8 6 4 2 1 5 9 10 3 

user output
(empty)

Test 5

Verdict:

input
10 20
2 9
4 8
9 1
10 6
...

correct output
IMPOSSIBLE

user output
(empty)

Test 6

Verdict:

input
100000 200000
78359 8853
18190 30703
11401 30087
34627 11535
...

correct output
2 3 8 9 16 18 21 22 27 34 36 4...

user output
(empty)

Test 7

Verdict:

input
100000 200000
32395 2098
67067 31866
31867 67167
78488 33397
...

correct output
9 11 13 16 22 35 37 38 40 44 5...

user output
(empty)

Test 8

Verdict:

input
100000 200000
19035 36947
13730 46121
99449 77790
15626 11731
...

correct output
1 7 15 17 18 34 38 41 48 49 51...

user output
(empty)

Test 9

Verdict:

input
100000 200000
14188 9709
46541 20871
32203 88809
99879 54779
...

correct output
6 10 11 16 17 19 21 22 23 28 3...

user output
(empty)

Test 10

Verdict:

input
100000 200000
41882 61162
28138 18053
74649 74863
69760 74508
...

correct output
IMPOSSIBLE

user output
(empty)

Test 11

Verdict: ACCEPTED

input
100000 199998
1 100000
1 100000
2 100000
2 100000
...

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
99999 99998 99997 99996 99995 ...
Truncated

Test 12

Verdict: ACCEPTED

input
2 2
1 2
2 1

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 13

Verdict: ACCEPTED

input
6 6
1 2
2 3
4 3
4 5
...

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 14

Verdict: ACCEPTED

input
99999 149997
1 3
3 5
5 7
7 9
...

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
Truncated

Test 15

Verdict:

input
100000 149998
2 1
3 2
4 3
5 4
...

correct output
100000 99999 99998 99997 99996...

user output
(empty)

Test 16

Verdict: ACCEPTED

input
6 6
1 2
1 3
2 4
3 5
...

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 17

Verdict: ACCEPTED

input
100000 200000
1 1
1 1
2 2
2 2
...

correct output
IMPOSSIBLE

user output
IMPOSSIBLE