CSES - Aalto Competitive Programming 2024 - wk6 - Homework

CSES - Aalto Competitive Programming 2024 - wk6 - Homework - Results

Submission details
Task:	Course Schedule
Sender:	htoik
Submission time:	2024-10-07 02:26:29 +0300
Language:	C++ (C++20)
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.00 s	details
#2	ACCEPTED	0.00 s	details
#3	ACCEPTED	0.00 s	details
#4	ACCEPTED	0.00 s	details
#5	ACCEPTED	0.00 s	details
#6	ACCEPTED	0.33 s	details
#7	ACCEPTED	0.32 s	details
#8	ACCEPTED	0.32 s	details
#9	ACCEPTED	0.32 s	details
#10	ACCEPTED	0.26 s	details
#11	ACCEPTED	0.24 s	details
#12	ACCEPTED	0.00 s	details
#13	ACCEPTED	0.00 s	details
#14	ACCEPTED	0.17 s	details
#15	ACCEPTED	0.17 s	details
#16	ACCEPTED	0.00 s	details
#17	ACCEPTED	0.19 s	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:29:19: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   29 |     for(int i=0; i<m; i++){
      |                  ~^~
input/code.cpp:84:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for(int i=1; i<order.size(); i++){
      |                  ~^~~~~~~~~~~~~
input/code.cpp:90:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for(; i<order.size(); i++, j++){
      |           ~^~~~~~~~~~~~~
input/code.cpp:95:12: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   95 |     for(; j<=n; j++){
      |           ~^~~

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(!process(b)){
            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&[a,_] : adj){
        if(p[a] == 0){
            if(!process(a)){
                cout << "IMPOSSIBLE" << endl;
                return 0;
            }
        }
    }

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

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

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

    sort(order.begin(), order.end());
    int i=0, j=1;
    for(; i<order.size(); i++, j++){
        for(; j<order[i]; j++){
            cout << " " << j;
        }
    }
    for(; j<=n; j++){
        cout << " " << j;
    }
    cout << endl;
}

Test details

Test 1

Verdict: ACCEPTED

input
`10 20 5 2 2 4 8 9 6 4 ...` view save

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

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

Test 2

Verdict: ACCEPTED

input
`10 20 2 7 1 10 9 5 9 7 ...` view save

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

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

Test 3

Verdict: ACCEPTED

input
`10 20 8 5 2 3 10 1 9 1 ...` view save

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

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

Test 4

Verdict: ACCEPTED

input
`10 20 5 10 10 3 9 10 6 2 ...` view save

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

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

Test 5

Verdict: ACCEPTED

input
`10 20 2 9 4 8 9 1 10 6 ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 6

Verdict: ACCEPTED

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

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

user output
`99998 99996 99994 99993 99990 ...` Truncated

Test 7

Verdict: ACCEPTED

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

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

user output
`99994 99991 99986 99983 99982 ...` Truncated

Test 8

Verdict: ACCEPTED

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

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

user output
`100000 99998 99996 99993 99992...` Truncated

Test 9

Verdict: ACCEPTED

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

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

user output
`99996 99992 99991 99986 99985 ...` Truncated

Test 10

Verdict: ACCEPTED

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

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 11

Verdict: ACCEPTED

input
`100000 199998 1 100000 1 100000 2 100000 2 100000 ...` view save

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

user output
`99999 99998 99997 99996 99995 ...` Truncated

Test 12

Verdict: ACCEPTED

input
`2 2 1 2 2 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 13

Verdict: ACCEPTED

input
`6 6 1 2 2 3 4 3 4 5 ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 14

Verdict: ACCEPTED

input
`99999 149997 1 3 3 5 5 7 7 9 ...` view save

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

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 ...` view save

correct output
`100000 99999 99998 99997 99996...` view save

user output
`100000 99999 99998 99997 99996...` Truncated

Test 16

Verdict: ACCEPTED

input
`6 6 1 2 1 3 2 4 3 5 ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 17

Verdict: ACCEPTED

input
`100000 200000 1 1 1 1 2 2 2 2 ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Aalto Competitive Programming 2024 - wk6 - Homework

Course Schedule

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Tasks

Submissions (htoik)