CSES - Aalto Competitive Programming 2024 - wk6 - Wed - Results
Submission details
Task:Microservice hell
Sender:aalto2024g_005
Submission time:2024-10-09 17:49:37 +0300
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#60.00 sdetails
#70.00 sdetails
#8ACCEPTED0.00 sdetails
#90.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#130.00 sdetails
#140.01 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#190.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#230.00 sdetails
#240.00 sdetails
#25ACCEPTED0.00 sdetails
#260.00 sdetails
#27ACCEPTED0.00 sdetails
#280.00 sdetails
#290.00 sdetails
#300.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#330.00 sdetails
#340.00 sdetails
#35ACCEPTED0.00 sdetails
#360.00 sdetails
#37ACCEPTED0.00 sdetails
#380.00 sdetails
#390.00 sdetails
#40ACCEPTED0.00 sdetails
#41ACCEPTED0.00 sdetails
#42ACCEPTED0.00 sdetails
#430.00 sdetails
#440.00 sdetails
#45ACCEPTED0.00 sdetails
#460.00 sdetails
#47ACCEPTED0.00 sdetails
#480.00 sdetails
#490.00 sdetails
#50ACCEPTED0.00 sdetails
#51ACCEPTED0.01 sdetails
#52ACCEPTED0.01 sdetails
#530.01 sdetails
#540.01 sdetails
#55ACCEPTED0.01 sdetails
#560.01 sdetails
#57ACCEPTED0.01 sdetails
#580.00 sdetails
#590.01 sdetails
#60ACCEPTED0.00 sdetails
#61ACCEPTED0.14 sdetails
#62ACCEPTED0.14 sdetails
#630.11 sdetails
#640.12 sdetails
#65ACCEPTED0.17 sdetails
#660.09 sdetails
#67ACCEPTED0.16 sdetails
#680.08 sdetails
#690.15 sdetails
#70ACCEPTED0.10 sdetails

Compiler report

input/code.cpp: In function 'void dfs(long long int)':
input/code.cpp:35:9: warning: unused variable 'sum' [-Wunused-variable]
   35 |     int sum = 0;
      |         ^~~

Code

#include <bits/stdc++.h>
using namespace std;
#define int long long

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

int n;
vector<vector<int>> adj;
vector<bool> visited, recStack;
vector<int> ans;
bool isCyclic = false; 

vector<int> sol;

bool dfs_cycle(int v) {
    visited[v] = true;
    recStack[v] = true;

    for (int u : adj[v]) {
        if (!visited[u]) {
            if (dfs_cycle(u)) return true;
        } else if (recStack[u]) {
            return true; 
        }
    }

    recStack[v] = false; 
    return false;
}

void dfs(int v) {
    visited[v] = true;
    int sum = 0;
    for (int u : adj[v]) {
        if (!visited[u])
            dfs(u);
    }
    ans.push_back(v);
}

void topological_sort() {
    visited.assign(n, false);
    for (int i = 0; i < n; ++i) {
        if (!visited[i]) {
            dfs(i);
        }
    }
    //reverse(ans.begin(), ans.end());
}


int solve(){
    int u = ans[ans.size()-1];
    vector<int> sol(n,0);
    visited.assign(n, false);
    
    // for (int node : adj[u]){
    //     sol[node] = adj[node].size() + sol[];
    // }
    
    for (int node : ans){
        //sol[node] += adj[v].size();
        for (int v : adj[node]){
            sol[node] += sol[v] + adj[v].size();
        }
        //sol[node]+=adj[node].size();
    }
    
    int sum = sol[u];
    
    // for (auto& a : sol){
    //     cout << a << " ";
    // }

    
    return sum;
}

signed main() {
    int m, X;
    cin >> n >> m >> X;
    adj.resize(n);
    //ans.resize(n);

    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        adj[a-1].push_back(b-1);
    }
   
    visited.assign(n, false);
    recStack.assign(n, false);
    for (int i = 0; i < n; i++) {
        if (!visited[i]) {
            if (dfs_cycle(i)) {
                isCyclic = true;
                break;
            }
        }
    }

    if (isCyclic) {
        cout << "No" << endl;
        return 1;
    } else {
        topological_sort();
    }
    
    int temp = solve();
    
    //cout << temp << "\n";
    
    
    if (temp > X){
        cout << "No";
    } else {
        cout << "Yes";
    }

    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
2 1 7
1 2

correct output
Yes

user output
Yes

Test 2

Verdict: ACCEPTED

input
2 1 7
2 1

correct output
Yes

user output
Yes

Test 3

Verdict: ACCEPTED

input
3 3 6
2 1
2 3
1 3

correct output
Yes

user output
Yes

Test 4

