oj.uz

Submission #255560

# Submission time Handle Problem Language Result Execution time Memory
255560 2020-08-01T08:40:00 Z Hehehe Toy Train (IOI17_train) C++14
100 / 100
 424 ms 1536 KB 
#include "train.h"
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<long double, long double>
#define sz(x) (int)((x).size())

const int N = 5e3 + 11;
int n, m;
int ok[N], DEG[N], deg[N], a[N], r[N], viz[N], station[N], prv[N], flag;
vector<int>adj[N];

void bfs(){

    for(int i = 0; i < n; i++){
        viz[i] = 0;
        prv[i] = ok[i];
        station[i] = 0;
        deg[i] = DEG[i];
    }

    queue<int>q;

    for(int i = 0; i < n; i++){
        if(!ok[i] || !r[i])continue;
            
        for(auto it : adj[i]){
            if(viz[it])continue;
            
            if(a[it] || !(--deg[it])){
                viz[it] = 1;
                q.push(it);
            }
        }
        
        station[i] = 1;
    }

    for(int i = 0; i < n; i++)ok[i] = 0;

    while(!q.empty()){

        int i = q.front();
        q.pop();

        ok[i] = 1;
        if(station[i])continue;

        for(auto it : adj[i]){
            if(viz[it])continue;

            if(a[it] || !(--deg[it])){
                viz[it] = 1;
                q.push(it);
            }
        }
    }

    int fl = 0;
    for(int i = 0; i < n; i++){
        if(ok[i] != prv[i])fl = 1;
    }

    if(!fl)flag = 1;
}

