oj.uz

Submission #607568

# Submission time Handle Problem Language Result Execution time Memory
607568 2022-07-26T20:16:29 Z yanndev Toy Train (IOI17_train) C++17
100 / 100
 1190 ms 1108 KB 
#include <bits/stdc++.h>
using namespace std;

const int MX = 5042;

int n;
int deg[MX];
bool vis[MX];
bool vis2[MX];
bool isOk[MX];
bool isAlice[MX];
bool isCharge[MX];
vector<int> rgraph[MX];

bool BFS() {
    queue<int> nxt {};
    for (int i = 0; i < n; i++)
        deg[i] = 0;
    for (int i = 0; i < n; i++) {
        for (auto& x: rgraph[i])
            deg[x]++;
        if (isCharge[i] && isOk[i])
            nxt.push(i);
        vis[i] = vis2[i] = false;
    }

    //cout << layer << ' ' << (int)nxt.size() << '\n';
    
    while (!nxt.empty()) {
        auto cur = nxt.front();
        //cout << "cur is " << cur << '\n';
        nxt.pop();

        if (vis[cur])
            continue;
        vis[cur] = true;

        for (auto& x: rgraph[cur]) {
            if (!vis2[x] && ((--deg[x] == 0) || isAlice[x])) {
                vis2[x] = true;
                nxt.push(x);
            }
        }
    }

    for (int i = 0; i < n; i++) {
        if (isOk[i] && !vis2[i]) {
            isOk[i] = false;
            return true;
        }
    }

    return false;
}

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
    n = (int)a.size();

    for (int i = 0; i < (int)u.size(); i++)
        rgraph[v[i]].push_back(u[i]);
    
    for (int i = 0; i < n; i++) {
        isAlice[i] = a[i];
        isCharge[i] = r[i];
        isOk[i] = true;
    }

    while (BFS());

    vector<int> ans (n);
    for (int i = 0; i < n; i++)
        ans[i] = isOk[i];
    return ans;
}

