oj.uz

답안 #1055022

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055022 2024-08-12T14:04:17 Z Wansur 장난감 기차 (IOI17_train) C++17
100 / 100
 168 ms 1756 KB 
#include <bits/stdc++.h>
#include "train.h"
#define ent '\n'
#define  f first
#define s second
//#define int long long

using namespace std;
typedef long long ll;
const int maxn = 5e3 + 12;
const int mod = 1e9 + 7;

vector<int> g[maxn], rg[maxn];
bool won[maxn], del[maxn];
int out[maxn];
int n, m;

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> U, vector<int> V){
    n = a.size(), m = U.size();
    vector<int> ans(n);

    for(int i=0;i<m;i++){
        g[U[i]].push_back(V[i]);
        rg[V[i]].push_back(U[i]);
    }

    bool ok = 0;

    while(true){
        for(int i=0;i<n;i++){
            out[i] = g[i].size();
            won[i] = 0;
        }

        queue<int> q;

        for(int i=0;i<n;i++){
            won[i] = 0;
            if(r[i] == 1){
                won[i] = 1;
                q.push(i);
            }
        }

        while(q.size()){
            int v = q.front();
            q.pop();
            for(int to:rg[v]){
                if(a[to] && !won[to]){
                    won[to] = 1;
                    q.push(to);
                }
                if(!a[to] && !won[to]){
                    out[to]--;
                    if(out[to] == 0){
                        won[to] = 1;
                        q.push(to);
                    }
                }
            }
        }

        bool fg = 1;

        for(int i=0;i<n;i++){
            if(r[i]){
                bool ok = 1 - a[i];
                for(int to:g[i]){
                    if(a[i]) ok |= won[to];
                    else ok &= won[to];
                }
                fg &= ok;
                if(!ok) {
                    r[i] = 0;
                }
            }
        }

        if(fg){
            for(int i=0;i<n;i++){
                ans[i] |= won[i];
            }
            break;
        }
    }
    
    return ans;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:27:10: warning: unused variable 'ok' [-Wunused-variable]
   27 |     bool ok = 0;
      |          ^~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 1368 KB Output is correct
2 Correct 53 ms 1404 KB Output is correct
3 Correct 65 ms 1368 KB Output is correct
4 Correct 5 ms 1372 KB Output is correct
5 Correct 6 ms 1628 KB Output is correct
6 Correct 6 ms 1752 KB Output is correct
7 Correct 4 ms 1624 KB Output is correct
8 Correct 4 ms 1628 KB Output is correct
9 Correct 3 ms 1628 KB Output is correct
10 Correct 4 ms 1564 KB Output is correct
11 Correct 4 ms 1624 KB Output is correct
12 Correct 4 ms 1464 KB Output is correct
13 Correct 4 ms 1628 KB Output is correct
14 Correct 4 ms 1628 KB Output is correct
15 Correct 4 ms 1628 KB Output is correct
16 Correct 4 ms 1628 KB Output is correct
17 Correct 4 ms 1628 KB Output is correct
18 Correct 98 ms 1368 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1372 KB Output is correct
2 Correct 4 ms 1372 KB Output is correct
3 Correct 4 ms 1628 KB Output is correct
4 Correct 5 ms 1628 KB Output is correct
5 Correct 4 ms 1628 KB Output is correct
6 Correct 4 ms 1720 KB Output is correct
7 Correct 5 ms 1628 KB Output is correct
8 Correct 4 ms 1624 KB Output is correct
9 Correct 4 ms 1624 KB Output is correct
10 Correct 4 ms 1592 KB Output is correct
11 Correct 4 ms 1628 KB Output is correct
12 Correct 6 ms 1624 KB Output is correct
13 Correct 4 ms 1696 KB Output is correct
14 Correct 4 ms 1628 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 4 ms 1116 KB Output is correct
3 Correct 3 ms 1112 KB Output is correct
4 Correct 3 ms 1116 KB Output is correct
5 Correct 3 ms 1116 KB Output is correct
6 Correct 3 ms 1112 KB Output is correct
7 Correct 3 ms 1116 KB Output is correct
8 Correct 3 ms 1112 KB Output is correct
9 Correct 4 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 2 ms 1112 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 0 ms 604 KB Output is correct
32 Correct 30 ms 1368 KB Output is correct
33 Correct 53 ms 1404 KB Output is correct
34 Correct 65 ms 1368 KB Output is correct
35 Correct 5 ms 1372 KB Output is correct
36 Correct 6 ms 1628 KB Output is correct
37 Correct 6 ms 1752 KB Output is correct
38 Correct 4 ms 1624 KB Output is correct
39 Correct 4 ms 1628 KB Output is correct
40 Correct 3 ms 1628 KB Output is correct
41 Correct 4 ms 1564 KB Output is correct
42 Correct 4 ms 1624 KB Output is correct
43 Correct 4 ms 1464 KB Output is correct
44 Correct 4 ms 1628 KB Output is correct
45 Correct 4 ms 1628 KB Output is correct
46 Correct 4 ms 1628 KB Output is correct
47 Correct 4 ms 1628 KB Output is correct
48 Correct 4 ms 1628 KB Output is correct
49 Correct 98 ms 1368 KB Output is correct
50 Correct 4 ms 1372 KB Output is correct
51 Correct 4 ms 1372 KB Output is correct
52 Correct 4 ms 1628 KB Output is correct
53 Correct 5 ms 1628 KB Output is correct
54 Correct 4 ms 1628 KB Output is correct
55 Correct 4 ms 1720 KB Output is correct
56 Correct 5 ms 1628 KB Output is correct
57 Correct 4 ms 1624 KB Output is correct
58 Correct 4 ms 1624 KB Output is correct
59 Correct 4 ms 1592 KB Output is correct
60 Correct 4 ms 1628 KB Output is correct
61 Correct 6 ms 1624 KB Output is correct
62 Correct 4 ms 1696 KB Output is correct
63 Correct 4 ms 1628 KB Output is correct
64 Correct 4 ms 1368 KB Output is correct
65 Correct 7 ms 1624 KB Output is correct
66 Correct 4 ms 1628 KB Output is correct
67 Correct 4 ms 1628 KB Output is correct
68 Correct 1 ms 604 KB Output is correct
69 Correct 2 ms 1116 KB Output is correct
70 Correct 3 ms 1372 KB Output is correct
71 Correct 2 ms 1420 KB Output is correct
72 Correct 2 ms 1372 KB Output is correct
73 Correct 1 ms 860 KB Output is correct
74 Correct 2 ms 1116 KB Output is correct
75 Correct 43 ms 1628 KB Output is correct
76 Correct 63 ms 1628 KB Output is correct
77 Correct 80 ms 1624 KB Output is correct
78 Correct 73 ms 1628 KB Output is correct
79 Correct 72 ms 1756 KB Output is correct
80 Correct 4 ms 1628 KB Output is correct
81 Correct 4 ms 1684 KB Output is correct
82 Correct 5 ms 1712 KB Output is correct
83 Correct 6 ms 1628 KB Output is correct
84 Correct 5 ms 1628 KB Output is correct
85 Correct 5 ms 1628 KB Output is correct
86 Correct 6 ms 1624 KB Output is correct
87 Correct 5 ms 1628 KB Output is correct
88 Correct 9 ms 1756 KB Output is correct
89 Correct 5 ms 1624 KB Output is correct
90 Correct 9 ms 1740 KB Output is correct
91 Correct 9 ms 1740 KB Output is correct
92 Correct 15 ms 1624 KB Output is correct
93 Correct 13 ms 1560 KB Output is correct
94 Correct 14 ms 1628 KB Output is correct
95 Correct 15 ms 1752 KB Output is correct
96 Correct 29 ms 1624 KB Output is correct
97 Correct 87 ms 1732 KB Output is correct
98 Correct 162 ms 1628 KB Output is correct
99 Correct 168 ms 1628 KB Output is correct
100 Correct 97 ms 1368 KB Output is correct