vector<int> who_wins(vector<int> A, vector<int> R, vector<int> u, vector<int> v){

    n = sz(A);
    m = sz(u);

    for(int i = 0; i < n; i++){
        r[i] = R[i];
        a[i] = A[i];
    }

    for(int i = 0; i < m; i++){
        adj[v[i]].push_back(u[i]);
    }

    for(int i = 0; i < n; i++){
        for(auto it : adj[i]){
            DEG[it]++;
        }
    }

    memset(ok, 1, sizeof(ok));

    for(int i = 0; i < n && !flag; i++){
        bfs();
    }

    vector<int> res;
    for(int i = 0;i < n; i++){
        res.push_back(ok[i]);
    }

    return res;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 10 ms 1024 KB Output is correct
3 Correct 6 ms 1024 KB Output is correct
4 Correct 7 ms 1076 KB Output is correct
5 Correct 7 ms 1016 KB Output is correct
6 Correct 6 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 6 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 4 ms 1024 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 1272 KB Output is correct
2 Correct 112 ms 1528 KB Output is correct
3 Correct 145 ms 1408 KB Output is correct
4 Correct 9 ms 1408 KB Output is correct
5 Correct 11 ms 1408 KB Output is correct
6 Correct 9 ms 1408 KB Output is correct
7 Correct 8 ms 1408 KB Output is correct
8 Correct 11 ms 1396 KB Output is correct
9 Correct 7 ms 1408 KB Output is correct
10 Correct 8 ms 1408 KB Output is correct
11 Correct 7 ms 1400 KB Output is correct
12 Correct 7 ms 1408 KB Output is correct
13 Correct 9 ms 1408 KB Output is correct
14 Correct 9 ms 1408 KB Output is correct
15 Correct 9 ms 1408 KB Output is correct
16 Correct 11 ms 1408 KB Output is correct
17 Correct 8 ms 1408 KB Output is correct
18 Correct 187 ms 1160 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1152 KB Output is correct
2 Correct 7 ms 1408 KB Output is correct
3 Correct 8 ms 1408 KB Output is correct
4 Correct 8 ms 1408 KB Output is correct
5 Correct 8 ms 1408 KB Output is correct
6 Correct 8 ms 1408 KB Output is correct
7 Correct 9 ms 1408 KB Output is correct
8 Correct 7 ms 1408 KB Output is correct
9 Correct 9 ms 1408 KB Output is correct
10 Correct 8 ms 1408 KB Output is correct
11 Correct 8 ms 1408 KB Output is correct
12 Correct 9 ms 1408 KB Output is correct
13 Correct 8 ms 1408 KB Output is correct
14 Correct 8 ms 1408 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1280 KB Output is correct
2 Correct 8 ms 1280 KB Output is correct
3 Correct 8 ms 1280 KB Output is correct
4 Correct 12 ms 1152 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 5 ms 896 KB Output is correct
7 Correct 5 ms 896 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 6 ms 1152 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 10 ms 1024 KB Output is correct
3 Correct 6 ms 1024 KB Output is correct
4 Correct 7 ms 1076 KB Output is correct
5 Correct 7 ms 1016 KB Output is correct
6 Correct 6 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 6 ms 1024 KB Output is correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 4 ms 1024 KB Output is correct
12 Correct 0 ms 512 KB Output is correct
13 Correct 0 ms 512 KB Output is correct
14 Correct 0 ms 512 KB Output is correct
15 Correct 0 ms 512 KB Output is correct
16 Correct 0 ms 512 KB Output is correct
17 Correct 0 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 0 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 0 ms 512 KB Output is correct
24 Correct 0 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 0 ms 512 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 0 ms 512 KB Output is correct
32 Correct 64 ms 1272 KB Output is correct
33 Correct 112 ms 1528 KB Output is correct
34 Correct 145 ms 1408 KB Output is correct
35 Correct 9 ms 1408 KB Output is correct
36 Correct 11 ms 1408 KB Output is correct
37 Correct 9 ms 1408 KB Output is correct
38 Correct 8 ms 1408 KB Output is correct
39 Correct 11 ms 1396 KB Output is correct
40 Correct 7 ms 1408 KB Output is correct
41 Correct 8 ms 1408 KB Output is correct
42 Correct 7 ms 1400 KB Output is correct
43 Correct 7 ms 1408 KB Output is correct
44 Correct 9 ms 1408 KB Output is correct
45 Correct 9 ms 1408 KB Output is correct
46 Correct 9 ms 1408 KB Output is correct
47 Correct 11 ms 1408 KB Output is correct
48 Correct 8 ms 1408 KB Output is correct
49 Correct 187 ms 1160 KB Output is correct
50 Correct 7 ms 1152 KB Output is correct
51 Correct 7 ms 1408 KB Output is correct
52 Correct 8 ms 1408 KB Output is correct
53 Correct 8 ms 1408 KB Output is correct
54 Correct 8 ms 1408 KB Output is correct
55 Correct 8 ms 1408 KB Output is correct
56 Correct 9 ms 1408 KB Output is correct
57 Correct 7 ms 1408 KB Output is correct
58 Correct 9 ms 1408 KB Output is correct
59 Correct 8 ms 1408 KB Output is correct
60 Correct 8 ms 1408 KB Output is correct
61 Correct 9 ms 1408 KB Output is correct
62 Correct 8 ms 1408 KB Output is correct
63 Correct 8 ms 1408 KB Output is correct
64 Correct 10 ms 1280 KB Output is correct
65 Correct 8 ms 1280 KB Output is correct
66 Correct 8 ms 1280 KB Output is correct
67 Correct 12 ms 1152 KB Output is correct
68 Correct 1 ms 512 KB Output is correct
69 Correct 5 ms 896 KB Output is correct
70 Correct 5 ms 896 KB Output is correct
71 Correct 5 ms 1024 KB Output is correct
72 Correct 6 ms 1152 KB Output is correct
73 Correct 2 ms 640 KB Output is correct
74 Correct 8 ms 1024 KB Output is correct
75 Correct 112 ms 1408 KB Output is correct
76 Correct 141 ms 1528 KB Output is correct
77 Correct 187 ms 1408 KB Output is correct
78 Correct 191 ms 1408 KB Output is correct
79 Correct 185 ms 1408 KB Output is correct
80 Correct 9 ms 1536 KB Output is correct
81 Correct 10 ms 1408 KB Output is correct
82 Correct 10 ms 1408 KB Output is correct
83 Correct 14 ms 1408 KB Output is correct
84 Correct 11 ms 1536 KB Output is correct
85 Correct 10 ms 1408 KB Output is correct
86 Correct 12 ms 1404 KB Output is correct
87 Correct 9 ms 1408 KB Output is correct
88 Correct 16 ms 1408 KB Output is correct
89 Correct 9 ms 1408 KB Output is correct
90 Correct 18 ms 1408 KB Output is correct
91 Correct 19 ms 1408 KB Output is correct
92 Correct 32 ms 1408 KB Output is correct
93 Correct 30 ms 1536 KB Output is correct
94 Correct 29 ms 1408 KB Output is correct
95 Correct 33 ms 1408 KB Output is correct
96 Correct 67 ms 1376 KB Output is correct
97 Correct 221 ms 1464 KB Output is correct
98 Correct 400 ms 1408 KB Output is correct
99 Correct 424 ms 1408 KB Output is correct
100 Correct 198 ms 1152 KB Output is correct