oj.uz

답안 #774515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
774515 2023-07-05T19:09:45 Z Jarif_Rahman Split the Attractions (IOI19_split) C++17
100 / 100
 97 ms 27300 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

int n, m;
vector<int> s, so;
vector<vector<int>> graph;
vector<vector<int>> dfs_tree;
vector<int> depth, mnd;
vector<bool> visited;
vector<int> sz;

void dfs(int nd, int mom, int d = 0){
    visited[nd] = 1;
    depth[nd] = d, mnd[nd] = d;
    for(int x: graph[nd]) if(x != mom && !visited[x]) dfs(x, nd, d+1), sz[nd]+=sz[x];
    for(int x: graph[nd]) if(visited[x]) mnd[nd] = min(mnd[nd], depth[x]);
    if(mom != -1) dfs_tree[mom].pb(nd);
}

vector<int> ans;
vector<bool> forbidden;
int cnt;
void create_ans(int nd, int id){
    if(cnt == 0) return;
    ans[nd] = id;
    cnt--;
    for(int x: dfs_tree[nd]) if(!forbidden[x]) create_ans(x, id);
}

bool found = 0;
void dfs2(int nd){
    if(found) return;

    int X = sz[nd];
    vector<int> rem;

    if(X < s[0]) goto end_func;
    for(int x: dfs_tree[nd]) if(sz[x] >= s[0]) goto end_func;
    for(int x: dfs_tree[nd]) if(n-X < s[0] && mnd[x] < depth[nd] && X-sz[x] >= s[0]) X-=sz[x], rem.pb(x);
    if(n-X < s[0]) goto end_func;
    
    found = 1;
    if(X >= s[1]){
        ans.assign(n, so[2]);
        int y = s[0];
        for(int x: rem){
            y-=sz[x];
            cnt = sz[x];
            create_ans(x, so[0]);
            forbidden[x] = 1;
        }
        cnt = s[1];
        create_ans(nd, so[1]);
        cnt = y;
        forbidden[nd] = 1;
        create_ans(0, so[0]);
    }
    else{
        ans.assign(n, so[2]);
        int y = s[1];
        for(int x: rem){
            y-=sz[x];
            cnt = sz[x];
            create_ans(x, so[1]);
            forbidden[x] = 1;
        }
        cnt = s[0];
        create_ans(nd, so[0]);
        cnt = y;
        forbidden[nd] = 1;
        create_ans(0, so[1]);
    }
    return;

    end_func:
    for(int x: dfs_tree[nd]) dfs2(x);
}

