oj.uz

답안 #785714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
785714 2023-07-17T13:32:42 Z 1bin Split the Attractions (IOI19_split) C++14
100 / 100
 96 ms 31384 KB 
#include <bits/stdc++.h>
//#include "split.h"

using namespace std;

#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 1e5 + 5;
int ans, n, A, B, label[NMAX], cnt;
int dfsn[NMAX], low[NMAX], sz[NMAX], t;
vector<int> adj[NMAX];

void color(int x, int c, int all = 0){
    if(label[x] != -1) return;
    label[x] = (cnt-- > 0 ? c : 2);
    for(int& nx : adj[x])
        if(all || dfsn[nx] > dfsn[x]) color(nx, c, all);
    return;
}

void dfs(int x, int p){
    vector<int> C;
    dfsn[x] = low[x] = ++t;
    sz[x] = 1;
    int mx = 0;
    for(int& nx : adj[x])
        if(nx != p) {
            if(!dfsn[nx]){
                dfs(nx, x);
                low[x] = min(low[x], low[nx]);
                sz[x] += sz[nx];
                C.emplace_back(nx); 
                mx = max(mx, sz[nx]);
            }
            else low[x] = min(low[x], dfsn[nx]);
        }

    if(!ans && sz[x] >= A && mx < A){
        int d = sz[x], u = n - d;
        vector<int> v;
        for(int& nx : C){
            if(d - sz[nx] >= A && low[nx] < dfsn[x]) u += sz[nx], d -= sz[nx];
            else v.emplace_back(nx);
        }
        if(u >= A){
            ans = 1;
            if(u >= B) {
                cnt = A - 1; label[x] = 0;
                for(int& y : v) color(y, 0);
                cnt = B; color(p, 1, 1);
            }
            else{
                cnt = B - 1; label[x] = 1;
                for(int& y : v) color(y, 1);
                cnt = A; color(p, 0, 1);
            }
        }
        else ans = -1;
    }
    return;
}

vector<int> find_split(int n_, int a, int b, int c, vector<int> p, vector<int> q) {
    n = n_;
    vector<pair<int, int>> arr = {{a, 1}, {b, 2}, {c, 3}};
    sort(all(arr));
    A = arr[0].first;
    B = arr[1].first;
	vector<int> res(n, 0);
    for(int i = 0; i < p.size(); i++){
        adj[p[i]].emplace_back(q[i]);
        adj[q[i]].emplace_back(p[i]);
    }
    memset(label, -1, sizeof(label));
    dfs(0, -1);
    if(ans == -1) return res;
    for(int i = 0; i < n; i++) res[i] = arr[label[i]].second;
	return res;
}

