oj.uz

답안 #287848

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
287848 2020-09-01T04:24:29 Z Mercenary 장난감 기차 (IOI17_train) C++14
100 / 100
 585 ms 1784 KB 
#include "train.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 5e3 + 5;
const int mod = 1e9 + 7;

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v){
    int n = a.size() , m = u.size();
    vector<vector<int>> adj(m,vector<int>(0));
    vector<int> res(n , -1);
    vector<int> deg(n , 0);
    for(int i = 0 ; i < m ; ++i){
        deg[u[i]]++;
        adj[v[i]].pb(u[i]);
    }
    vector<int> cnt(n , 0);
    while(true){
        fill(cnt.begin(),cnt.end(),0);
        queue<int> q;
        auto check = [&](int u , int col){
            return cnt[u] >= (a[u] ^ col ? deg[u] : 1);
        };
        for(int i = 0 ; i < n ; ++i){
            if(res[i] == -1 && (r[i] || check(i , 1))){
                res[i] = 1;
                q.push(i);
            }
        }
        auto bfs = [&](int col){
            while(q.size()){
                int u = q.front();q.pop();
//                cout << u << endl;
                for(auto & c : adj[u]){
                    cnt[c]++;
                    if(res[c] == -1 && check(c , col)){
                        res[c] = col;
                        q.push(c);
                    }
                }
            }
        };
        bfs(1);
//        for(int i = 0 ; i < n ; ++i)cout << res[i] << " ";cout << endl;
        if(*min_element(res.begin(),res.end()) >= 0)return res;
        fill(cnt.begin(),cnt.end(),0);
        for(int i = 0 ; i < n ; ++i){
            if(res[i] == 1){
                res[i] = -1;
            }else{
                res[i] = 0;
                for(auto & c : adj[i]){
                    cnt[c]++;
                }
            }
        }
        for(int i = 0 ; i < n ; ++i){
            if(res[i] == -1 && check(i , 0)){
                q.push(i);
                res[i] = 0;
            }
        }
        bfs(0);
    }
    return res;
}

#ifdef LOCAL
#include "train.h"

#include <cstdio>
#include <vector>
#include <cassert>

using namespace std;