vector<int> find_split(int _n, int a, int b, int c, vector<int> U, vector<int> V){
    s = {a, b, c}, so = {1, 2, 3};
    sort(so.begin(), so.end(), [&](int i, int j){
        return s[i-1] < s[j-1];
    });
    sort(s.begin(), s.end());

    swap(n, _n);
    m = U.size();

    graph.resize(n);
    dfs_tree.resize(n);
    depth.resize(n);
    mnd.assign(n, n);
    visited.assign(n, 0);
    sz.assign(n, 1);
    forbidden.assign(n, 0);
    for(int i = 0; i < m; i++){
        graph[U[i]].pb(V[i]);
        graph[V[i]].pb(U[i]);
    }

    dfs(0, -1);
    dfs2(0);

    if(found) return ans;
    else return vector<int>(n, 0);
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 1 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 0 ms 212 KB ok, correct split
7 Correct 64 ms 23996 KB ok, correct split
8 Correct 81 ms 19956 KB ok, correct split
9 Correct 59 ms 22072 KB ok, correct split
10 Correct 66 ms 27300 KB ok, correct split
11 Correct 64 ms 24672 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 79 ms 18468 KB ok, correct split
5 Correct 49 ms 13392 KB ok, correct split
6 Correct 66 ms 27212 KB ok, correct split
7 Correct 62 ms 25048 KB ok, correct split
8 Correct 70 ms 16008 KB ok, correct split
9 Correct 51 ms 14932 KB ok, correct split
10 Correct 45 ms 12520 KB ok, correct split
11 Correct 37 ms 12488 KB ok, correct split
12 Correct 35 ms 12488 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 65 ms 13376 KB ok, correct split
3 Correct 17 ms 5460 KB ok, correct split
4 Correct 1 ms 212 KB ok, correct split
5 Correct 58 ms 17352 KB ok, correct split
6 Correct 54 ms 17100 KB ok, correct split
7 Correct 58 ms 16972 KB ok, correct split
8 Correct 58 ms 18764 KB ok, correct split
9 Correct 53 ms 17468 KB ok, correct split
10 Correct 14 ms 4436 KB ok, no valid answer
11 Correct 26 ms 6612 KB ok, no valid answer
12 Correct 43 ms 12456 KB ok, no valid answer
13 Correct 48 ms 12864 KB ok, no valid answer
14 Correct 35 ms 12204 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, no valid answer
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 1 ms 212 KB ok, correct split
7 Correct 0 ms 212 KB ok, correct split
8 Correct 1 ms 212 KB ok, correct split
9 Correct 2 ms 724 KB ok, correct split
10 Correct 2 ms 596 KB ok, correct split
11 Correct 1 ms 212 KB ok, correct split
12 Correct 2 ms 596 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Correct 0 ms 212 KB ok, correct split
15 Correct 0 ms 212 KB ok, correct split
16 Correct 0 ms 212 KB ok, correct split
17 Correct 0 ms 212 KB ok, correct split
18 Correct 0 ms 212 KB ok, correct split
19 Correct 1 ms 340 KB ok, correct split
20 Correct 1 ms 468 KB ok, correct split
21 Correct 1 ms 724 KB ok, correct split
22 Correct 1 ms 596 KB ok, correct split
23 Correct 1 ms 724 KB ok, correct split
24 Correct 1 ms 724 KB ok, correct split
25 Correct 1 ms 596 KB ok, correct split
26 Correct 2 ms 648 KB ok, correct split
27 Correct 2 ms 596 KB ok, correct split
28 Correct 2 ms 568 KB ok, correct split
29 Correct 1 ms 340 KB ok, correct split
30 Correct 2 ms 596 KB ok, correct split
31 Correct 1 ms 340 KB ok, correct split
32 Correct 1 ms 340 KB ok, correct split
33 Correct 1 ms 340 KB ok, correct split
34 Correct 2 ms 568 KB ok, correct split
35 Correct 2 ms 564 KB ok, correct split
36 Correct 1 ms 568 KB ok, correct split
37 Correct 2 ms 764 KB ok, correct split
38 Correct 2 ms 724 KB ok, correct split
39 Correct 2 ms 724 KB ok, correct split
40 Correct 2 ms 596 KB ok, correct split
41 Correct 1 ms 468 KB ok, correct split
42 Correct 1 ms 436 KB ok, correct split
43 Correct 2 ms 700 KB ok, correct split
44 Correct 2 ms 724 KB ok, correct split
45 Correct 2 ms 636 KB ok, correct split
46 Correct 2 ms 724 KB ok, correct split
47 Correct 1 ms 724 KB ok, no valid answer
48 Correct 1 ms 596 KB ok, correct split
49 Correct 1 ms 724 KB ok, correct split
50 Correct 1 ms 300 KB ok, no valid answer
51 Correct 0 ms 212 KB ok, no valid answer
52 Correct 1 ms 596 KB ok, no valid answer
53 Correct 2 ms 724 KB ok, no valid answer
54 Correct 1 ms 596 KB ok, no valid answer
55 Correct 2 ms 596 KB ok, no valid answer
56 Correct 2 ms 572 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 1 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 0 ms 212 KB ok, correct split
7 Correct 64 ms 23996 KB ok, correct split
8 Correct 81 ms 19956 KB ok, correct split
9 Correct 59 ms 22072 KB ok, correct split
10 Correct 66 ms 27300 KB ok, correct split
11 Correct 64 ms 24672 KB ok, correct split
12 Correct 0 ms 212 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Correct 0 ms 212 KB ok, correct split
15 Correct 79 ms 18468 KB ok, correct split
16 Correct 49 ms 13392 KB ok, correct split
17 Correct 66 ms 27212 KB ok, correct split
18 Correct 62 ms 25048 KB ok, correct split
19 Correct 70 ms 16008 KB ok, correct split
20 Correct 51 ms 14932 KB ok, correct split
21 Correct 45 ms 12520 KB ok, correct split
22 Correct 37 ms 12488 KB ok, correct split
23 Correct 35 ms 12488 KB ok, correct split
24 Correct 0 ms 212 KB ok, correct split
25 Correct 65 ms 13376 KB ok, correct split
26 Correct 17 ms 5460 KB ok, correct split
27 Correct 1 ms 212 KB ok, correct split
28 Correct 58 ms 17352 KB ok, correct split
29 Correct 54 ms 17100 KB ok, correct split
30 Correct 58 ms 16972 KB ok, correct split
31 Correct 58 ms 18764 KB ok, correct split
32 Correct 53 ms 17468 KB ok, correct split
33 Correct 14 ms 4436 KB ok, no valid answer
34 Correct 26 ms 6612 KB ok, no valid answer
35 Correct 43 ms 12456 KB ok, no valid answer
36 Correct 48 ms 12864 KB ok, no valid answer
37 Correct 35 ms 12204 KB ok, no valid answer
38 Correct 0 ms 212 KB ok, correct split
39 Correct 0 ms 212 KB ok, no valid answer
40 Correct 0 ms 212 KB ok, correct split
41 Correct 0 ms 212 KB ok, correct split
42 Correct 0 ms 212 KB ok, correct split
43 Correct 1 ms 212 KB ok, correct split
44 Correct 0 ms 212 KB ok, correct split
45 Correct 1 ms 212 KB ok, correct split
46 Correct 2 ms 724 KB ok, correct split
47 Correct 2 ms 596 KB ok, correct split
48 Correct 1 ms 212 KB ok, correct split
49 Correct 2 ms 596 KB ok, correct split
50 Correct 0 ms 212 KB ok, correct split
51 Correct 0 ms 212 KB ok, correct split
52 Correct 0 ms 212 KB ok, correct split
53 Correct 0 ms 212 KB ok, correct split
54 Correct 0 ms 212 KB ok, correct split
55 Correct 0 ms 212 KB ok, correct split
56 Correct 1 ms 340 KB ok, correct split
57 Correct 1 ms 468 KB ok, correct split
58 Correct 1 ms 724 KB ok, correct split
59 Correct 1 ms 596 KB ok, correct split
60 Correct 1 ms 724 KB ok, correct split
61 Correct 1 ms 724 KB ok, correct split
62 Correct 1 ms 596 KB ok, correct split
63 Correct 2 ms 648 KB ok, correct split
64 Correct 2 ms 596 KB ok, correct split
65 Correct 2 ms 568 KB ok, correct split
66 Correct 1 ms 340 KB ok, correct split
67 Correct 2 ms 596 KB ok, correct split
68 Correct 1 ms 340 KB ok, correct split
69 Correct 1 ms 340 KB ok, correct split
70 Correct 1 ms 340 KB ok, correct split
71 Correct 2 ms 568 KB ok, correct split
72 Correct 2 ms 564 KB ok, correct split
73 Correct 1 ms 568 KB ok, correct split
74 Correct 2 ms 764 KB ok, correct split
75 Correct 2 ms 724 KB ok, correct split
76 Correct 2 ms 724 KB ok, correct split
77 Correct 2 ms 596 KB ok, correct split
78 Correct 1 ms 468 KB ok, correct split
79 Correct 1 ms 436 KB ok, correct split
80 Correct 2 ms 700 KB ok, correct split
81 Correct 2 ms 724 KB ok, correct split
82 Correct 2 ms 636 KB ok, correct split
83 Correct 2 ms 724 KB ok, correct split
84 Correct 1 ms 724 KB ok, no valid answer
85 Correct 1 ms 596 KB ok, correct split
86 Correct 1 ms 724 KB ok, correct split
87 Correct 1 ms 300 KB ok, no valid answer
88 Correct 0 ms 212 KB ok, no valid answer
89 Correct 1 ms 596 KB ok, no valid answer
90 Correct 2 ms 724 KB ok, no valid answer
91 Correct 1 ms 596 KB ok, no valid answer
92 Correct 2 ms 596 KB ok, no valid answer
93 Correct 2 ms 572 KB ok, no valid answer
94 Correct 86 ms 19908 KB ok, correct split
95 Correct 97 ms 26412 KB ok, correct split
96 Correct 75 ms 24360 KB ok, correct split
97 Correct 17 ms 6096 KB ok, correct split
98 Correct 18 ms 6228 KB ok, correct split
99 Correct 30 ms 8240 KB ok, correct split
100 Correct 77 ms 18896 KB ok, correct split
101 Correct 64 ms 17752 KB ok, correct split
102 Correct 72 ms 17024 KB ok, correct split
103 Correct 57 ms 16644 KB ok, correct split
104 Correct 55 ms 16952 KB ok, correct split
105 Correct 28 ms 9012 KB ok, correct split
106 Correct 57 ms 16752 KB ok, correct split
107 Correct 55 ms 14548 KB ok, correct split
108 Correct 51 ms 14512 KB ok, correct split
109 Correct 73 ms 18200 KB ok, correct split
110 Correct 69 ms 19056 KB ok, correct split
111 Correct 93 ms 19060 KB ok, correct split
112 Correct 67 ms 17728 KB ok, correct split
113 Correct 65 ms 17720 KB ok, correct split
114 Correct 11 ms 2644 KB ok, correct split
115 Correct 7 ms 2188 KB ok, correct split
116 Correct 85 ms 19036 KB ok, correct split
117 Correct 87 ms 18968 KB ok, correct split
118 Correct 51 ms 16048 KB ok, correct split
119 Correct 50 ms 15944 KB ok, correct split
120 Correct 55 ms 20044 KB ok, correct split
121 Correct 52 ms 14092 KB ok, no valid answer
122 Correct 57 ms 14024 KB ok, no valid answer
123 Correct 77 ms 18896 KB ok, no valid answer
124 Correct 75 ms 18620 KB ok, no valid answer
125 Correct 45 ms 14856 KB ok, no valid answer
126 Correct 31 ms 11972 KB ok, no valid answer
127 Correct 51 ms 15868 KB ok, no valid answer