oj.uz

Submission #618019

# Submission time Handle Problem Language Result Execution time Memory
618019 2022-08-01T19:15:48 Z Richem Split the Attractions (IOI19_split) C++14
100 / 100
 149 ms 24260 KB 
#include "split.h"
#include <iostream>
#include <vector>

using namespace std;

const int MAX_SOMMET = 1e5+42;

vector<int> adj[MAX_SOMMET];

int iEnsemble[3] = {1, 2, 3};
int tEnsemble[3];

int nbSommet, nbArete;

vector<int> arbre[MAX_SOMMET];

bool vu[MAX_SOMMET] = {0};

void calcArbre(int sommet) {
    vu[sommet] = 1;

    for(auto voisin : adj[sommet]) {
        if(!vu[voisin]) {
            arbre[sommet].push_back(voisin);
            arbre[voisin].push_back(sommet);
            calcArbre(voisin);
        }
    }
}

int tailleComp[MAX_SOMMET] = {0};

int calcTaille(int sommet, int pere) {
    tailleComp[sommet] = 1;

    for(auto voisin : arbre[sommet]) {
        if(voisin == pere) continue;

        tailleComp[sommet] += calcTaille(voisin, sommet);
    }

    return tailleComp[sommet];
}

int calcCentroid(int sommet, int pere) {
    for(auto voisin : arbre[sommet]) {
        if(voisin == pere) continue;

        if(tailleComp[voisin] * 2 > nbSommet)
            return calcCentroid(voisin, sommet);
    }

    return sommet;
}

int centroid;

int uf[MAX_SOMMET];
int tailleUf[MAX_SOMMET];

int trouver(int x) {
    if(uf[x] == x)
        return x;
    return uf[x] = trouver(uf[x]);
}

void unir(int a, int b) {
    int pa = trouver(a);
    int pb = trouver(b);

    if(pa != pb) {
        uf[pb] = pa;
        tailleUf[pa] += tailleUf[pb];
    }
}

void initUf(int sommet, int pere) {
    if(pere != centroid && sommet != centroid)
        unir(pere, sommet);

    for(auto voisin : arbre[sommet]) {
        if(voisin == pere) continue;

        initUf(voisin, sommet);
    }
}

int idComp() {
    for(int sommet = 0; sommet < nbSommet; sommet++) {
        if(tailleUf[trouver(sommet)] >= tEnsemble[0] && sommet != centroid)
            return trouver(sommet);
    }
    for(int sommet = 0; sommet < nbSommet; sommet++) {
        for(auto voisin : adj[sommet]) {
            if(sommet == centroid || voisin == centroid) continue;
            unir(sommet, voisin);
            if(tailleUf[trouver(sommet)] >= tEnsemble[0])
                return trouver(sommet);
        }
    }

    return -1;
}

int compA;

vector<int> rep;

bool vuA[MAX_SOMMET] = {0};

int nbRestantA;

void dfsA(int sommet) {
    if(vuA[sommet] || trouver(sommet) != compA || nbRestantA == 0)
        return;
    vuA[sommet] = 1;
    rep[sommet] = iEnsemble[0];
    nbRestantA--;

    for(auto voisin : adj[sommet]) 
        dfsA(voisin);
}

bool vuB[MAX_SOMMET] = {0};
int nbRestantB;