/*
int main(void){
    int n, m, a, b, c;
    cin >> n >> a >> b >> c;
    cin >> m;
    vector<int> p(m), q(m);
    for(int i = 0; i < m; i++) cin >> p[i] >> q[i];
    auto v = find_split(n, a, b, c, p, q);
    for(int& x : v) cout << x << ' ';
    return 0;
}
*/

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:70:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     for(int i = 0; i < p.size(); i++){
      |                    ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB ok, correct split
2 Correct 2 ms 3048 KB ok, correct split
3 Correct 2 ms 3028 KB ok, correct split
4 Correct 1 ms 3044 KB ok, correct split
5 Correct 2 ms 3028 KB ok, correct split
6 Correct 2 ms 3028 KB ok, correct split
7 Correct 75 ms 24404 KB ok, correct split
8 Correct 67 ms 20968 KB ok, correct split
9 Correct 64 ms 22424 KB ok, correct split
10 Correct 86 ms 31384 KB ok, correct split
11 Correct 69 ms 25164 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB ok, correct split
2 Correct 2 ms 3028 KB ok, correct split
3 Correct 2 ms 3044 KB ok, correct split
4 Correct 73 ms 17936 KB ok, correct split
5 Correct 49 ms 9608 KB ok, correct split
6 Correct 67 ms 31352 KB ok, correct split
7 Correct 63 ms 25704 KB ok, correct split
8 Correct 77 ms 11856 KB ok, correct split
9 Correct 49 ms 9724 KB ok, correct split
10 Correct 37 ms 10684 KB ok, correct split
11 Correct 37 ms 10692 KB ok, correct split
12 Correct 37 ms 10592 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3044 KB ok, correct split
2 Correct 47 ms 9560 KB ok, correct split
3 Correct 22 ms 5832 KB ok, correct split
4 Correct 2 ms 3028 KB ok, correct split
5 Correct 60 ms 14644 KB ok, correct split
6 Correct 59 ms 14216 KB ok, correct split
7 Correct 54 ms 13872 KB ok, correct split
8 Correct 56 ms 16508 KB ok, correct split
9 Correct 78 ms 13512 KB ok, correct split
10 Correct 15 ms 5352 KB ok, no valid answer
11 Correct 22 ms 6376 KB ok, no valid answer
12 Correct 40 ms 10436 KB ok, no valid answer
13 Correct 43 ms 9768 KB ok, no valid answer
14 Correct 35 ms 11040 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB ok, correct split
2 Correct 1 ms 3028 KB ok, no valid answer
3 Correct 2 ms 3028 KB ok, correct split
4 Correct 2 ms 3028 KB ok, correct split
5 Correct 2 ms 3028 KB ok, correct split
6 Correct 2 ms 3028 KB ok, correct split
7 Correct 2 ms 3028 KB ok, correct split
8 Correct 2 ms 3028 KB ok, correct split
9 Correct 3 ms 3444 KB ok, correct split
10 Correct 3 ms 3284 KB ok, correct split
11 Correct 2 ms 3048 KB ok, correct split
12 Correct 3 ms 3284 KB ok, correct split
13 Correct 2 ms 3040 KB ok, correct split
14 Correct 2 ms 3028 KB ok, correct split
15 Correct 2 ms 3028 KB ok, correct split
16 Correct 2 ms 3028 KB ok, correct split
17 Correct 1 ms 3028 KB ok, correct split
18 Correct 2 ms 3044 KB ok, correct split
19 Correct 2 ms 3048 KB ok, correct split
20 Correct 2 ms 3156 KB ok, correct split
21 Correct 3 ms 3284 KB ok, correct split
22 Correct 3 ms 3284 KB ok, correct split
23 Correct 4 ms 3316 KB ok, correct split
24 Correct 3 ms 3284 KB ok, correct split
25 Correct 3 ms 3308 KB ok, correct split
26 Correct 3 ms 3308 KB ok, correct split
27 Correct 3 ms 3284 KB ok, correct split
28 Correct 3 ms 3284 KB ok, correct split
29 Correct 2 ms 3028 KB ok, correct split
30 Correct 4 ms 3248 KB ok, correct split
31 Correct 2 ms 3028 KB ok, correct split
32 Correct 2 ms 3044 KB ok, correct split
33 Correct 2 ms 3028 KB ok, correct split
34 Correct 3 ms 3184 KB ok, correct split
35 Correct 3 ms 3156 KB ok, correct split
36 Correct 2 ms 3156 KB ok, correct split
37 Correct 3 ms 3252 KB ok, correct split
38 Correct 3 ms 3284 KB ok, correct split
39 Correct 3 ms 3284 KB ok, correct split
40 Correct 4 ms 3284 KB ok, correct split
41 Correct 2 ms 3156 KB ok, correct split
42 Correct 2 ms 3184 KB ok, correct split
43 Correct 3 ms 3284 KB ok, correct split
44 Correct 3 ms 3284 KB ok, correct split
45 Correct 3 ms 3284 KB ok, correct split
46 Correct 2 ms 3412 KB ok, correct split
47 Correct 3 ms 3340 KB ok, no valid answer
48 Correct 2 ms 3180 KB ok, correct split
49 Correct 3 ms 3412 KB ok, correct split
50 Correct 2 ms 3040 KB ok, no valid answer
51 Correct 2 ms 3040 KB ok, no valid answer
52 Correct 2 ms 3180 KB ok, no valid answer
53 Correct 3 ms 3308 KB ok, no valid answer
54 Correct 2 ms 3180 KB ok, no valid answer
55 Correct 2 ms 3312 KB ok, no valid answer
56 Correct 3 ms 3228 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB ok, correct split
2 Correct 2 ms 3048 KB ok, correct split
3 Correct 2 ms 3028 KB ok, correct split
4 Correct 1 ms 3044 KB ok, correct split
5 Correct 2 ms 3028 KB ok, correct split
6 Correct 2 ms 3028 KB ok, correct split
7 Correct 75 ms 24404 KB ok, correct split
8 Correct 67 ms 20968 KB ok, correct split
9 Correct 64 ms 22424 KB ok, correct split
10 Correct 86 ms 31384 KB ok, correct split
11 Correct 69 ms 25164 KB ok, correct split
12 Correct 2 ms 3028 KB ok, correct split
13 Correct 2 ms 3028 KB ok, correct split
14 Correct 2 ms 3044 KB ok, correct split
15 Correct 73 ms 17936 KB ok, correct split
16 Correct 49 ms 9608 KB ok, correct split
17 Correct 67 ms 31352 KB ok, correct split
18 Correct 63 ms 25704 KB ok, correct split
19 Correct 77 ms 11856 KB ok, correct split
20 Correct 49 ms 9724 KB ok, correct split
21 Correct 37 ms 10684 KB ok, correct split
22 Correct 37 ms 10692 KB ok, correct split
23 Correct 37 ms 10592 KB ok, correct split
24 Correct 2 ms 3044 KB ok, correct split
25 Correct 47 ms 9560 KB ok, correct split
26 Correct 22 ms 5832 KB ok, correct split
27 Correct 2 ms 3028 KB ok, correct split
28 Correct 60 ms 14644 KB ok, correct split
29 Correct 59 ms 14216 KB ok, correct split
30 Correct 54 ms 13872 KB ok, correct split
31 Correct 56 ms 16508 KB ok, correct split
32 Correct 78 ms 13512 KB ok, correct split
33 Correct 15 ms 5352 KB ok, no valid answer
34 Correct 22 ms 6376 KB ok, no valid answer
35 Correct 40 ms 10436 KB ok, no valid answer
36 Correct 43 ms 9768 KB ok, no valid answer
37 Correct 35 ms 11040 KB ok, no valid answer
38 Correct 2 ms 3028 KB ok, correct split
39 Correct 1 ms 3028 KB ok, no valid answer
40 Correct 2 ms 3028 KB ok, correct split
41 Correct 2 ms 3028 KB ok, correct split
42 Correct 2 ms 3028 KB ok, correct split
43 Correct 2 ms 3028 KB ok, correct split
44 Correct 2 ms 3028 KB ok, correct split
45 Correct 2 ms 3028 KB ok, correct split
46 Correct 3 ms 3444 KB ok, correct split
47 Correct 3 ms 3284 KB ok, correct split
48 Correct 2 ms 3048 KB ok, correct split
49 Correct 3 ms 3284 KB ok, correct split
50 Correct 2 ms 3040 KB ok, correct split
51 Correct 2 ms 3028 KB ok, correct split
52 Correct 2 ms 3028 KB ok, correct split
53 Correct 2 ms 3028 KB ok, correct split
54 Correct 1 ms 3028 KB ok, correct split
55 Correct 2 ms 3044 KB ok, correct split
56 Correct 2 ms 3048 KB ok, correct split
57 Correct 2 ms 3156 KB ok, correct split
58 Correct 3 ms 3284 KB ok, correct split
59 Correct 3 ms 3284 KB ok, correct split
60 Correct 4 ms 3316 KB ok, correct split
61 Correct 3 ms 3284 KB ok, correct split
62 Correct 3 ms 3308 KB ok, correct split
63 Correct 3 ms 3308 KB ok, correct split
64 Correct 3 ms 3284 KB ok, correct split
65 Correct 3 ms 3284 KB ok, correct split
66 Correct 2 ms 3028 KB ok, correct split
67 Correct 4 ms 3248 KB ok, correct split
68 Correct 2 ms 3028 KB ok, correct split
69 Correct 2 ms 3044 KB ok, correct split
70 Correct 2 ms 3028 KB ok, correct split
71 Correct 3 ms 3184 KB ok, correct split
72 Correct 3 ms 3156 KB ok, correct split
73 Correct 2 ms 3156 KB ok, correct split
74 Correct 3 ms 3252 KB ok, correct split
75 Correct 3 ms 3284 KB ok, correct split
76 Correct 3 ms 3284 KB ok, correct split
77 Correct 4 ms 3284 KB ok, correct split
78 Correct 2 ms 3156 KB ok, correct split
79 Correct 2 ms 3184 KB ok, correct split
80 Correct 3 ms 3284 KB ok, correct split
81 Correct 3 ms 3284 KB ok, correct split
82 Correct 3 ms 3284 KB ok, correct split
83 Correct 2 ms 3412 KB ok, correct split
84 Correct 3 ms 3340 KB ok, no valid answer
85 Correct 2 ms 3180 KB ok, correct split
86 Correct 3 ms 3412 KB ok, correct split
87 Correct 2 ms 3040 KB ok, no valid answer
88 Correct 2 ms 3040 KB ok, no valid answer
89 Correct 2 ms 3180 KB ok, no valid answer
90 Correct 3 ms 3308 KB ok, no valid answer
91 Correct 2 ms 3180 KB ok, no valid answer
92 Correct 2 ms 3312 KB ok, no valid answer
93 Correct 3 ms 3228 KB ok, no valid answer
94 Correct 59 ms 17060 KB ok, correct split
95 Correct 90 ms 24704 KB ok, correct split
96 Correct 77 ms 22264 KB ok, correct split
97 Correct 18 ms 6068 KB ok, correct split
98 Correct 21 ms 6128 KB ok, correct split
99 Correct 31 ms 9836 KB ok, correct split
100 Correct 96 ms 14924 KB ok, correct split
101 Correct 75 ms 13556 KB ok, correct split
102 Correct 60 ms 12880 KB ok, correct split
103 Correct 55 ms 12852 KB ok, correct split
104 Correct 59 ms 14388 KB ok, correct split
105 Correct 29 ms 7780 KB ok, correct split
106 Correct 57 ms 14628 KB ok, correct split
107 Correct 45 ms 10524 KB ok, correct split
108 Correct 47 ms 10464 KB ok, correct split
109 Correct 76 ms 13748 KB ok, correct split
110 Correct 72 ms 13548 KB ok, correct split
111 Correct 68 ms 13724 KB ok, correct split
112 Correct 71 ms 13900 KB ok, correct split
113 Correct 68 ms 13896 KB ok, correct split
114 Correct 11 ms 4856 KB ok, correct split
115 Correct 8 ms 4332 KB ok, correct split
116 Correct 74 ms 13540 KB ok, correct split
117 Correct 70 ms 13496 KB ok, correct split
118 Correct 54 ms 10604 KB ok, correct split
119 Correct 46 ms 10504 KB ok, correct split
120 Correct 57 ms 18772 KB ok, correct split
121 Correct 47 ms 10600 KB ok, no valid answer
122 Correct 40 ms 10892 KB ok, no valid answer
123 Correct 70 ms 15192 KB ok, no valid answer
124 Correct 68 ms 14844 KB ok, no valid answer
125 Correct 45 ms 12620 KB ok, no valid answer
126 Correct 30 ms 11208 KB ok, no valid answer
127 Correct 62 ms 12752 KB ok, no valid answer