int main() {
	int n, m;
	assert(2 == scanf("%d %d", &n, &m));

	vector<int> a(n), r(n), u(m), v(m);

	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &a[i]));

	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &r[i]));

	for(int i = 0; i < m; i++)
		assert(2 == scanf("%d %d", &u[i], &v[i]));

	vector<int> res = who_wins(a, r, u, v);

	for(int i = 0; i < (int)res.size(); i++)
		printf(i ? " %d" : "%d", res[i]);
	printf("\n");

	return 0;
}
#endif // LOCAL

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 1664 KB Output is correct
2 Correct 233 ms 1664 KB Output is correct
3 Correct 330 ms 1664 KB Output is correct
4 Correct 9 ms 1664 KB Output is correct
5 Correct 10 ms 1732 KB Output is correct
6 Correct 10 ms 1664 KB Output is correct
7 Correct 9 ms 1664 KB Output is correct
8 Correct 9 ms 1664 KB Output is correct
9 Correct 8 ms 1536 KB Output is correct
10 Correct 9 ms 1536 KB Output is correct
11 Correct 8 ms 1536 KB Output is correct
12 Correct 8 ms 1536 KB Output is correct
13 Correct 9 ms 1664 KB Output is correct
14 Correct 9 ms 1664 KB Output is correct
15 Correct 9 ms 1664 KB Output is correct
16 Correct 9 ms 1664 KB Output is correct
17 Correct 9 ms 1664 KB Output is correct
18 Correct 462 ms 1152 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1664 KB Output is correct
2 Correct 9 ms 1664 KB Output is correct
3 Correct 10 ms 1664 KB Output is correct
4 Correct 8 ms 1536 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 6 ms 1280 KB Output is correct
8 Correct 7 ms 1408 KB Output is correct
9 Correct 6 ms 1408 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 6 ms 1280 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 6 ms 1024 KB Output is correct
3 Correct 6 ms 1024 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 6 ms 1024 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 5 ms 896 KB Output is correct
8 Correct 6 ms 1024 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 5 ms 896 KB Output is correct
11 Correct 4 ms 896 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 117 ms 1664 KB Output is correct
33 Correct 233 ms 1664 KB Output is correct
34 Correct 330 ms 1664 KB Output is correct
35 Correct 9 ms 1664 KB Output is correct
36 Correct 10 ms 1732 KB Output is correct
37 Correct 10 ms 1664 KB Output is correct
38 Correct 9 ms 1664 KB Output is correct
39 Correct 9 ms 1664 KB Output is correct
40 Correct 8 ms 1536 KB Output is correct
41 Correct 9 ms 1536 KB Output is correct
42 Correct 8 ms 1536 KB Output is correct
43 Correct 8 ms 1536 KB Output is correct
44 Correct 9 ms 1664 KB Output is correct
45 Correct 9 ms 1664 KB Output is correct
46 Correct 9 ms 1664 KB Output is correct
47 Correct 9 ms 1664 KB Output is correct
48 Correct 9 ms 1664 KB Output is correct
49 Correct 462 ms 1152 KB Output is correct
50 Correct 7 ms 1408 KB Output is correct
51 Correct 8 ms 1536 KB Output is correct
52 Correct 9 ms 1664 KB Output is correct
53 Correct 10 ms 1664 KB Output is correct
54 Correct 9 ms 1664 KB Output is correct
55 Correct 9 ms 1664 KB Output is correct
56 Correct 9 ms 1664 KB Output is correct
57 Correct 9 ms 1536 KB Output is correct
58 Correct 8 ms 1536 KB Output is correct
59 Correct 9 ms 1664 KB Output is correct
60 Correct 9 ms 1664 KB Output is correct
61 Correct 9 ms 1664 KB Output is correct
62 Correct 9 ms 1664 KB Output is correct
63 Correct 9 ms 1536 KB Output is correct
64 Correct 9 ms 1664 KB Output is correct
65 Correct 9 ms 1664 KB Output is correct
66 Correct 10 ms 1664 KB Output is correct
67 Correct 8 ms 1536 KB Output is correct
68 Correct 1 ms 384 KB Output is correct
69 Correct 5 ms 1024 KB Output is correct
70 Correct 6 ms 1280 KB Output is correct
71 Correct 7 ms 1408 KB Output is correct
72 Correct 6 ms 1408 KB Output is correct
73 Correct 2 ms 640 KB Output is correct
74 Correct 6 ms 1280 KB Output is correct
75 Correct 169 ms 1704 KB Output is correct
76 Correct 254 ms 1664 KB Output is correct
77 Correct 388 ms 1784 KB Output is correct
78 Correct 366 ms 1664 KB Output is correct
79 Correct 370 ms 1664 KB Output is correct
80 Correct 10 ms 1664 KB Output is correct
81 Correct 10 ms 1664 KB Output is correct
82 Correct 10 ms 1664 KB Output is correct
83 Correct 10 ms 1664 KB Output is correct
84 Correct 10 ms 1664 KB Output is correct
85 Correct 10 ms 1664 KB Output is correct
86 Correct 11 ms 1664 KB Output is correct
87 Correct 10 ms 1664 KB Output is correct
88 Correct 13 ms 1664 KB Output is correct
89 Correct 10 ms 1668 KB Output is correct
90 Correct 16 ms 1664 KB Output is correct
91 Correct 15 ms 1664 KB Output is correct
92 Correct 25 ms 1664 KB Output is correct
93 Correct 26 ms 1664 KB Output is correct
94 Correct 27 ms 1664 KB Output is correct
95 Correct 29 ms 1664 KB Output is correct
96 Correct 79 ms 1536 KB Output is correct
97 Correct 371 ms 1664 KB Output is correct
98 Correct 568 ms 1664 KB Output is correct
99 Correct 585 ms 1536 KB Output is correct
100 Correct 464 ms 1152 KB Output is correct