oj.uz

답안 #893482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893482 2023-12-27T05:44:11 Z Ghulam_Junaid Split the Attractions (IOI19_split) C++17
100 / 100
 77 ms 26320 KB 
#include <bits/stdc++.h>
// #include "grader.cpp"
using namespace std;

const int N = 1e5 + 10;

int n, m, sz[3], tmp[3], subsz[N], h[N], mnh[N], A, B, par[N], which[N];
bool vis[N], done, impossible;
vector<int> g[N], ans;

void color(int v, int col){
    // cout << "coloring " << v << " with color = " << col << ", remaining of this color are " << tmp[col - 1] << " and ans[v] = " << ans[v] << endl; 
    if (tmp[col - 1] == 0) return;
    if (ans[v]) return;

    tmp[col - 1]--;
    ans[v] = col;

    for (int u : g[v])
        if (h[u] == h[v] + 1)
            color(u, col);
}

void color_all(int v, int col){
    if (tmp[col - 1] == 0) return;
    if (ans[v]) return;

    tmp[col - 1]--;
    ans[v] = col;

    for (int u : g[v])
        color_all(u, col);
}

void pre_dfs(int v, int p = -1){
    vis[v] = 1;
    mnh[v] = h[v];
    subsz[v] = 1;

    for (int u : g[v]){
        if (u == p) continue;
        
        if (vis[u]){ // back edge
            if (mnh[v] > h[u])
                which[v] = v;
            mnh[v] = min(mnh[v], h[u]);
            continue;
        }

        // child of u.
        h[u] = h[v] + 1;
        par[u] = v;
        pre_dfs(u, v);
        mnh[v] = min(mnh[v], mnh[u]);

        subsz[v] += subsz[u];
    }
}

void dfs(int v, int p = -1){
    vis[v] = 1;
    
    bool bad = 0;
    for (int u : g[v]){
        if (u == p) continue;
        
        if (vis[u])
            continue;

        // child of u.
        dfs(u, v);
        if (done) return;

        bad |= (subsz[u] >= sz[0]);
    }

    bad |= (subsz[v] < sz[0]);
    if (bad) return;
    
    // subsz[v] >= a and subsz[child(v)] < a.
    int forced = 1; // v is itself forced.
    vector<int> free, not_free;
    for (int u : g[v]){
        if (h[u] != h[v] + 1) continue;
        if (mnh[u] >= h[v]){
            forced += subsz[u];
            not_free.push_back(u);
        }
        else free.push_back(u);
    }

    while (forced < sz[0]){
        int u = free.back();
        free.pop_back();

        forced += subsz[u];
        not_free.push_back(u);
    }

    // cout << "AT v = " << v << endl;

    if (n - forced >= sz[1]){
        ans[v] = A;
        tmp[A - 1]--;
        for (int u : not_free)
            color(u, A);

        color_all(0, B);
    }
    else if (n - forced >= sz[0]){
        ans[v] = B;
        tmp[B - 1]--;
        for(int u : not_free)
            color(u, B);

        color_all(0, A);
    }
    else
        impossible = 1;

    done = 1;
}

