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

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:50:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |   for (int i = 1; i < state.size(); i++) {
      |                   ~~^~~~~~~~~~~~~~

Code

#include <bits/stdc++.h>
#include <climits>
#include <vector>

#define ll long long
using namespace std;

void visit(int n, vector<vector<int>> &adj, vector<int> &state,
           vector<int> &res) {
  if (state[n] == 2) {
    return;
  }
  if (state[n] == 1) {
    cout << "IMPOSSIBLE";
    exit(0);
  }
  state[n] = 1;

  for (auto n2 : adj[n]) {
    visit(n2, adj, state, res);
  }

  state[n] = 2;
  res.push_back(n);
}

int main() {
#ifdef LOCAL
  auto in = ifstream("input.txt");
  cin.rdbuf(in.rdbuf());
#endif

  int n, m;
  cin >> n >> m;

  auto adj = vector<vector<int>>(n + 1);

  auto res = vector<int>();
  auto tops = vector<bool>(n + 1, true);

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

  vector<int> state(n + 1, 0);

  for (int i = 1; i < state.size(); i++) {
    if (state[i] == 0)
      visit(i, adj, state, res);
  }

  for (int i = res.size() - 1; i >= 0; i--) {
    cout << res[i] << " ";
  }
}

Test details

Test 1

Verdict: ACCEPTED

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
10 7 5 2 1 8 3 9 6 4 

Test 2

Verdict: ACCEPTED

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
8 1 3 6 10 2 9 4 5 7 

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: ACCEPTED

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
8 7 6 4 2 5 1 9 10 3 

Test 5

Verdict: ACCEPTED

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 6

Verdict: ACCEPTED

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
99998 99996 99994 99993 99992 ...
Truncated

Test 7

Verdict: ACCEPTED

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
100000 99994 99991 99986 99983...
Truncated

Test 8

Verdict: ACCEPTED

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
100000 99998 99996 99993 99992...
Truncated

Test 9

Verdict: ACCEPTED

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
99996 99992 99991 99986 99985 ...
Truncated

Test 10

Verdict: ACCEPTED

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

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: ACCEPTED

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

correct output
100000 99999 99998 99997 99996...

user output
100000 99999 99998 99997 99996...
Truncated

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