oj.uz

Submission #893439

# Submission time Handle Problem Language Result Execution time Memory
893439 2023-12-27T04:54:05 Z Ghulam_Junaid Split the Attractions (IOI19_split) C++17
40 / 100
 67 ms 22356 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];
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 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
            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;
    for (int u : g[v]){
        if (h[u] != h[v] + 1) continue;
        if (mnh[u] >= h[v])
            forced += subsz[u];
        else free.push_back(u);
    }

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

        forced += subsz[u];
    }

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

    if (n - forced >= sz[1]){
        int cur = v;
        while (cur != 0 && tmp[B - 1] > 0){
            cur = par[cur];
            ans[cur] = B;
            tmp[B - 1]--;
        }

        for (int u : free)
            color(u, B);
        
        color(v, A);
        for (int u = 0; u < n; u++){
            if (ans[u] == B)
                for (int x : g[u])
                    color(x, B);
        }
    }
    else if (n - forced >= sz[0]){
        int cur = v;
        while (cur != 0 && tmp[A - 1] > 0){
            cur = par[cur];
            ans[cur] = A;
            tmp[A - 1]--;
        }
        for (int u : free)
            color(u, A);
        color(v, B);
        for (int u = 0; u < n; u++)
            if (ans[u] == A)
                for (int x : g[u])
                    color(x, 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB ok, correct split
2 Correct 1 ms 2652 KB ok, correct split
3 Correct 1 ms 2652 KB ok, correct split
4 Correct 1 ms 2652 KB ok, correct split
5 Correct 1 ms 2908 KB ok, correct split
6 Correct 1 ms 2908 KB ok, correct split
7 Correct 54 ms 21688 KB ok, correct split
8 Correct 52 ms 15188 KB ok, correct split
9 Correct 48 ms 15452 KB ok, correct split
10 Correct 56 ms 22340 KB ok, correct split
11 Correct 57 ms 22356 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB ok, correct split
2 Correct 1 ms 2652 KB ok, correct split
3 Correct 1 ms 2652 KB ok, correct split
4 Correct 53 ms 14420 KB ok, correct split
5 Correct 39 ms 9820 KB ok, correct split
6 Correct 51 ms 22352 KB ok, correct split
7 Correct 51 ms 17748 KB ok, correct split
8 Correct 62 ms 12116 KB ok, correct split
9 Correct 40 ms 9980 KB ok, correct split
10 Correct 32 ms 10192 KB ok, correct split
11 Correct 32 ms 10184 KB ok, correct split
12 Correct 37 ms 10192 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB ok, correct split
2 Correct 41 ms 9988 KB ok, correct split
3 Correct 15 ms 5724 KB ok, correct split
4 Correct 1 ms 2652 KB ok, correct split
5 Correct 48 ms 13916 KB ok, correct split
6 Correct 43 ms 13652 KB ok, correct split
7 Correct 67 ms 13472 KB ok, correct split
8 Correct 48 ms 15444 KB ok, correct split
9 Correct 48 ms 12880 KB ok, correct split
10 Correct 16 ms 5212 KB ok, no valid answer
11 Correct 19 ms 6232 KB ok, no valid answer
12 Correct 37 ms 10116 KB ok, no valid answer
13 Correct 38 ms 10076 KB ok, no valid answer
14 Correct 50 ms 10196 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB ok, correct split
2 Correct 1 ms 2648 KB ok, no valid answer
3 Correct 1 ms 2652 KB ok, correct split
4 Correct 2 ms 2648 KB ok, correct split
5 Correct 2 ms 2648 KB ok, correct split
6 Correct 1 ms 2652 KB ok, correct split
7 Correct 1 ms 2652 KB ok, correct split
8 Correct 1 ms 2652 KB ok, correct split
9 Correct 2 ms 3060 KB ok, correct split
10 Correct 2 ms 3160 KB ok, correct split
11 Correct 1 ms 2908 KB ok, correct split
12 Correct 2 ms 3164 KB ok, correct split
13 Correct 1 ms 2652 KB ok, correct split
14 Correct 1 ms 2792 KB ok, correct split
15 Correct 1 ms 2652 KB ok, correct split
16 Correct 1 ms 2908 KB ok, correct split
17 Correct 1 ms 2652 KB ok, correct split
18 Correct 1 ms 2908 KB ok, correct split
19 Correct 1 ms 2908 KB ok, correct split
20 Correct 1 ms 2908 KB ok, correct split
21 Correct 2 ms 3164 KB ok, correct split
22 Correct 2 ms 3164 KB ok, correct split
23 Correct 2 ms 3060 KB ok, correct split
24 Correct 2 ms 3080 KB ok, correct split
25 Correct 2 ms 3076 KB ok, correct split
26 Correct 2 ms 3172 KB ok, correct split
27 Correct 2 ms 3168 KB ok, correct split
28 Correct 3 ms 3164 KB ok, correct split
29 Correct 1 ms 2788 KB ok, correct split
30 Correct 2 ms 3160 KB ok, correct split
31 Correct 2 ms 2816 KB ok, correct split
32 Correct 1 ms 2920 KB ok, correct split
33 Correct 1 ms 2808 KB ok, correct split
34 Correct 2 ms 2920 KB ok, correct split
35 Correct 2 ms 2920 KB ok, correct split
36 Correct 2 ms 2920 KB ok, correct split
37 Correct 2 ms 3176 KB ok, correct split
38 Correct 2 ms 3072 KB ok, correct split
39 Correct 3 ms 3176 KB ok, correct split
40 Correct 3 ms 3176 KB ok, correct split
41 Correct 1 ms 2920 KB ok, correct split
42 Correct 1 ms 2920 KB ok, correct split
43 Correct 3 ms 3000 KB ok, correct split
44 Incorrect 2 ms 3176 KB 2 components are not connected
45 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB ok, correct split
2 Correct 1 ms 2652 KB ok, correct split
3 Correct 1 ms 2652 KB ok, correct split
4 Correct 1 ms 2652 KB ok, correct split
5 Correct 1 ms 2908 KB ok, correct split
6 Correct 1 ms 2908 KB ok, correct split
7 Correct 54 ms 21688 KB ok, correct split
8 Correct 52 ms 15188 KB ok, correct split
9 Correct 48 ms 15452 KB ok, correct split
10 Correct 56 ms 22340 KB ok, correct split
11 Correct 57 ms 22356 KB ok, correct split
12 Correct 1 ms 2648 KB ok, correct split
13 Correct 1 ms 2652 KB ok, correct split
14 Correct 1 ms 2652 KB ok, correct split
15 Correct 53 ms 14420 KB ok, correct split
16 Correct 39 ms 9820 KB ok, correct split
17 Correct 51 ms 22352 KB ok, correct split
18 Correct 51 ms 17748 KB ok, correct split
19 Correct 62 ms 12116 KB ok, correct split
20 Correct 40 ms 9980 KB ok, correct split
21 Correct 32 ms 10192 KB ok, correct split
22 Correct 32 ms 10184 KB ok, correct split
23 Correct 37 ms 10192 KB ok, correct split
24 Correct 1 ms 2652 KB ok, correct split
25 Correct 41 ms 9988 KB ok, correct split
26 Correct 15 ms 5724 KB ok, correct split
27 Correct 1 ms 2652 KB ok, correct split
28 Correct 48 ms 13916 KB ok, correct split
29 Correct 43 ms 13652 KB ok, correct split
30 Correct 67 ms 13472 KB ok, correct split
31 Correct 48 ms 15444 KB ok, correct split
32 Correct 48 ms 12880 KB ok, correct split
33 Correct 16 ms 5212 KB ok, no valid answer
34 Correct 19 ms 6232 KB ok, no valid answer
35 Correct 37 ms 10116 KB ok, no valid answer
36 Correct 38 ms 10076 KB ok, no valid answer
37 Correct 50 ms 10196 KB ok, no valid answer
38 Correct 1 ms 2652 KB ok, correct split
39 Correct 1 ms 2648 KB ok, no valid answer
40 Correct 1 ms 2652 KB ok, correct split
41 Correct 2 ms 2648 KB ok, correct split
42 Correct 2 ms 2648 KB ok, correct split
43 Correct 1 ms 2652 KB ok, correct split
44 Correct 1 ms 2652 KB ok, correct split
45 Correct 1 ms 2652 KB ok, correct split
46 Correct 2 ms 3060 KB ok, correct split
47 Correct 2 ms 3160 KB ok, correct split
48 Correct 1 ms 2908 KB ok, correct split
49 Correct 2 ms 3164 KB ok, correct split
50 Correct 1 ms 2652 KB ok, correct split
51 Correct 1 ms 2792 KB ok, correct split
52 Correct 1 ms 2652 KB ok, correct split
53 Correct 1 ms 2908 KB ok, correct split
54 Correct 1 ms 2652 KB ok, correct split
55 Correct 1 ms 2908 KB ok, correct split
56 Correct 1 ms 2908 KB ok, correct split
57 Correct 1 ms 2908 KB ok, correct split
58 Correct 2 ms 3164 KB ok, correct split
59 Correct 2 ms 3164 KB ok, correct split
60 Correct 2 ms 3060 KB ok, correct split
61 Correct 2 ms 3080 KB ok, correct split
62 Correct 2 ms 3076 KB ok, correct split
63 Correct 2 ms 3172 KB ok, correct split
64 Correct 2 ms 3168 KB ok, correct split
65 Correct 3 ms 3164 KB ok, correct split
66 Correct 1 ms 2788 KB ok, correct split
67 Correct 2 ms 3160 KB ok, correct split
68 Correct 2 ms 2816 KB ok, correct split
69 Correct 1 ms 2920 KB ok, correct split
70 Correct 1 ms 2808 KB ok, correct split
71 Correct 2 ms 2920 KB ok, correct split
72 Correct 2 ms 2920 KB ok, correct split
73 Correct 2 ms 2920 KB ok, correct split
74 Correct 2 ms 3176 KB ok, correct split
75 Correct 2 ms 3072 KB ok, correct split
76 Correct 3 ms 3176 KB ok, correct split
77 Correct 3 ms 3176 KB ok, correct split
78 Correct 1 ms 2920 KB ok, correct split
79 Correct 1 ms 2920 KB ok, correct split
80 Correct 3 ms 3000 KB ok, correct split
81 Incorrect 2 ms 3176 KB 2 components are not connected
82 Halted 0 ms 0 KB -