Submission #607561

# Submission time Handle Problem Language Result Execution time Memory
607561 2022-07-26T20:11:48 Z yanndev Toy Train (IOI17_train) C++17
100 / 100
1696 ms 1100 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];

void BFS(int layer) {
    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;
}

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;
    }

    for (int layer = 0; layer <= (int)r.size(); layer++)
        BFS(layer);

    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 << ' ';
}*/
# Verdict Execution time Memory Grader output
1 Correct 723 ms 800 KB Output is correct
2 Correct 715 ms 800 KB Output is correct
3 Correct 725 ms 836 KB Output is correct
4 Correct 703 ms 796 KB Output is correct
5 Correct 708 ms 796 KB Output is correct
6 Correct 751 ms 788 KB Output is correct
7 Correct 483 ms 792 KB Output is correct
8 Correct 993 ms 784 KB Output is correct
9 Correct 802 ms 776 KB Output is correct
10 Correct 746 ms 752 KB Output is correct
11 Correct 733 ms 768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 420 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 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 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 592 ms 1080 KB Output is correct
2 Correct 639 ms 1076 KB Output is correct
3 Correct 722 ms 1076 KB Output is correct
4 Correct 1375 ms 1060 KB Output is correct
5 Correct 1076 ms 1060 KB Output is correct
6 Correct 559 ms 976 KB Output is correct
7 Correct 1455 ms 1060 KB Output is correct
8 Correct 906 ms 1048 KB Output is correct
9 Correct 510 ms 1024 KB Output is correct
10 Correct 1108 ms 1016 KB Output is correct
11 Correct 967 ms 1012 KB Output is correct
12 Correct 498 ms 980 KB Output is correct
13 Correct 1236 ms 1060 KB Output is correct
14 Correct 1233 ms 1100 KB Output is correct
15 Correct 1282 ms 1060 KB Output is correct
16 Correct 1234 ms 1076 KB Output is correct
17 Correct 1211 ms 1064 KB Output is correct
18 Correct 607 ms 856 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1274 ms 956 KB Output is correct
2 Correct 1209 ms 980 KB Output is correct
3 Correct 574 ms 1028 KB Output is correct
4 Correct 584 ms 1052 KB Output is correct
5 Correct 1064 ms 1048 KB Output is correct
6 Correct 1279 ms 1028 KB Output is correct
7 Correct 1259 ms 1100 KB Output is correct
8 Correct 566 ms 1028 KB Output is correct
9 Correct 1234 ms 1004 KB Output is correct
10 Correct 1498 ms 1080 KB Output is correct
11 Correct 1477 ms 1072 KB Output is correct
12 Correct 1507 ms 1068 KB Output is correct
13 Correct 1149 ms 1048 KB Output is correct
14 Correct 1260 ms 992 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1204 ms 1056 KB Output is correct
2 Correct 1501 ms 1068 KB Output is correct
3 Correct 1581 ms 1056 KB Output is correct
4 Correct 1574 ms 984 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 326 ms 844 KB Output is correct
7 Correct 56 ms 852 KB Output is correct
8 Correct 32 ms 852 KB Output is correct
9 Correct 53 ms 852 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 91 ms 724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 723 ms 800 KB Output is correct
2 Correct 715 ms 800 KB Output is correct
3 Correct 725 ms 836 KB Output is correct
4 Correct 703 ms 796 KB Output is correct
5 Correct 708 ms 796 KB Output is correct
6 Correct 751 ms 788 KB Output is correct
7 Correct 483 ms 792 KB Output is correct
8 Correct 993 ms 784 KB Output is correct
9 Correct 802 ms 776 KB Output is correct
10 Correct 746 ms 752 KB Output is correct
11 Correct 733 ms 768 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 420 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 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 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 592 ms 1080 KB Output is correct
33 Correct 639 ms 1076 KB Output is correct
34 Correct 722 ms 1076 KB Output is correct
35 Correct 1375 ms 1060 KB Output is correct
36 Correct 1076 ms 1060 KB Output is correct
37 Correct 559 ms 976 KB Output is correct
38 Correct 1455 ms 1060 KB Output is correct
39 Correct 906 ms 1048 KB Output is correct
40 Correct 510 ms 1024 KB Output is correct
41 Correct 1108 ms 1016 KB Output is correct
42 Correct 967 ms 1012 KB Output is correct
43 Correct 498 ms 980 KB Output is correct
44 Correct 1236 ms 1060 KB Output is correct
45 Correct 1233 ms 1100 KB Output is correct
46 Correct 1282 ms 1060 KB Output is correct
47 Correct 1234 ms 1076 KB Output is correct
48 Correct 1211 ms 1064 KB Output is correct
49 Correct 607 ms 856 KB Output is correct
50 Correct 1274 ms 956 KB Output is correct
51 Correct 1209 ms 980 KB Output is correct
52 Correct 574 ms 1028 KB Output is correct
53 Correct 584 ms 1052 KB Output is correct
54 Correct 1064 ms 1048 KB Output is correct
55 Correct 1279 ms 1028 KB Output is correct
56 Correct 1259 ms 1100 KB Output is correct
57 Correct 566 ms 1028 KB Output is correct
58 Correct 1234 ms 1004 KB Output is correct
59 Correct 1498 ms 1080 KB Output is correct
60 Correct 1477 ms 1072 KB Output is correct
61 Correct 1507 ms 1068 KB Output is correct
62 Correct 1149 ms 1048 KB Output is correct
63 Correct 1260 ms 992 KB Output is correct
64 Correct 1204 ms 1056 KB Output is correct
65 Correct 1501 ms 1068 KB Output is correct
66 Correct 1581 ms 1056 KB Output is correct
67 Correct 1574 ms 984 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 326 ms 844 KB Output is correct
70 Correct 56 ms 852 KB Output is correct
71 Correct 32 ms 852 KB Output is correct
72 Correct 53 ms 852 KB Output is correct
73 Correct 4 ms 468 KB Output is correct
74 Correct 91 ms 724 KB Output is correct
75 Correct 497 ms 1076 KB Output is correct
76 Correct 635 ms 1100 KB Output is correct
77 Correct 700 ms 1072 KB Output is correct
78 Correct 675 ms 1080 KB Output is correct
79 Correct 688 ms 1084 KB Output is correct
80 Correct 1696 ms 1060 KB Output is correct
81 Correct 905 ms 1048 KB Output is correct
82 Correct 1227 ms 1044 KB Output is correct
83 Correct 1206 ms 1056 KB Output is correct
84 Correct 1071 ms 1056 KB Output is correct
85 Correct 572 ms 1036 KB Output is correct
86 Correct 964 ms 1048 KB Output is correct
87 Correct 562 ms 1032 KB Output is correct
88 Correct 795 ms 1072 KB Output is correct
89 Correct 1201 ms 1036 KB Output is correct
90 Correct 589 ms 1044 KB Output is correct
91 Correct 704 ms 1056 KB Output is correct
92 Correct 1084 ms 1080 KB Output is correct
93 Correct 925 ms 1044 KB Output is correct
94 Correct 785 ms 1056 KB Output is correct
95 Correct 1075 ms 1056 KB Output is correct
96 Correct 1444 ms 988 KB Output is correct
97 Correct 897 ms 1060 KB Output is correct
98 Correct 1020 ms 1040 KB Output is correct
99 Correct 944 ms 1032 KB Output is correct
100 Correct 638 ms 852 KB Output is correct