oj.uz

답안 #593466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
593466 2022-07-11T08:40:44 Z keta_tsimakuridze 장난감 기차 (IOI17_train) C++17
100 / 100
 793 ms 1508 KB 
#include "train.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 5005;
int f[N], out[N], vis[N], a[N];
vector<int> in[N];
void go(vector<int> cur, int t) {
        while(cur.size()) {
            int u = cur.back();
            cur.pop_back();
            for(int i = 0; i < in[u].size(); i++) {
                int v = in[u][i];
                if(vis[v]) continue;
                out[v]--;
                if(a[v] == t || !out[v]) vis[v] = 1, cur.push_back(v);
            }
        }
}
std::vector<int> who_wins(std::vector<int> A, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
    int n = A.size(), m = v.size();
    vector<int> w(n);

    for(int i = 0; i < n; i++) w[i] = 1, a[i] = A[i], in[i].clear();
    for(int i = 0; i < m; i++) in[v[i]].push_back(u[i]);
    while(true) {
        for(int i = 0; i < n; i++) vis[i] = 0, out[i] = 0;
        for(int i = 0; i < m; i++) ++out[u[i]];

        vector<int> cur;
        for(int i = 0; i < n; i++) {
            if(r[i] && !f[i]) {
                cur.push_back(i);
                vis[i] = 1;
            }
        }
        go(cur, 1);
        int F = 0;
        for(int i = 0; i < n; i++) {
            if(!f[i] && !vis[i]) {
                f[i] = 1;
                F = 1;
            }
        }
        if(!F) break;
        cur.clear();
        for(int i = 0; i < n; i++) vis[i] = 0, out[i] = 0;
        for(int i = 0; i < m; i++) ++out[u[i]];

        for(int i = 0; i < n; i++) {
            if(f[i]) cur.push_back(i), vis[i] = 1;
        }
        go(cur, 0);
        for(int i = 0; i < n; i++) {
            f[i] = vis[i];
            w[i] = 1 - f[i];
        }
    }
    return w;
}

Compilation message