void dfsB(int sommet) {
    if(vuB[sommet] || nbRestantB == 0 || rep[sommet] != 0)
        return;
    vuB[sommet] = 1;
    nbRestantB--;
    rep[sommet] = iEnsemble[1];

    for(auto voisin : adj[sommet])
        dfsB(voisin);
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    nbSommet = n, nbArete = p.size();
    tEnsemble[0] = a, tEnsemble[1] = b, tEnsemble[2] = c;

    for(int sommet = 0; sommet < nbSommet; sommet++) {
        tailleUf[sommet] = 1;
        uf[sommet] = sommet;
        rep.push_back(0);
    }

    for(int id : {0, 1, 0}) {
        if(tEnsemble[id] > tEnsemble[id+1]) {
            swap(tEnsemble[id], tEnsemble[id+1]);
            swap(iEnsemble[id], iEnsemble[id+1]);
        }
    }

    for(int id = 0; id < nbArete; id++) {
        adj[p[id]].push_back(q[id]);
        adj[q[id]].push_back(p[id]);
    }


    calcArbre(0);
    calcTaille(0, -1);
    centroid = calcCentroid(0, -1);

    initUf(centroid, -1);

    compA = idComp();

    if(compA == -1) 
        return rep;

    nbRestantA = tEnsemble[0];
    for(auto voisin : adj[centroid]) {
        if(trouver(voisin) == compA) {
            dfsA(voisin);
            break;
        }
    }

    nbRestantB = tEnsemble[1];
    dfsB(centroid);

    for(int sommet = 0; sommet < nbSommet; sommet++) {
        if(rep[sommet] == 0)
            rep[sommet] = iEnsemble[2];
    }

    return rep;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB ok, correct split
2 Correct 2 ms 4948 KB ok, correct split
3 Correct 3 ms 4948 KB ok, correct split
4 Correct 3 ms 4948 KB ok, correct split
5 Correct 3 ms 4948 KB ok, correct split
6 Correct 3 ms 4948 KB ok, correct split
7 Correct 94 ms 22464 KB ok, correct split
8 Correct 91 ms 20088 KB ok, correct split
9 Correct 93 ms 19336 KB ok, correct split
10 Correct 94 ms 22596 KB ok, correct split
11 Correct 98 ms 22824 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB ok, correct split
2 Correct 3 ms 4948 KB ok, correct split
3 Correct 3 ms 4948 KB ok, correct split
4 Correct 99 ms 19472 KB ok, correct split
5 Correct 97 ms 16032 KB ok, correct split
6 Correct 95 ms 23492 KB ok, correct split
7 Correct 94 ms 20724 KB ok, correct split
8 Correct 116 ms 17848 KB ok, correct split
9 Correct 99 ms 15916 KB ok, correct split
10 Correct 60 ms 16420 KB ok, correct split
11 Correct 55 ms 16408 KB ok, correct split
12 Correct 57 ms 16524 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB ok, correct split
2 Correct 94 ms 15288 KB ok, correct split
3 Correct 28 ms 9076 KB ok, correct split
4 Correct 3 ms 4948 KB ok, correct split
5 Correct 89 ms 17564 KB ok, correct split
6 Correct 96 ms 17312 KB ok, correct split
7 Correct 121 ms 17140 KB ok, correct split
8 Correct 91 ms 18572 KB ok, correct split
9 Correct 88 ms 17028 KB ok, correct split
10 Correct 23 ms 8272 KB ok, no valid answer
11 Correct 45 ms 9964 KB ok, no valid answer
12 Correct 84 ms 15556 KB ok, no valid answer
13 Correct 84 ms 15136 KB ok, no valid answer
14 Correct 53 ms 15652 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB ok, correct split
2 Correct 2 ms 4948 KB ok, no valid answer
3 Correct 3 ms 4948 KB ok, correct split
4 Correct 3 ms 4948 KB ok, correct split
5 Correct 3 ms 4948 KB ok, correct split
6 Correct 4 ms 4948 KB ok, correct split
7 Correct 3 ms 5008 KB ok, correct split
8 Correct 3 ms 4948 KB ok, correct split
9 Correct 5 ms 5328 KB ok, correct split
10 Correct 5 ms 5332 KB ok, correct split
11 Correct 3 ms 5008 KB ok, correct split
12 Correct 5 ms 5296 KB ok, correct split
13 Correct 3 ms 4948 KB ok, correct split
14 Correct 3 ms 4948 KB ok, correct split
15 Correct 3 ms 5012 KB ok, correct split
16 Correct 3 ms 5032 KB ok, correct split
17 Correct 3 ms 4948 KB ok, correct split
18 Correct 3 ms 4948 KB ok, correct split
19 Correct 3 ms 5044 KB ok, correct split
20 Correct 3 ms 5076 KB ok, correct split
21 Correct 4 ms 5332 KB ok, correct split
22 Correct 4 ms 5332 KB ok, correct split
23 Correct 6 ms 5460 KB ok, correct split
24 Correct 4 ms 5332 KB ok, correct split
25 Correct 5 ms 5280 KB ok, correct split
26 Correct 4 ms 5332 KB ok, correct split
27 Correct 5 ms 5396 KB ok, correct split
28 Correct 6 ms 5332 KB ok, correct split
29 Correct 3 ms 4948 KB ok, correct split
30 Correct 4 ms 5332 KB ok, correct split
31 Correct 4 ms 5076 KB ok, correct split
32 Correct 3 ms 4948 KB ok, correct split
33 Correct 3 ms 5012 KB ok, correct split
34 Correct 4 ms 5280 KB ok, correct split
35 Correct 5 ms 5280 KB ok, correct split
36 Correct 4 ms 5204 KB ok, correct split
37 Correct 5 ms 5332 KB ok, correct split
38 Correct 5 ms 5404 KB ok, correct split
39 Correct 5 ms 5332 KB ok, correct split
40 Correct 5 ms 5332 KB ok, correct split
41 Correct 5 ms 5204 KB ok, correct split
42 Correct 4 ms 5204 KB ok, correct split
43 Correct 5 ms 5332 KB ok, correct split
44 Correct 5 ms 5332 KB ok, correct split
45 Correct 5 ms 5344 KB ok, correct split
46 Correct 4 ms 5332 KB ok, correct split
47 Correct 4 ms 5332 KB ok, no valid answer
48 Correct 4 ms 5204 KB ok, correct split
49 Correct 4 ms 5332 KB ok, correct split
50 Correct 3 ms 4948 KB ok, no valid answer
51 Correct 3 ms 5016 KB ok, no valid answer
52 Correct 5 ms 5204 KB ok, no valid answer
53 Correct 6 ms 5356 KB ok, no valid answer
54 Correct 5 ms 5200 KB ok, no valid answer
55 Correct 5 ms 5332 KB ok, no valid answer
56 Correct 5 ms 5260 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB ok, correct split
2 Correct 2 ms 4948 KB ok, correct split
3 Correct 3 ms 4948 KB ok, correct split
4 Correct 3 ms 4948 KB ok, correct split
5 Correct 3 ms 4948 KB ok, correct split
6 Correct 3 ms 4948 KB ok, correct split
7 Correct 94 ms 22464 KB ok, correct split
8 Correct 91 ms 20088 KB ok, correct split
9 Correct 93 ms 19336 KB ok, correct split
10 Correct 94 ms 22596 KB ok, correct split
11 Correct 98 ms 22824 KB ok, correct split
12 Correct 2 ms 4948 KB ok, correct split
13 Correct 3 ms 4948 KB ok, correct split
14 Correct 3 ms 4948 KB ok, correct split
15 Correct 99 ms 19472 KB ok, correct split
16 Correct 97 ms 16032 KB ok, correct split
17 Correct 95 ms 23492 KB ok, correct split
18 Correct 94 ms 20724 KB ok, correct split
19 Correct 116 ms 17848 KB ok, correct split
20 Correct 99 ms 15916 KB ok, correct split
21 Correct 60 ms 16420 KB ok, correct split
22 Correct 55 ms 16408 KB ok, correct split
23 Correct 57 ms 16524 KB ok, correct split
24 Correct 2 ms 4948 KB ok, correct split
25 Correct 94 ms 15288 KB ok, correct split
26 Correct 28 ms 9076 KB ok, correct split
27 Correct 3 ms 4948 KB ok, correct split
28 Correct 89 ms 17564 KB ok, correct split
29 Correct 96 ms 17312 KB ok, correct split
30 Correct 121 ms 17140 KB ok, correct split
31 Correct 91 ms 18572 KB ok, correct split
32 Correct 88 ms 17028 KB ok, correct split
33 Correct 23 ms 8272 KB ok, no valid answer
34 Correct 45 ms 9964 KB ok, no valid answer
35 Correct 84 ms 15556 KB ok, no valid answer
36 Correct 84 ms 15136 KB ok, no valid answer
37 Correct 53 ms 15652 KB ok, no valid answer
38 Correct 2 ms 4948 KB ok, correct split
39 Correct 2 ms 4948 KB ok, no valid answer
40 Correct 3 ms 4948 KB ok, correct split
41 Correct 3 ms 4948 KB ok, correct split
42 Correct 3 ms 4948 KB ok, correct split
43 Correct 4 ms 4948 KB ok, correct split
44 Correct 3 ms 5008 KB ok, correct split
45 Correct 3 ms 4948 KB ok, correct split
46 Correct 5 ms 5328 KB ok, correct split
47 Correct 5 ms 5332 KB ok, correct split
48 Correct 3 ms 5008 KB ok, correct split
49 Correct 5 ms 5296 KB ok, correct split
50 Correct 3 ms 4948 KB ok, correct split
51 Correct 3 ms 4948 KB ok, correct split
52 Correct 3 ms 5012 KB ok, correct split
53 Correct 3 ms 5032 KB ok, correct split
54 Correct 3 ms 4948 KB ok, correct split
55 Correct 3 ms 4948 KB ok, correct split
56 Correct 3 ms 5044 KB ok, correct split
57 Correct 3 ms 5076 KB ok, correct split
58 Correct 4 ms 5332 KB ok, correct split
59 Correct 4 ms 5332 KB ok, correct split
60 Correct 6 ms 5460 KB ok, correct split
61 Correct 4 ms 5332 KB ok, correct split
62 Correct 5 ms 5280 KB ok, correct split
63 Correct 4 ms 5332 KB ok, correct split
64 Correct 5 ms 5396 KB ok, correct split
65 Correct 6 ms 5332 KB ok, correct split
66 Correct 3 ms 4948 KB ok, correct split
67 Correct 4 ms 5332 KB ok, correct split
68 Correct 4 ms 5076 KB ok, correct split
69 Correct 3 ms 4948 KB ok, correct split
70 Correct 3 ms 5012 KB ok, correct split
71 Correct 4 ms 5280 KB ok, correct split
72 Correct 5 ms 5280 KB ok, correct split
73 Correct 4 ms 5204 KB ok, correct split
74 Correct 5 ms 5332 KB ok, correct split
75 Correct 5 ms 5404 KB ok, correct split
76 Correct 5 ms 5332 KB ok, correct split
77 Correct 5 ms 5332 KB ok, correct split
78 Correct 5 ms 5204 KB ok, correct split
79 Correct 4 ms 5204 KB ok, correct split
80 Correct 5 ms 5332 KB ok, correct split
81 Correct 5 ms 5332 KB ok, correct split
82 Correct 5 ms 5344 KB ok, correct split
83 Correct 4 ms 5332 KB ok, correct split
84 Correct 4 ms 5332 KB ok, no valid answer
85 Correct 4 ms 5204 KB ok, correct split
86 Correct 4 ms 5332 KB ok, correct split
87 Correct 3 ms 4948 KB ok, no valid answer
88 Correct 3 ms 5016 KB ok, no valid answer
89 Correct 5 ms 5204 KB ok, no valid answer
90 Correct 6 ms 5356 KB ok, no valid answer
91 Correct 5 ms 5200 KB ok, no valid answer
92 Correct 5 ms 5332 KB ok, no valid answer
93 Correct 5 ms 5260 KB ok, no valid answer
94 Correct 103 ms 19204 KB ok, correct split
95 Correct 140 ms 24260 KB ok, correct split
96 Correct 119 ms 22596 KB ok, correct split
97 Correct 30 ms 9552 KB ok, correct split
98 Correct 32 ms 9644 KB ok, correct split
99 Correct 52 ms 11796 KB ok, correct split
100 Correct 113 ms 19864 KB ok, correct split
101 Correct 102 ms 18828 KB ok, correct split
102 Correct 117 ms 18472 KB ok, correct split
103 Correct 90 ms 18376 KB ok, correct split
104 Correct 102 ms 20484 KB ok, correct split
105 Correct 50 ms 12012 KB ok, correct split
106 Correct 103 ms 20004 KB ok, correct split
107 Correct 110 ms 16368 KB ok, correct split
108 Correct 103 ms 16416 KB ok, correct split
109 Correct 136 ms 19200 KB ok, correct split
110 Correct 124 ms 19420 KB ok, correct split
111 Correct 131 ms 19440 KB ok, correct split
112 Correct 124 ms 19600 KB ok, correct split
113 Correct 122 ms 19568 KB ok, correct split
114 Correct 12 ms 6740 KB ok, correct split
115 Correct 13 ms 6520 KB ok, correct split
116 Correct 118 ms 19292 KB ok, correct split
117 Correct 120 ms 19184 KB ok, correct split
118 Correct 84 ms 16324 KB ok, correct split
119 Correct 91 ms 16300 KB ok, correct split
120 Correct 100 ms 20480 KB ok, correct split
121 Correct 88 ms 16152 KB ok, no valid answer
122 Correct 87 ms 16272 KB ok, no valid answer
123 Correct 126 ms 19876 KB ok, no valid answer
124 Correct 149 ms 19792 KB ok, no valid answer
125 Correct 80 ms 17548 KB ok, no valid answer
126 Correct 49 ms 15592 KB ok, no valid answer
127 Correct 102 ms 17936 KB ok, no valid answer