Verdict: ACCEPTED

input
3 2 10
2 3
2 1

correct output
Yes

user output
Yes

Test 5

Verdict: ACCEPTED

input
3 3 4
3 1
3 2
1 2

correct output
Yes

user output
Yes

Test 6

Verdict:

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

correct output
No

user output
No

Test 7

Verdict:

input
4 4 1
3 2
3 4
1 2
2 4

correct output
No

user output
Yes

Test 8

Verdict: ACCEPTED

input
4 3 8
1 2
4 1
4 3

correct output
Yes

user output
Yes

Test 9

Verdict:

input
4 4 7
4 3
1 2
2 4
2 1

correct output
No

user output
No

Test 10

Verdict: ACCEPTED

input
4 5 7
2 1
2 3
1 3
1 4
...

correct output
Yes

user output
Yes

Test 11

Verdict: ACCEPTED

input
5 7 2
2 5
4 3
4 1
4 5
...

correct output
No

user output
No

Test 12

Verdict: ACCEPTED

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

correct output
No

user output
No

Test 13

Verdict:

input
5 7 10
2 4
3 2
3 5
3 1
...

correct output
No

user output
No

Test 14

Verdict:

input
5 7 6
2 3
1 5
5 2
5 1
...

correct output
No

user output
No

Test 15

Verdict: ACCEPTED

input
5 10 8
4 1
4 3
4 2
4 5
...

correct output
No

user output
No

Test 16

Verdict: ACCEPTED

input
5 5 7
1 4
1 3
5 3
2 1
...

correct output
Yes

user output
Yes

Test 17

Verdict: ACCEPTED

input
5 10 8
1 3
1 5
1 2
1 4
...

correct output
No

user output
No

Test 18

Verdict: ACCEPTED

input
5 4 8
1 3
2 4
2 1
3 4

correct output
Yes

user output
Yes

Test 19

Verdict:

input
5 10 5
2 3
4 1
1 2
1 4
...

correct output
No

user output
No

Test 20

Verdict: ACCEPTED

input
5 4 6
2 5
2 1
5 1
5 4

correct output
Yes

user output
Yes

Test 21

Verdict: ACCEPTED

input
10 29 2
10 3
10 1
10 8
10 7
...

correct output
No

user output
No

Test 22

Verdict: ACCEPTED

input
10 24 2
8 2
8 9
8 5
8 4
...

correct output
No

user output
No

Test 23

Verdict:

input
10 25 10
10 2
10 6
10 3
2 5
...

correct output
No

user output
No

Test 24

Verdict:

input
10 29 6
10 8
10 6
10 5
8 10
...

correct output
No

user output
No

Test 25

Verdict: ACCEPTED

input
10 44 8
10 3
10 9
10 1
10 6
...

correct output
No

user output
No

Test 26

Verdict:

input
10 17 7
3 8
6 5
6 2
9 3
...

correct output
No

user output
No

Test 27

Verdict: ACCEPTED

input
10 42 8
9 7
9 8
9 6
9 10
...

correct output
No

user output
No

Test 28

Verdict:

input
10 11 8
5 7
9 5
7 10
7 8
...

correct output
No

user output
No

Test 29

Verdict:

input
10 41 5
9 1
9 5
9 3
9 6
...

correct output
No

user output
No

Test 30

Verdict:

input
10 9 6
3 1
3 4
3 8
1 7
...

correct output
No

user output
Yes

Test 31

Verdict: ACCEPTED

input
100 484 159793364009
71 34
71 77
71 6
71 100
...

correct output
Yes

user output
Yes

Test 32

Verdict: ACCEPTED

input
100 391 133876644548
80 94
80 38
80 72
80 79
...

correct output
Yes

user output
Yes

Test 33

Verdict:

input
100 405 903604029805
82 5
82 49
82 86
82 69
...

correct output
No

user output
No

Test 34

Verdict:

input
100 485 558765991856
50 14
50 99
50 67
50 63
...

correct output
No

user output
No

Test 35

Verdict: ACCEPTED

input
100 777 785548293068
55 25
55 36
55 79
55 70
...

correct output
Yes

user output
Yes

Test 36

Verdict:

input
100 254 673064906661
52 69
52 1
52 27
62 92
...

correct output
No

user output
No

Test 37

Verdict: ACCEPTED

input
100 725 776065552551
8 39
8 42
8 93
8 51
...

correct output
Yes

user output
Yes

Test 38

Verdict:

input
100 152 754385307168
25 97
25 35
25 95
77 49
...

correct output
No

user output
No

Test 39

Verdict:

input
100 712 484141188705
2 14
2 85
2 21
2 43
...

correct output
No

user output
No

Test 40

Verdict: ACCEPTED

