oj.uz

답안 #1076802

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076802 2024-08-26T16:45:36 Z zehnsechs 장난감 기차 (IOI17_train) C++14
100 / 100
 258 ms 1880 KB 
#include "train.h"
#include<bits/stdc++.h>

using namespace std;


void dfs(int v, vector<int>& x, vector<int>& c, vector<vector<int>>& adj, vector<int>& res){
    if(res[v]) return;
    res[v]=1;
    //cerr << "vertex " << v << '\n';    
    if(res[v]){
        for(int u: adj[v]){
            //cerr << "n " << u << '\n';
            if (u==v) continue;
            c[u]--;
            if(c[u]==0 && !res[u]) {
                dfs(u,x,c,adj,res);
            }
        }
    }
}


vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	int n = a.size();
        int m = u.size();
        vector<int> res(n,1);
        vector<vector<int>> adj(n);
        vector<int> deg(n,0);
        
        //add the edges to adj in the opposite direction
        for(int i=0;i<m;++i){
            //cerr << "edge " << u[i] << ' ' << v[i] << '\n';
            adj[v[i]].push_back(u[i]);
            deg[u[i]]++;
        }
        
        bool con = true;
        while(con){
            con = false;
            vector<int> fa(n,0);
            vector<int> rm(n,0);
            vector<int> c0(n,1);
            vector<int> c1(n,1);
            
            for(int i=0;i<n;++i) (a[i] ? c1[i] = deg[i] : c0[i]= deg[i]);
            //cerr << "fa" << '\n';
            for(int i=0;i<n;++i) if(r[i]&&res[i]) dfs(i,r,c0,adj,fa);
            vector<int> x(n,0);
            for(int i=0;i<n;++i) if(!fa[i]) x[i]=1;
            //cerr << "fb" << '\n';
            
            for(int i=0;i<n;++i) if(!fa[i]&&res[i]) dfs(i,x,c1,adj,rm);
            for(int i=0;i<n;++i) if(rm[i]) {
                //cerr << "unreachable " << i <<'\n';
                for(int u: adj[i]) deg[u]--;
                adj[i].clear();
                res[i]=0;
                con = true;
                }
        }



	return res;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 860 KB Output is correct
2 Correct 3 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 3 ms 1004 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 3 ms 1024 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 3 ms 996 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 344 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 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 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 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 1668 KB Output is correct
2 Correct 93 ms 1880 KB Output is correct
3 Correct 122 ms 1628 KB Output is correct
4 Correct 5 ms 1628 KB Output is correct
5 Correct 5 ms 1472 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 4 ms 1468 KB Output is correct
8 Correct 6 ms 1372 KB Output is correct
9 Correct 5 ms 1368 KB Output is correct
10 Correct 5 ms 1368 KB Output is correct
11 Correct 4 ms 1236 KB Output is correct
12 Correct 5 ms 1212 KB Output is correct
13 Correct 4 ms 1628 KB Output is correct
14 Correct 5 ms 1624 KB Output is correct
15 Correct 5 ms 1628 KB Output is correct
16 Correct 6 ms 1512 KB Output is correct
17 Correct 4 ms 1504 KB Output is correct
18 Correct 201 ms 1384 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1372 KB Output is correct
2 Correct 4 ms 1368 KB Output is correct
3 Correct 5 ms 1116 KB Output is correct
4 Correct 5 ms 1116 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 3 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 1 ms 348 KB Output is correct
11 Correct 2 ms 820 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 860 KB Output is correct
2 Correct 3 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 3 ms 1004 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 3 ms 1024 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 3 ms 996 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 344 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 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 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 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 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 52 ms 1668 KB Output is correct
33 Correct 93 ms 1880 KB Output is correct
34 Correct 122 ms 1628 KB Output is correct
35 Correct 5 ms 1628 KB Output is correct
36 Correct 5 ms 1472 KB Output is correct
37 Correct 5 ms 1372 KB Output is correct
38 Correct 4 ms 1468 KB Output is correct
39 Correct 6 ms 1372 KB Output is correct
40 Correct 5 ms 1368 KB Output is correct
41 Correct 5 ms 1368 KB Output is correct
42 Correct 4 ms 1236 KB Output is correct
43 Correct 5 ms 1212 KB Output is correct
44 Correct 4 ms 1628 KB Output is correct
45 Correct 5 ms 1624 KB Output is correct
46 Correct 5 ms 1628 KB Output is correct
47 Correct 6 ms 1512 KB Output is correct
48 Correct 4 ms 1504 KB Output is correct
49 Correct 201 ms 1384 KB Output is correct
50 Correct 4 ms 1096 KB Output is correct
51 Correct 5 ms 1116 KB Output is correct
52 Correct 5 ms 1116 KB Output is correct
53 Correct 5 ms 1116 KB Output is correct
54 Correct 5 ms 1116 KB Output is correct
55 Correct 4 ms 1132 KB Output is correct
56 Correct 5 ms 1112 KB Output is correct
57 Correct 5 ms 1112 KB Output is correct
58 Correct 4 ms 1116 KB Output is correct
59 Correct 4 ms 1116 KB Output is correct
60 Correct 5 ms 1112 KB Output is correct
61 Correct 4 ms 1116 KB Output is correct
62 Correct 5 ms 1372 KB Output is correct
63 Correct 5 ms 1116 KB Output is correct
64 Correct 5 ms 1372 KB Output is correct
65 Correct 4 ms 1368 KB Output is correct
66 Correct 5 ms 1116 KB Output is correct
67 Correct 5 ms 1116 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 2 ms 860 KB Output is correct
70 Correct 3 ms 860 KB Output is correct
71 Correct 3 ms 860 KB Output is correct
72 Correct 3 ms 860 KB Output is correct
73 Correct 1 ms 348 KB Output is correct
74 Correct 2 ms 820 KB Output is correct
75 Correct 63 ms 1372 KB Output is correct
76 Correct 90 ms 1860 KB Output is correct
77 Correct 131 ms 1852 KB Output is correct
78 Correct 123 ms 1876 KB Output is correct
79 Correct 134 ms 1624 KB Output is correct
80 Correct 5 ms 1372 KB Output is correct
81 Correct 5 ms 1264 KB Output is correct
82 Correct 6 ms 1372 KB Output is correct
83 Correct 5 ms 1508 KB Output is correct
84 Correct 6 ms 1372 KB Output is correct
85 Correct 5 ms 1372 KB Output is correct
86 Correct 6 ms 1448 KB Output is correct
87 Correct 5 ms 1372 KB Output is correct
88 Correct 7 ms 1504 KB Output is correct
89 Correct 5 ms 1372 KB Output is correct
90 Correct 8 ms 1372 KB Output is correct
91 Correct 8 ms 1368 KB Output is correct
92 Correct 16 ms 1560 KB Output is correct
93 Correct 13 ms 1368 KB Output is correct
94 Correct 13 ms 1344 KB Output is correct
95 Correct 13 ms 1368 KB Output is correct
96 Correct 32 ms 1372 KB Output is correct
97 Correct 145 ms 1372 KB Output is correct
98 Correct 247 ms 1452 KB Output is correct
99 Correct 258 ms 1368 KB Output is correct
100 Correct 216 ms 1368 KB Output is correct