vector<int> find_split(int N, int a, int b, int c, vector<int> p, vector<int> q){
    tmp[0] = a, tmp[1] = b, tmp[2] = c;
    sz[0] = a, sz[1] = b, sz[2] = c;
    sort(sz, sz + 3);

    if (sz[0] == a and sz[1] == b){
        A = 1;
        B = 2;
    }
    else if (sz[0] == a and sz[1] == c){
        A = 1;
        B = 3;
    }
    else if (sz[0] == b and sz[1] == a){
        A = 2;
        B = 1;
    }
    else if (sz[0] == b and sz[1] == c){
        A = 2;
        B = 3;
    }
    else if (sz[0] == c and sz[1] == a){
        A = 3;
        B = 1;
    }
    else{
        A = 3;
        B = 2;
    }

    // cout << A << " -- " << B << endl;

    n = N;
    m = p.size();

    for (int i=0; i<m; i++){
        g[p[i]].push_back(q[i]);
        g[q[i]].push_back(p[i]);
    }

    ans.resize(n, 0);

    pre_dfs(0);
    memset(vis, 0, sizeof vis);
    dfs(0);

    if (impossible) return ans;
    for (int v = 0; v < n; v ++)
        if (!ans[v]) ans[v] = 6 - (A + B);

    return ans;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB ok, correct split
2 Correct 1 ms 4696 KB ok, correct split
3 Correct 1 ms 4700 KB ok, correct split
4 Correct 1 ms 4700 KB ok, correct split
5 Correct 1 ms 4700 KB ok, correct split
6 Correct 1 ms 4700 KB ok, correct split
7 Correct 54 ms 24956 KB ok, correct split
8 Correct 44 ms 15332 KB ok, correct split
9 Correct 47 ms 18260 KB ok, correct split
10 Correct 51 ms 25940 KB ok, correct split
11 Correct 54 ms 25936 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB ok, correct split
2 Correct 1 ms 4700 KB ok, correct split
3 Correct 1 ms 4700 KB ok, correct split
4 Correct 50 ms 15192 KB ok, correct split
5 Correct 35 ms 10328 KB ok, correct split
6 Correct 55 ms 26320 KB ok, correct split
7 Correct 50 ms 21844 KB ok, correct split
8 Correct 57 ms 12520 KB ok, correct split
9 Correct 40 ms 10368 KB ok, correct split
10 Correct 30 ms 10708 KB ok, correct split
11 Correct 31 ms 10704 KB ok, correct split
12 Correct 30 ms 10708 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4700 KB ok, correct split
2 Correct 39 ms 10236 KB ok, correct split
3 Correct 14 ms 6836 KB ok, correct split
4 Correct 1 ms 4700 KB ok, correct split
5 Correct 46 ms 15492 KB ok, correct split
6 Correct 41 ms 14928 KB ok, correct split
7 Correct 43 ms 14416 KB ok, correct split
8 Correct 46 ms 17324 KB ok, correct split
9 Correct 44 ms 14164 KB ok, correct split
10 Correct 13 ms 6492 KB ok, no valid answer
11 Correct 18 ms 7516 KB ok, no valid answer
12 Correct 41 ms 10976 KB ok, no valid answer
13 Correct 36 ms 10344 KB ok, no valid answer
14 Correct 31 ms 10952 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB ok, correct split
2 Correct 1 ms 4700 KB ok, no valid answer
3 Correct 1 ms 4700 KB ok, correct split
4 Correct 1 ms 4696 KB ok, correct split
5 Correct 1 ms 4952 KB ok, correct split
6 Correct 1 ms 4700 KB ok, correct split
7 Correct 1 ms 4700 KB ok, correct split
8 Correct 1 ms 4696 KB ok, correct split
9 Correct 2 ms 4956 KB ok, correct split
10 Correct 2 ms 4700 KB ok, correct split
11 Correct 1 ms 4700 KB ok, correct split
12 Correct 2 ms 4952 KB ok, correct split
13 Correct 1 ms 4700 KB ok, correct split
14 Correct 1 ms 4696 KB ok, correct split
15 Correct 1 ms 4952 KB ok, correct split
16 Correct 1 ms 4700 KB ok, correct split
17 Correct 1 ms 4700 KB ok, correct split
18 Correct 1 ms 4700 KB ok, correct split
19 Correct 1 ms 4700 KB ok, correct split
20 Correct 2 ms 4700 KB ok, correct split
21 Correct 2 ms 4956 KB ok, correct split
22 Correct 2 ms 4700 KB ok, correct split
23 Correct 2 ms 4956 KB ok, correct split
24 Correct 2 ms 4952 KB ok, correct split
25 Correct 2 ms 4956 KB ok, correct split
26 Correct 2 ms 4700 KB ok, correct split
27 Correct 2 ms 4700 KB ok, correct split
28 Correct 2 ms 4760 KB ok, correct split
29 Correct 1 ms 4700 KB ok, correct split
30 Correct 2 ms 4700 KB ok, correct split
31 Correct 1 ms 4696 KB ok, correct split
32 Correct 1 ms 4696 KB ok, correct split
33 Correct 1 ms 4700 KB ok, correct split
34 Correct 2 ms 4700 KB ok, correct split
35 Correct 2 ms 4700 KB ok, correct split
36 Correct 2 ms 4700 KB ok, correct split
37 Correct 2 ms 4952 KB ok, correct split
38 Correct 2 ms 4956 KB ok, correct split
39 Correct 3 ms 4924 KB ok, correct split
40 Correct 2 ms 4700 KB ok, correct split
41 Correct 2 ms 4700 KB ok, correct split
42 Correct 2 ms 4700 KB ok, correct split
43 Correct 2 ms 4700 KB ok, correct split
44 Correct 2 ms 4700 KB ok, correct split
45 Correct 2 ms 4956 KB ok, correct split
46 Correct 2 ms 4956 KB ok, correct split
47 Correct 2 ms 4956 KB ok, no valid answer
48 Correct 2 ms 4700 KB ok, correct split
49 Correct 2 ms 4956 KB ok, correct split
50 Correct 1 ms 4700 KB ok, no valid answer
51 Correct 1 ms 4700 KB ok, no valid answer
52 Correct 2 ms 4700 KB ok, no valid answer
53 Correct 2 ms 4956 KB ok, no valid answer
54 Correct 2 ms 4764 KB ok, no valid answer
55 Correct 2 ms 4696 KB ok, no valid answer
56 Correct 2 ms 4700 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB ok, correct split
2 Correct 1 ms 4696 KB ok, correct split
3 Correct 1 ms 4700 KB ok, correct split
4 Correct 1 ms 4700 KB ok, correct split
5 Correct 1 ms 4700 KB ok, correct split
6 Correct 1 ms 4700 KB ok, correct split
7 Correct 54 ms 24956 KB ok, correct split
8 Correct 44 ms 15332 KB ok, correct split
9 Correct 47 ms 18260 KB ok, correct split
10 Correct 51 ms 25940 KB ok, correct split
11 Correct 54 ms 25936 KB ok, correct split
12 Correct 1 ms 4696 KB ok, correct split
13 Correct 1 ms 4700 KB ok, correct split
14 Correct 1 ms 4700 KB ok, correct split
15 Correct 50 ms 15192 KB ok, correct split
16 Correct 35 ms 10328 KB ok, correct split
17 Correct 55 ms 26320 KB ok, correct split
18 Correct 50 ms 21844 KB ok, correct split
19 Correct 57 ms 12520 KB ok, correct split
20 Correct 40 ms 10368 KB ok, correct split
21 Correct 30 ms 10708 KB ok, correct split
22 Correct 31 ms 10704 KB ok, correct split
23 Correct 30 ms 10708 KB ok, correct split
24 Correct 1 ms 4700 KB ok, correct split
25 Correct 39 ms 10236 KB ok, correct split
26 Correct 14 ms 6836 KB ok, correct split
27 Correct 1 ms 4700 KB ok, correct split
28 Correct 46 ms 15492 KB ok, correct split
29 Correct 41 ms 14928 KB ok, correct split
30 Correct 43 ms 14416 KB ok, correct split
31 Correct 46 ms 17324 KB ok, correct split
32 Correct 44 ms 14164 KB ok, correct split
33 Correct 13 ms 6492 KB ok, no valid answer
34 Correct 18 ms 7516 KB ok, no valid answer
35 Correct 41 ms 10976 KB ok, no valid answer
36 Correct 36 ms 10344 KB ok, no valid answer
37 Correct 31 ms 10952 KB ok, no valid answer
38 Correct 1 ms 4696 KB ok, correct split
39 Correct 1 ms 4700 KB ok, no valid answer
40 Correct 1 ms 4700 KB ok, correct split
41 Correct 1 ms 4696 KB ok, correct split
42 Correct 1 ms 4952 KB ok, correct split
43 Correct 1 ms 4700 KB ok, correct split
44 Correct 1 ms 4700 KB ok, correct split
45 Correct 1 ms 4696 KB ok, correct split
46 Correct 2 ms 4956 KB ok, correct split
47 Correct 2 ms 4700 KB ok, correct split
48 Correct 1 ms 4700 KB ok, correct split
49 Correct 2 ms 4952 KB ok, correct split
50 Correct 1 ms 4700 KB ok, correct split
51 Correct 1 ms 4696 KB ok, correct split
52 Correct 1 ms 4952 KB ok, correct split
53 Correct 1 ms 4700 KB ok, correct split
54 Correct 1 ms 4700 KB ok, correct split
55 Correct 1 ms 4700 KB ok, correct split
56 Correct 1 ms 4700 KB ok, correct split
57 Correct 2 ms 4700 KB ok, correct split
58 Correct 2 ms 4956 KB ok, correct split
59 Correct 2 ms 4700 KB ok, correct split
60 Correct 2 ms 4956 KB ok, correct split
61 Correct 2 ms 4952 KB ok, correct split
62 Correct 2 ms 4956 KB ok, correct split
63 Correct 2 ms 4700 KB ok, correct split
64 Correct 2 ms 4700 KB ok, correct split
65 Correct 2 ms 4760 KB ok, correct split
66 Correct 1 ms 4700 KB ok, correct split
67 Correct 2 ms 4700 KB ok, correct split
68 Correct 1 ms 4696 KB ok, correct split
69 Correct 1 ms 4696 KB ok, correct split
70 Correct 1 ms 4700 KB ok, correct split
71 Correct 2 ms 4700 KB ok, correct split
72 Correct 2 ms 4700 KB ok, correct split
73 Correct 2 ms 4700 KB ok, correct split
74 Correct 2 ms 4952 KB ok, correct split
75 Correct 2 ms 4956 KB ok, correct split
76 Correct 3 ms 4924 KB ok, correct split
77 Correct 2 ms 4700 KB ok, correct split
78 Correct 2 ms 4700 KB ok, correct split
79 Correct 2 ms 4700 KB ok, correct split
80 Correct 2 ms 4700 KB ok, correct split
81 Correct 2 ms 4700 KB ok, correct split
82 Correct 2 ms 4956 KB ok, correct split
83 Correct 2 ms 4956 KB ok, correct split
84 Correct 2 ms 4956 KB ok, no valid answer
85 Correct 2 ms 4700 KB ok, correct split
86 Correct 2 ms 4956 KB ok, correct split
87 Correct 1 ms 4700 KB ok, no valid answer
88 Correct 1 ms 4700 KB ok, no valid answer
89 Correct 2 ms 4700 KB ok, no valid answer
90 Correct 2 ms 4956 KB ok, no valid answer
91 Correct 2 ms 4764 KB ok, no valid answer
92 Correct 2 ms 4696 KB ok, no valid answer
93 Correct 2 ms 4700 KB ok, no valid answer
94 Correct 51 ms 17128 KB ok, correct split
95 Correct 77 ms 24404 KB ok, correct split
96 Correct 69 ms 22096 KB ok, correct split
97 Correct 15 ms 7260 KB ok, correct split
98 Correct 16 ms 7516 KB ok, correct split
99 Correct 29 ms 11248 KB ok, correct split
100 Correct 60 ms 15756 KB ok, correct split
101 Correct 53 ms 14360 KB ok, correct split
102 Correct 55 ms 13524 KB ok, correct split
103 Correct 47 ms 13444 KB ok, correct split
104 Correct 50 ms 15040 KB ok, correct split
105 Correct 30 ms 8792 KB ok, correct split
106 Correct 52 ms 15284 KB ok, correct split
107 Correct 39 ms 11600 KB ok, correct split
108 Correct 47 ms 11348 KB ok, correct split
109 Correct 67 ms 14720 KB ok, correct split
110 Correct 64 ms 14540 KB ok, correct split
111 Correct 63 ms 14708 KB ok, correct split
112 Correct 63 ms 14676 KB ok, correct split
113 Correct 61 ms 14796 KB ok, correct split
114 Correct 7 ms 6236 KB ok, correct split
115 Correct 7 ms 5980 KB ok, correct split
116 Correct 59 ms 14528 KB ok, correct split
117 Correct 61 ms 14392 KB ok, correct split
118 Correct 41 ms 11664 KB ok, correct split
119 Correct 42 ms 11604 KB ok, correct split
120 Correct 46 ms 19796 KB ok, correct split
121 Correct 39 ms 11472 KB ok, no valid answer
122 Correct 36 ms 11520 KB ok, no valid answer
123 Correct 68 ms 16208 KB ok, no valid answer
124 Correct 65 ms 15696 KB ok, no valid answer
125 Correct 41 ms 13012 KB ok, no valid answer
126 Correct 28 ms 11468 KB ok, no valid answer
127 Correct 46 ms 13316 KB ok, no valid answer