/*int main() {
    for (auto& x: who_wins({0, 1}, {1, 0}, {0, 0, 1, 1}, {0, 1, 0, 1}))
        cout << x << ' ';
}*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 796 KB Output is correct
2 Correct 443 ms 844 KB Output is correct
3 Correct 422 ms 788 KB Output is correct
4 Correct 449 ms 796 KB Output is correct
5 Correct 470 ms 792 KB Output is correct
6 Correct 415 ms 788 KB Output is correct
7 Correct 532 ms 788 KB Output is correct
8 Correct 122 ms 796 KB Output is correct
9 Correct 417 ms 784 KB Output is correct
10 Correct 375 ms 752 KB Output is correct
11 Correct 322 ms 764 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 420 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 683 ms 1076 KB Output is correct
2 Correct 763 ms 1076 KB Output is correct
3 Correct 852 ms 1072 KB Output is correct
4 Correct 6 ms 980 KB Output is correct
5 Correct 353 ms 1056 KB Output is correct
6 Correct 754 ms 1056 KB Output is correct
7 Correct 6 ms 1108 KB Output is correct
8 Correct 534 ms 1044 KB Output is correct
9 Correct 499 ms 980 KB Output is correct
10 Correct 280 ms 1020 KB Output is correct
11 Correct 428 ms 1008 KB Output is correct
12 Correct 487 ms 980 KB Output is correct
13 Correct 6 ms 1108 KB Output is correct
14 Correct 6 ms 1084 KB Output is correct
15 Correct 7 ms 1108 KB Output is correct
16 Correct 6 ms 1108 KB Output is correct
17 Correct 7 ms 996 KB Output is correct
18 Correct 715 ms 888 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 980 KB Output is correct
2 Correct 366 ms 980 KB Output is correct
3 Correct 622 ms 1028 KB Output is correct
4 Correct 841 ms 1060 KB Output is correct
5 Correct 672 ms 1040 KB Output is correct
6 Correct 427 ms 980 KB Output is correct
7 Correct 510 ms 1100 KB Output is correct
8 Correct 698 ms 1008 KB Output is correct
9 Correct 368 ms 1004 KB Output is correct
10 Correct 6 ms 1108 KB Output is correct
11 Correct 9 ms 1108 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 558 ms 1044 KB Output is correct
14 Correct 387 ms 984 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 610 ms 1044 KB Output is correct
2 Correct 6 ms 1108 KB Output is correct
3 Correct 353 ms 1048 KB Output is correct
4 Correct 7 ms 980 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 320 ms 736 KB Output is correct
7 Correct 19 ms 896 KB Output is correct
8 Correct 43 ms 852 KB Output is correct
9 Correct 26 ms 920 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 12 ms 812 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 796 KB Output is correct
2 Correct 443 ms 844 KB Output is correct
3 Correct 422 ms 788 KB Output is correct
4 Correct 449 ms 796 KB Output is correct
5 Correct 470 ms 792 KB Output is correct
6 Correct 415 ms 788 KB Output is correct
7 Correct 532 ms 788 KB Output is correct
8 Correct 122 ms 796 KB Output is correct
9 Correct 417 ms 784 KB Output is correct
10 Correct 375 ms 752 KB Output is correct
11 Correct 322 ms 764 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 420 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 683 ms 1076 KB Output is correct
33 Correct 763 ms 1076 KB Output is correct
34 Correct 852 ms 1072 KB Output is correct
35 Correct 6 ms 980 KB Output is correct
36 Correct 353 ms 1056 KB Output is correct
37 Correct 754 ms 1056 KB Output is correct
38 Correct 6 ms 1108 KB Output is correct
39 Correct 534 ms 1044 KB Output is correct
40 Correct 499 ms 980 KB Output is correct
41 Correct 280 ms 1020 KB Output is correct
42 Correct 428 ms 1008 KB Output is correct
43 Correct 487 ms 980 KB Output is correct
44 Correct 6 ms 1108 KB Output is correct
45 Correct 6 ms 1084 KB Output is correct
46 Correct 7 ms 1108 KB Output is correct
47 Correct 6 ms 1108 KB Output is correct
48 Correct 7 ms 996 KB Output is correct
49 Correct 715 ms 888 KB Output is correct
50 Correct 6 ms 980 KB Output is correct
51 Correct 366 ms 980 KB Output is correct
52 Correct 622 ms 1028 KB Output is correct
53 Correct 841 ms 1060 KB Output is correct
54 Correct 672 ms 1040 KB Output is correct
55 Correct 427 ms 980 KB Output is correct
56 Correct 510 ms 1100 KB Output is correct
57 Correct 698 ms 1008 KB Output is correct
58 Correct 368 ms 1004 KB Output is correct
59 Correct 6 ms 1108 KB Output is correct
60 Correct 9 ms 1108 KB Output is correct
61 Correct 6 ms 1108 KB Output is correct
62 Correct 558 ms 1044 KB Output is correct
63 Correct 387 ms 984 KB Output is correct
64 Correct 610 ms 1044 KB Output is correct
65 Correct 6 ms 1108 KB Output is correct
66 Correct 353 ms 1048 KB Output is correct
67 Correct 7 ms 980 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 320 ms 736 KB Output is correct
70 Correct 19 ms 896 KB Output is correct
71 Correct 43 ms 852 KB Output is correct
72 Correct 26 ms 920 KB Output is correct
73 Correct 3 ms 468 KB Output is correct
74 Correct 12 ms 812 KB Output is correct
75 Correct 511 ms 1076 KB Output is correct
76 Correct 863 ms 1072 KB Output is correct
77 Correct 929 ms 1076 KB Output is correct
78 Correct 969 ms 1068 KB Output is correct
79 Correct 945 ms 1108 KB Output is correct
80 Correct 8 ms 1076 KB Output is correct
81 Correct 745 ms 1044 KB Output is correct
82 Correct 637 ms 1044 KB Output is correct
83 Correct 383 ms 980 KB Output is correct
84 Correct 560 ms 1056 KB Output is correct
85 Correct 866 ms 1036 KB Output is correct
86 Correct 608 ms 1048 KB Output is correct
87 Correct 790 ms 1036 KB Output is correct
88 Correct 1038 ms 1044 KB Output is correct
89 Correct 698 ms 1040 KB Output is correct
90 Correct 1116 ms 1044 KB Output is correct
91 Correct 987 ms 1048 KB Output is correct
92 Correct 863 ms 1068 KB Output is correct
93 Correct 944 ms 1048 KB Output is correct
94 Correct 1095 ms 1052 KB Output is correct
95 Correct 941 ms 1052 KB Output is correct
96 Correct 425 ms 992 KB Output is correct
97 Correct 1045 ms 1100 KB Output is correct
98 Correct 1144 ms 1040 KB Output is correct
99 Correct 1190 ms 1032 KB Output is correct
100 Correct 663 ms 856 KB Output is correct