train.cpp: In function 'void go(std::vector<int>, int)':
train.cpp:11:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |             for(int i = 0; i < in[u].size(); i++) {
      |                            ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 772 KB Output is correct
2 Correct 6 ms 944 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 7 ms 944 KB Output is correct
5 Correct 4 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 3 ms 820 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 428 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 424 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 428 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 424 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 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 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 1168 KB Output is correct
2 Correct 240 ms 1164 KB Output is correct
3 Correct 345 ms 1296 KB Output is correct
4 Correct 9 ms 1236 KB Output is correct
5 Correct 8 ms 1236 KB Output is correct
6 Correct 8 ms 1388 KB Output is correct
7 Correct 6 ms 1364 KB Output is correct
8 Correct 7 ms 1360 KB Output is correct
9 Correct 10 ms 1304 KB Output is correct
10 Correct 7 ms 1204 KB Output is correct
11 Correct 9 ms 1236 KB Output is correct
12 Correct 8 ms 1204 KB Output is correct
13 Correct 6 ms 1336 KB Output is correct
14 Correct 8 ms 1328 KB Output is correct
15 Correct 7 ms 1328 KB Output is correct
16 Correct 7 ms 1236 KB Output is correct
17 Correct 7 ms 1332 KB Output is correct
18 Correct 439 ms 1084 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1040 KB Output is correct
2 Correct 6 ms 1208 KB Output is correct
3 Correct 7 ms 1336 KB Output is correct
4 Correct 7 ms 1300 KB Output is correct
5 Correct 10 ms 1328 KB Output is correct
6 Correct 8 ms 1236 KB Output is correct
7 Correct 6 ms 1332 KB Output is correct
8 Correct 6 ms 1328 KB Output is correct
9 Correct 6 ms 1236 KB Output is correct
10 Correct 7 ms 1364 KB Output is correct
11 Correct 7 ms 1364 KB Output is correct
12 Correct 7 ms 1364 KB Output is correct
13 Correct 7 ms 1352 KB Output is correct
14 Correct 7 ms 1236 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1204 KB Output is correct
2 Correct 8 ms 1236 KB Output is correct
3 Correct 7 ms 1236 KB Output is correct
4 Correct 6 ms 1236 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 5 ms 980 KB Output is correct
8 Correct 5 ms 980 KB Output is correct
9 Correct 4 ms 980 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 6 ms 948 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 772 KB Output is correct
2 Correct 6 ms 944 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 7 ms 944 KB Output is correct
5 Correct 4 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 3 ms 820 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 428 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 416 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 424 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 428 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 424 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 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 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 131 ms 1168 KB Output is correct
33 Correct 240 ms 1164 KB Output is correct
34 Correct 345 ms 1296 KB Output is correct
35 Correct 9 ms 1236 KB Output is correct
36 Correct 8 ms 1236 KB Output is correct
37 Correct 8 ms 1388 KB Output is correct
38 Correct 6 ms 1364 KB Output is correct
39 Correct 7 ms 1360 KB Output is correct
40 Correct 10 ms 1304 KB Output is correct
41 Correct 7 ms 1204 KB Output is correct
42 Correct 9 ms 1236 KB Output is correct
43 Correct 8 ms 1204 KB Output is correct
44 Correct 6 ms 1336 KB Output is correct
45 Correct 8 ms 1328 KB Output is correct
46 Correct 7 ms 1328 KB Output is correct
47 Correct 7 ms 1236 KB Output is correct
48 Correct 7 ms 1332 KB Output is correct
49 Correct 439 ms 1084 KB Output is correct
50 Correct 5 ms 1040 KB Output is correct
51 Correct 6 ms 1208 KB Output is correct
52 Correct 7 ms 1336 KB Output is correct
53 Correct 7 ms 1300 KB Output is correct
54 Correct 10 ms 1328 KB Output is correct
55 Correct 8 ms 1236 KB Output is correct
56 Correct 6 ms 1332 KB Output is correct
57 Correct 6 ms 1328 KB Output is correct
58 Correct 6 ms 1236 KB Output is correct
59 Correct 7 ms 1364 KB Output is correct
60 Correct 7 ms 1364 KB Output is correct
61 Correct 7 ms 1364 KB Output is correct
62 Correct 7 ms 1352 KB Output is correct
63 Correct 7 ms 1236 KB Output is correct
64 Correct 7 ms 1204 KB Output is correct
65 Correct 8 ms 1236 KB Output is correct
66 Correct 7 ms 1236 KB Output is correct
67 Correct 6 ms 1236 KB Output is correct
68 Correct 1 ms 432 KB Output is correct
69 Correct 3 ms 852 KB Output is correct
70 Correct 5 ms 980 KB Output is correct
71 Correct 5 ms 980 KB Output is correct
72 Correct 4 ms 980 KB Output is correct
73 Correct 1 ms 596 KB Output is correct
74 Correct 6 ms 948 KB Output is correct
75 Correct 247 ms 1352 KB Output is correct
76 Correct 295 ms 1508 KB Output is correct
77 Correct 414 ms 1376 KB Output is correct
78 Correct 422 ms 1500 KB Output is correct
79 Correct 407 ms 1372 KB Output is correct
80 Correct 9 ms 1236 KB Output is correct
81 Correct 8 ms 1336 KB Output is correct
82 Correct 8 ms 1336 KB Output is correct
83 Correct 7 ms 1236 KB Output is correct
84 Correct 8 ms 1336 KB Output is correct
85 Correct 8 ms 1364 KB Output is correct
86 Correct 8 ms 1364 KB Output is correct
87 Correct 10 ms 1332 KB Output is correct
88 Correct 10 ms 1364 KB Output is correct
89 Correct 7 ms 1360 KB Output is correct
90 Correct 14 ms 1364 KB Output is correct
91 Correct 19 ms 1336 KB Output is correct
92 Correct 27 ms 1340 KB Output is correct
93 Correct 27 ms 1328 KB Output is correct
94 Correct 26 ms 1376 KB Output is correct
95 Correct 26 ms 1336 KB Output is correct
96 Correct 82 ms 1384 KB Output is correct
97 Correct 499 ms 1376 KB Output is correct
98 Correct 679 ms 1356 KB Output is correct
99 Correct 793 ms 1348 KB Output is correct
100 Correct 408 ms 1160 KB Output is correct