oj.uz

답안 #1015372

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015372 2024-07-06T09:47:10 Z hotboy2703 장난감 기차 (IOI17_train) C++17
49 / 100
 188 ms 1284 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]){
                if (!a[v])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;
        vector <ll> X;
        for (ll i = 0;i < n;i ++){
            if (res[i] == -1 && !in[i]){X.push_back(i);}
        }
        if (sz(X)==0){
            for (auto u:R){
                res[u] = 1;
            }
            break;
        }
        for (ll i = 0;i < n;i ++){
            in[i] = 0;
            cnt[i] = sus[i];
        }

        R=X;
        for (auto x:R)in[x] = 1;
        for (ll i = 0;i < n;i ++)if (res[i] != -1)in[i] = 1;
        ptr = 0;
        while (ptr < sz(R)){
            ll u = R[ptr];
            ptr++;
            for (auto v:g[u]){
                if (a[v])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 (auto x:R)res[x] = 0;

        for (ll i = 0;i < n;i ++){
            in[i] = 0;
            cnt[i] = sus[i];
        }
        R.clear();
        for (ll i = 0;i < n;i ++){
            if (res[i] == 0)R.push_back(i);
        }
        ptr = 0;
        while (ptr < sz(R)){
            ll u = R[ptr];
            ptr++;
            for (auto v:g[u]){
                cnt[v]--;
                if (res[v]==0)continue;
                if (cnt[v]==0){res[v] = 0;R.push_back(v);}
            }
        }
//        for (auto x:R)cout<<x<<' ';
//        cout<<endl;
        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 860 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 3 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 856 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 344 KB Output is correct
8 Correct 0 ms 348 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 348 KB Output is correct
13 Correct 0 ms 344 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 600 KB Output is correct
18 Correct 0 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 50 ms 1116 KB Output is correct
2 Correct 103 ms 1116 KB Output is correct
3 Correct 155 ms 1272 KB Output is correct
4 Correct 4 ms 1112 KB Output is correct
5 Correct 5 ms 1116 KB Output is correct
6 Correct 5 ms 1284 KB Output is correct
7 Correct 4 ms 1116 KB Output is correct
8 Correct 4 ms 1112 KB Output is correct
9 Correct 4 ms 1000 KB Output is correct
10 Correct 4 ms 1012 KB Output is correct
11 Correct 4 ms 1112 KB Output is correct
12 Correct 3 ms 988 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 5 ms 1116 KB Output is correct
15 Correct 4 ms 1116 KB Output is correct
16 Correct 4 ms 1116 KB Output is correct
17 Correct 4 ms 1116 KB Output is correct
18 Correct 188 ms 860 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1116 KB Output is correct
2 Correct 4 ms 1116 KB Output is correct
3 Correct 4 ms 1116 KB Output is correct
4 Correct 4 ms 1116 KB Output is correct
5 Correct 4 ms 1116 KB Output is correct
6 Correct 4 ms 1004 KB Output is correct
7 Correct 4 ms 1000 KB Output is correct
8 Correct 4 ms 1116 KB Output is correct
9 Correct 4 ms 1116 KB Output is correct
10 Correct 4 ms 1116 KB Output is correct
11 Correct 4 ms 1264 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 4 ms 1116 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 860 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 3 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 856 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 344 KB Output is correct
19 Correct 0 ms 348 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 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 600 KB Output is correct
29 Correct 0 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 50 ms 1116 KB Output is correct
33 Correct 103 ms 1116 KB Output is correct
34 Correct 155 ms 1272 KB Output is correct
35 Correct 4 ms 1112 KB Output is correct
36 Correct 5 ms 1116 KB Output is correct
37 Correct 5 ms 1284 KB Output is correct
38 Correct 4 ms 1116 KB Output is correct
39 Correct 4 ms 1112 KB Output is correct
40 Correct 4 ms 1000 KB Output is correct
41 Correct 4 ms 1012 KB Output is correct
42 Correct 4 ms 1112 KB Output is correct
43 Correct 3 ms 988 KB Output is correct
44 Correct 4 ms 1116 KB Output is correct
45 Correct 5 ms 1116 KB Output is correct
46 Correct 4 ms 1116 KB Output is correct
47 Correct 4 ms 1116 KB Output is correct
48 Correct 4 ms 1116 KB Output is correct
49 Correct 188 ms 860 KB Output is correct
50 Correct 5 ms 1116 KB Output is correct
51 Correct 4 ms 1116 KB Output is correct
52 Correct 4 ms 1116 KB Output is correct
53 Correct 4 ms 1116 KB Output is correct
54 Correct 4 ms 1116 KB Output is correct
55 Correct 4 ms 1004 KB Output is correct
56 Correct 4 ms 1000 KB Output is correct
57 Correct 4 ms 1116 KB Output is correct
58 Correct 4 ms 1116 KB Output is correct
59 Correct 4 ms 1116 KB Output is correct
60 Correct 4 ms 1264 KB Output is correct
61 Correct 4 ms 1116 KB Output is correct
62 Correct 4 ms 1116 KB Output is correct
63 Correct 4 ms 1116 KB Output is correct
64 Correct 5 ms 1116 KB Output is correct
65 Correct 6 ms 1116 KB Output is correct
66 Correct 5 ms 1116 KB Output is correct
67 Correct 4 ms 992 KB Output is correct
68 Correct 1 ms 604 KB Output is correct
69 Correct 2 ms 856 KB Output is correct
70 Correct 3 ms 856 KB Output is correct
71 Correct 3 ms 860 KB Output is correct
72 Correct 3 ms 860 KB Output is correct
73 Correct 2 ms 604 KB Output is correct
74 Correct 2 ms 860 KB Output is correct
75 Correct 72 ms 1276 KB Output is correct
76 Correct 116 ms 1276 KB Output is correct
77 Correct 162 ms 1112 KB Output is correct
78 Correct 167 ms 1272 KB Output is correct
79 Correct 162 ms 1268 KB Output is correct
80 Correct 4 ms 1116 KB Output is correct
81 Correct 4 ms 1116 KB Output is correct
82 Correct 5 ms 1116 KB Output is correct
83 Correct 5 ms 1116 KB Output is correct
84 Correct 5 ms 1248 KB Output is correct
85 Correct 5 ms 1112 KB Output is correct
86 Incorrect 5 ms 1116 KB 3rd lines differ - on the 27th token, expected: '0', found: '1'
87 Halted 0 ms 0 KB -