input
100 106 518519103960
35 52
35 65
35 1
10 90
...

correct output
Yes

user output
Yes

Test 41

Verdict: ACCEPTED

input
200 968 159793364009
33 52
33 145
33 158
33 5
...

correct output
Yes

user output
Yes

Test 42

Verdict: ACCEPTED

input
200 783 133876644548
191 46
191 148
191 172
191 199
...

correct output
Yes

user output
Yes

Test 43

Verdict:

input
200 810 903604029805
198 35
198 114
198 188
198 83
...

correct output
No

user output
No

Test 44

Verdict:

input
200 971 558765991856
15 135
15 69
15 26
15 165
...

correct output
No

user output
No

Test 45

Verdict: ACCEPTED

input
200 1554 785548293068
2 47
2 103
2 25
2 84
...

correct output
Yes

user output
Yes

Test 46

Verdict:

input
200 510 673064906661
157 140
157 160
157 188
157 181
...

correct output
No

user output
No

Test 47

Verdict: ACCEPTED

input
200 1450 776065552551
152 29
152 101
152 172
152 136
...

correct output
Yes

user output
Yes

Test 48

Verdict:

input
200 305 754385307168
109 147
56 74
56 7
56 15
...

correct output
No

user output
No

Test 49

Verdict:

input
200 1423 484141188705
143 29
143 176
143 14
143 76
...

correct output
No

user output
No

Test 50

Verdict: ACCEPTED

input
200 213 518519103960
177 68
177 101
177 175
173 119
...

correct output
Yes

user output
Yes

Test 51

Verdict: ACCEPTED

input
1000 4841 159793364009
576 121
576 902
576 377
576 491
...

correct output
Yes

user output
Yes

Test 52

Verdict: ACCEPTED

input
1000 3918 133876644548
339 888
339 259
339 304
339 849
...

correct output
Yes

user output
Yes

Test 53

Verdict:

input
1000 4051 903604029805
35 303
35 119
69 585
69 445
...

correct output
No

user output
No

Test 54

Verdict:

input
1000 4855 558765991856
62 306
62 581
62 574
62 248
...

correct output
No

user output
No

Test 55

Verdict: ACCEPTED

input
1000 7770 785548293068
884 615
884 721
884 158
884 812
...

correct output
Yes

user output
Yes

Test 56

Verdict:

input
1000 2553 673064906661
203 432
203 526
4 534
4 187
...

correct output
No

user output
No

Test 57

Verdict: ACCEPTED

input
1000 7250 776065552551
39 227
39 503
39 293
39 680
...

correct output
Yes

user output
Yes

Test 58

Verdict:

input
1000 1533 754385307168
882 796
882 530
815 388
815 842
...

correct output
No

user output
No

Test 59

Verdict:

input
1000 7114 484141188705
32 267
32 642
32 225
32 548
...

correct output
No

user output
No

Test 60

Verdict: ACCEPTED

input
1000 1071 518519103960
877 657
877 953
951 871
951 280
...

correct output
Yes

user output
Yes

Test 61

Verdict: ACCEPTED

input
100000 154882 159793364009
52158 95830
52158 57997
10337 65466
10337 77949
...

correct output
Yes

user output
Yes

Test 62

Verdict: ACCEPTED

input
100000 141702 133876644548
31918 98425
31918 27390
53839 48968
53839 65439
...

correct output
Yes

user output
Yes

Test 63

Verdict:

input
100000 143600 903604029805
58753 61357
58753 97879
58753 43009
77673 78316
...

correct output
No

user output
No

Test 64

Verdict:

input
100000 155080 558765991856
12714 27835
12714 87301
95755 24081
85090 72001
...

correct output
No

user output
No

Test 65

Verdict: ACCEPTED

input
100000 196705 785548293068
64073 29701
64073 61899
64073 56663
64073 66942
...

correct output
Yes

user output
Yes

Test 66

Verdict:

input
100000 122199 673064906661
23466 47435
23466 38689
23466 81724
37777 76030
...

correct output
No

user output
No

Test 67

Verdict: ACCEPTED

input
100000 189288 776065552551
56701 64161
56701 73527
56701 62864
25272 36550
...

correct output
Yes

user output
Yes

Test 68

Verdict:

input
100000 107630 754385307168
73409 77767
73409 20547
73409 2238
73409 7077
...

correct output
No

user output
No

Test 69

Verdict:

input
100000 187345 484141188705
66892 73373
62424 14951
73818 38984
73818 46385
...

correct output
No

user output
No

Test 70

Verdict: ACCEPTED

input
100000 101036 518519103960
30507 31372
1379 74720
1379 56182
1379 8486
...

correct output
Yes

user output
Yes