oj.uz

답안 #1015763

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015763 2024-07-06T18:17:10 Z hotboy2703 장난감 기차 (IOI17_train) C++17
100 / 100
 160 ms 1628 KB 
#include "train.h"

#include<bits/stdc++.h>
using namespace std;
using ll = int;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL << (i))
const ll MAXN = 5e3+10;
vector <ll> g[MAXN];
ll cnt[MAXN];
ll sus[MAXN];
bool in[MAXN];
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
    ll n =  sz(a);
    for (ll i = 0;i < sz(u);i ++){g[v[i]].push_back(u[i]);cnt[u[i]]++;sus[u[i]]++;}
    vector <ll> res(n,-1);
    while (1){
        vector <ll> R;
        for (ll i = 0;i < n;i ++){
            if (res[i] == -1 && r[i])R.push_back(i);
        }
        if (sz(R)==0){
            for (ll i = 0;i < n;i ++){
                if (res[i] == -1)res[i] = 0;
            }
            break;
        }
        for (auto x:R)in[x] = 1;
        for (ll i = 0;i < n;i ++)if (res[i] != -1)in[i] = 1;
        ll ptr = 0;
        while (ptr < sz(R)){
            ll u = R[ptr];
            ptr++;
            for (auto v:g[u]){
                cnt[v]--;
                if (in[v])continue;
                if (a[v]){
                    in[v] = 1;
                    R.push_back(v);
                }
                else {
                    if (cnt[v]==0){in[v] = 1;R.push_back(v);}
                }
            }
        }
//        for (auto x:R)cout<<x<<' ';
//        cout<<endl;
        for (ll i = 0;i < n;i ++){
            if (res[i] == -1 && r[i]){
                if (a[i]){
                    if (cnt[i] == sus[i])in[i] = 0;
                }
                else{
                    if (cnt[i])in[i] = 0;
                }
            }
        }
        vector <ll> X;
        for (ll i = 0;i < n;i ++){
            if (res[i] == -1 && !in[i]){X.push_back(i);}
        }
//        for (auto x:X)cout<<x<<' ';
//        cout<<endl;
        if (sz(X)==0){
            for (auto u:R){
                res[u] = 1;
            }
            break;
        }
        for (auto x:X){
            res[x] = 0;
        }
        for (ll i = 0;i < n;i ++){
            in[i] = 0;
            cnt[i] = sus[i];
        }

    }
	return res;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 860 KB Output is correct
