oj.uz

답안 #535434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535434 2022-03-10T09:23:55 Z mario05092929 장난감 기차 (IOI17_train) C++14
100 / 100
 497 ms 1476 KB 
#include "train.h"
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair <int,int> pi;
typedef vector <int> vec;
int s[5005],revs[5005],no[5005],n,m,ind[5005],ing[5005];
vec ans,v[5005];

vec who_wins(vec a,vec r,vec u1,vec u2) {
    n = a.size();
    m = u1.size();
    for(int i = 0;i < m;i++) {
        int y = u1[i], x = u2[i];
        v[x].push_back(y);
        ind[y]++;
    }
    for(int i = 0;i < n;i++) no[i] = r[i];
    queue <int> q;
    while(1) {
        memset(ing,0,sizeof(ing));
        for(int i = 0;i < n;i++) {
            if(no[i]) q.push(i);
            s[i] = no[i];
        }

        while(!q.empty()) {
            int x = q.front(); q.pop();
            for(int i : v[x]) {
                if(s[i]) continue;
                ing[i]++;
                if(!a[i]) {
                    if(ing[i] == ind[i]) {
                        s[i] = 1;
                        q.push(i);
                    }
                }
                else {
                    if(ing[i]) {
                        s[i] = 1;
                        q.push(i);
                    }
                }
            }
        }

        memset(ing,0,sizeof(ing));
        for(int i = 0;i < n;i++) {
            if(s[i]^1) q.push(i);
            revs[i] = s[i]^1;
        }

        while(!q.empty()) {
            int x = q.front(); q.pop();
            for(int i : v[x]) {
                if(revs[i]) continue;
                ing[i]++;
                if(a[i]) {
                    if(ing[i] == ind[i]) {
                        revs[i] = 1;
                        q.push(i);
                    }
                }
                else {
                    if(ing[i]) {
                        revs[i] = 1;
                        q.push(i);
                    }
                }
            }
        }
        int ch = 0;
        for(int i = 0;i < n;i++) {
            if(no[i]&&revs[i]) ch = 1, no[i] = 0;
        }
        if(!ch) break;
    }
    for(int i = 0;i < n;i++) {
        ans.push_back(revs[i]^1);
    }
    return ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 988 KB Output is correct
2 Correct 5 ms 980 KB Output is correct
3 Correct 5 ms 980 KB Output is correct
4 Correct 4 ms 980 KB Output is correct
5 Correct 5 ms 952 KB Output is correct
6 Correct 4 ms 980 KB Output is correct
7 Correct 4 ms 980 KB Output is correct
8 Correct 6 ms 980 KB Output is correct
9 Correct 4 ms 980 KB Output is correct
10 Correct 4 ms 952 KB Output is correct
11 Correct 4 ms 852 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 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 432 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 424 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 428 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 1 ms 428 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 1340 KB Output is correct
2 Correct 137 ms 1340 KB Output is correct
3 Correct 195 ms 1348 KB Output is correct
4 Correct 7 ms 1336 KB Output is correct
5 Correct 10 ms 1340 KB Output is correct
6 Correct 8 ms 1328 KB Output is correct
7 Correct 7 ms 1332 KB Output is correct
8 Correct 7 ms 1372 KB Output is correct
9 Correct 6 ms 1236 KB Output is correct
10 Correct 7 ms 1336 KB Output is correct
11 Correct 6 ms 1236 KB Output is correct
12 Correct 6 ms 1236 KB Output is correct
13 Correct 7 ms 1364 KB Output is correct
14 Correct 7 ms 1332 KB Output is correct
15 Correct 7 ms 1340 KB Output is correct
16 Correct 7 ms 1364 KB Output is correct
17 Correct 7 ms 1336 KB Output is correct
18 Correct 283 ms 1020 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1208 KB Output is correct
2 Correct 6 ms 1208 KB Output is correct
3 Correct 7 ms 1344 KB Output is correct
4 Correct 7 ms 1364 KB Output is correct
5 Correct 7 ms 1364 KB Output is correct
6 Correct 7 ms 1364 KB Output is correct
7 Correct 7 ms 1336 KB Output is correct
8 Correct 7 ms 1364 KB Output is correct
9 Correct 7 ms 1236 KB Output is correct
10 Correct 7 ms 1340 KB Output is correct
11 Correct 7 ms 1364 KB Output is correct
12 Correct 6 ms 1332 KB Output is correct
13 Correct 7 ms 1336 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 1340 KB Output is correct
2 Correct 8 ms 1364 KB Output is correct
3 Correct 7 ms 1376 KB Output is correct
4 Correct 7 ms 1304 KB Output is correct
5 Correct 1 ms 480 KB Output is correct
6 Correct 6 ms 956 KB Output is correct
7 Correct 5 ms 940 KB Output is correct
8 Correct 5 ms 1084 KB Output is correct
9 Correct 5 ms 992 KB Output is correct
10 Correct 2 ms 608 KB Output is correct
11 Correct 5 ms 940 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 988 KB Output is correct
2 Correct 5 ms 980 KB Output is correct
3 Correct 5 ms 980 KB Output is correct
4 Correct 4 ms 980 KB Output is correct
5 Correct 5 ms 952 KB Output is correct
6 Correct 4 ms 980 KB Output is correct
7 Correct 4 ms 980 KB Output is correct
8 Correct 6 ms 980 KB Output is correct
9 Correct 4 ms 980 KB Output is correct
10 Correct 4 ms 952 KB Output is correct
11 Correct 4 ms 852 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 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 432 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 424 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 428 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 0 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 432 KB Output is correct
29 Correct 1 ms 428 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 72 ms 1340 KB Output is correct
33 Correct 137 ms 1340 KB Output is correct
34 Correct 195 ms 1348 KB Output is correct
35 Correct 7 ms 1336 KB Output is correct
36 Correct 10 ms 1340 KB Output is correct
37 Correct 8 ms 1328 KB Output is correct
38 Correct 7 ms 1332 KB Output is correct
39 Correct 7 ms 1372 KB Output is correct
40 Correct 6 ms 1236 KB Output is correct
41 Correct 7 ms 1336 KB Output is correct
42 Correct 6 ms 1236 KB Output is correct
43 Correct 6 ms 1236 KB Output is correct
44 Correct 7 ms 1364 KB Output is correct
45 Correct 7 ms 1332 KB Output is correct
46 Correct 7 ms 1340 KB Output is correct
47 Correct 7 ms 1364 KB Output is correct
48 Correct 7 ms 1336 KB Output is correct
49 Correct 283 ms 1020 KB Output is correct
50 Correct 6 ms 1208 KB Output is correct
51 Correct 6 ms 1208 KB Output is correct
52 Correct 7 ms 1344 KB Output is correct
53 Correct 7 ms 1364 KB Output is correct
54 Correct 7 ms 1364 KB Output is correct
55 Correct 7 ms 1364 KB Output is correct
56 Correct 7 ms 1336 KB Output is correct
57 Correct 7 ms 1364 KB Output is correct
58 Correct 7 ms 1236 KB Output is correct
59 Correct 7 ms 1340 KB Output is correct
60 Correct 7 ms 1364 KB Output is correct
61 Correct 6 ms 1332 KB Output is correct
62 Correct 7 ms 1336 KB Output is correct
63 Correct 7 ms 1236 KB Output is correct
64 Correct 7 ms 1340 KB Output is correct
65 Correct 8 ms 1364 KB Output is correct
66 Correct 7 ms 1376 KB Output is correct
67 Correct 7 ms 1304 KB Output is correct
68 Correct 1 ms 480 KB Output is correct
69 Correct 6 ms 956 KB Output is correct
70 Correct 5 ms 940 KB Output is correct
71 Correct 5 ms 1084 KB Output is correct
72 Correct 5 ms 992 KB Output is correct
73 Correct 2 ms 608 KB Output is correct
74 Correct 5 ms 940 KB Output is correct
75 Correct 128 ms 1312 KB Output is correct
76 Correct 158 ms 1340 KB Output is correct
77 Correct 219 ms 1348 KB Output is correct
78 Correct 235 ms 1476 KB Output is correct
79 Correct 235 ms 1336 KB Output is correct
80 Correct 7 ms 1364 KB Output is correct
81 Correct 7 ms 1332 KB Output is correct
82 Correct 8 ms 1336 KB Output is correct
83 Correct 8 ms 1332 KB Output is correct
84 Correct 10 ms 1348 KB Output is correct
85 Correct 9 ms 1340 KB Output is correct
86 Correct 10 ms 1364 KB Output is correct
87 Correct 8 ms 1364 KB Output is correct
88 Correct 10 ms 1372 KB Output is correct
89 Correct 8 ms 1340 KB Output is correct
90 Correct 12 ms 1332 KB Output is correct
91 Correct 11 ms 1364 KB Output is correct
92 Correct 22 ms 1340 KB Output is correct
93 Correct 20 ms 1316 KB Output is correct
94 Correct 25 ms 1356 KB Output is correct
95 Correct 23 ms 1340 KB Output is correct
96 Correct 60 ms 1212 KB Output is correct
97 Correct 309 ms 1324 KB Output is correct
98 Correct 449 ms 1300 KB Output is correct
99 Correct 497 ms 1276 KB Output is correct
100 Correct 282 ms 980 KB Output is correct