2 Correct 4 ms 988 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 3 ms 984 KB Output is correct
6 Correct 4 ms 1016 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 5 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 3 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 564 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 568 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 1496 KB Output is correct
2 Correct 75 ms 1372 KB Output is correct
3 Correct 117 ms 1480 KB Output is correct
4 Correct 4 ms 1372 KB Output is correct
5 Correct 7 ms 1488 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 4 ms 1336 KB Output is correct
8 Correct 4 ms 1468 KB Output is correct
9 Correct 3 ms 1372 KB Output is correct
10 Correct 6 ms 1368 KB Output is correct
11 Correct 3 ms 1188 KB Output is correct
12 Correct 3 ms 1372 KB Output is correct
13 Correct 3 ms 1472 KB Output is correct
14 Correct 4 ms 1372 KB Output is correct
15 Correct 4 ms 1380 KB Output is correct
16 Correct 4 ms 1372 KB Output is correct
17 Correct 3 ms 1372 KB Output is correct
18 Correct 119 ms 944 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1084 KB Output is correct
2 Correct 4 ms 1116 KB Output is correct
3 Correct 4 ms 1372 KB Output is correct
4 Correct 5 ms 1340 KB Output is correct
5 Correct 4 ms 1368 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 4 ms 1368 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 6 ms 1312 KB Output is correct
10 Correct 4 ms 1372 KB Output is correct
11 Correct 4 ms 1372 KB Output is correct
12 Correct 4 ms 1372 KB Output is correct
13 Correct 5 ms 1472 KB Output is correct
14 Correct 3 ms 1184 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1628 KB Output is correct
2 Correct 3 ms 1476 KB Output is correct
3 Correct 5 ms 1372 KB Output is correct
4 Correct 4 ms 1372 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 2 ms 1020 KB Output is correct
8 Correct 3 ms 1112 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 1 ms 636 KB Output is correct
11 Correct 2 ms 860 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 860 KB Output is correct
2 Correct 4 ms 988 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 3 ms 984 KB Output is correct
6 Correct 4 ms 1016 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 5 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 3 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 564 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 568 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 43 ms 1496 KB Output is correct
33 Correct 75 ms 1372 KB Output is correct
34 Correct 117 ms 1480 KB Output is correct
35 Correct 4 ms 1372 KB Output is correct
36 Correct 7 ms 1488 KB Output is correct
37 Correct 5 ms 1372 KB Output is correct
38 Correct 4 ms 1336 KB Output is correct
39 Correct 4 ms 1468 KB Output is correct
40 Correct 3 ms 1372 KB Output is correct
41 Correct 6 ms 1368 KB Output is correct
42 Correct 3 ms 1188 KB Output is correct
43 Correct 3 ms 1372 KB Output is correct
44 Correct 3 ms 1472 KB Output is correct
45 Correct 4 ms 1372 KB Output is correct
46 Correct 4 ms 1380 KB Output is correct
47 Correct 4 ms 1372 KB Output is correct
48 Correct 3 ms 1372 KB Output is correct
49 Correct 119 ms 944 KB Output is correct
50 Correct 4 ms 1084 KB Output is correct
51 Correct 4 ms 1116 KB Output is correct
52 Correct 4 ms 1372 KB Output is correct
53 Correct 5 ms 1340 KB Output is correct
54 Correct 4 ms 1368 KB Output is correct
55 Correct 5 ms 1280 KB Output is correct
56 Correct 4 ms 1368 KB Output is correct
57 Correct 4 ms 1372 KB Output is correct
58 Correct 6 ms 1312 KB Output is correct
59 Correct 4 ms 1372 KB Output is correct
60 Correct 4 ms 1372 KB Output is correct
61 Correct 4 ms 1372 KB Output is correct
62 Correct 5 ms 1472 KB Output is correct
63 Correct 3 ms 1184 KB Output is correct
64 Correct 6 ms 1628 KB Output is correct
65 Correct 3 ms 1476 KB Output is correct
66 Correct 5 ms 1372 KB Output is correct
67 Correct 4 ms 1372 KB Output is correct
68 Correct 0 ms 604 KB Output is correct
69 Correct 2 ms 860 KB Output is correct
70 Correct 2 ms 1020 KB Output is correct
71 Correct 3 ms 1112 KB Output is correct
72 Correct 3 ms 1116 KB Output is correct
73 Correct 1 ms 636 KB Output is correct
74 Correct 2 ms 860 KB Output is correct
75 Correct 54 ms 1372 KB Output is correct
76 Correct 87 ms 1484 KB Output is correct
77 Correct 110 ms 1480 KB Output is correct
78 Correct 110 ms 1484 KB Output is correct
79 Correct 110 ms 1372 KB Output is correct
80 Correct 4 ms 1368 KB Output is correct
81 Correct 5 ms 1372 KB Output is correct
82 Correct 5 ms 1372 KB Output is correct
83 Correct 7 ms 1372 KB Output is correct
84 Correct 5 ms 1372 KB Output is correct
85 Correct 5 ms 1372 KB Output is correct
86 Correct 7 ms 1372 KB Output is correct
87 Correct 4 ms 1368 KB Output is correct
88 Correct 9 ms 1372 KB Output is correct
89 Correct 4 ms 1376 KB Output is correct
90 Correct 11 ms 1480 KB Output is correct
91 Correct 17 ms 1488 KB Output is correct
92 Correct 18 ms 1372 KB Output is correct
93 Correct 19 ms 1468 KB Output is correct
94 Correct 20 ms 1368 KB Output is correct
95 Correct 20 ms 1372 KB Output is correct
96 Correct 38 ms 1368 KB Output is correct
97 Correct 131 ms 1368 KB Output is correct
98 Correct 160 ms 1372 KB Output is correct
99 Correct 158 ms 1420 KB Output is correct
100 Correct 116 ms 1116 KB Output is correct