oj.uz

Submission #569808

# Submission time Handle Problem Language Result Execution time Memory
569808 2022-05-27T20:22:23 Z definitelynotmee Parachute rings (IOI12_rings) C++
100 / 100
 1947 ms 100492 KB 
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
using namespace std;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
const int MAXN = 1e6+1;

struct UnionFind{
    bool good = 1;
    int root;
    vector<int> pai, degree;

    UnionFind(int n = 0, int start = 0){
        root = start;
        pai = vector<int>(n+1);
        iota(all(pai),0);
        degree = vector<int>(n+1);
    }
    int find (int id){
        if(pai[id] == id)
            return id;
        return pai[id] = find(pai[id]);
    }
    void onion(int a, int b){

        if(a == root || b == root)
            return;
        //cout << root << " push(" << a << ',' << b << ")\n";
        degree[a]++;
        degree[b]++;
        if(degree[a] == 3)
            good = 0;//, cout << "=>" << root << " bad " << a <<  "\n";
        if(degree[b] == 3)
            good = 0;//, cout << "=>" << root << " bad " << b <<  "\n";
        a = find(a), b = find(b);
        if(a!=b){
            pai[b] = a;
        } else {
            good = 0;//, cout << "=>" << root << " badc\n";
        }
    }
};

struct UnionFind2{
    int cycle = -1;
    int cyclect = 0;
    vector<int> pai, sizee;

    UnionFind2(int n = 0){
        pai = vector<int>(n+1);
        sizee = vector<int> (n+1,1);
        iota(all(pai),0);
    }
    int find (int id){
        if(pai[id] == id)
            return id;
        return pai[id] = find(pai[id]);
    }
    void onion(int a, int b){
        a = find(a), b = find(b);
        if(a == b){
            cycle = a;
            cyclect++;
        } else{
            sizee[a] += sizee[b];
            pai[b] = a;
        }
    }
} ufsmall;

int n;

matrix<int> g;
vector<UnionFind> uf;

int mode = 0;

void inituf(int x, int y){
    for(int i : g[x]){
        uf.push_back(UnionFind(n,i));
        for(int j = 0; j < n; j++){
            for(int k : g[j]){
                if(j > k)
                    continue;
                int a = j , b = k;
                if(!(a == min(x,y) && b == max(x,y)))
                    uf.back().onion(j,k);
            }
        }
    }
    uf.push_back(UnionFind(n,x));
    for(int j = 0; j < n; j++){
        for(int k : g[j]){
            if(j > k)
                continue;
            int a = j , b = k;
            if(!(a == min(x,y) && b == max(x,y)))
                uf.back().onion(j,k);
        }
    }

}


void Init(int N_) {

  n = N_;
  g = matrix<int>(n+1);
  ufsmall = UnionFind2(n);
}

void Link(int A, int B) {
    if(mode == 3)
        return;
    g[A].push_back(B);
    g[B].push_back(A);
    if(g[A].size() == 3 && mode == 0){
        mode = 1;
        inituf(A,B);
    }
    if(g[B].size() == 3 && mode == 0){
        mode = 1;
        inituf(B,A);
    }
    if(mode == 0){
        ufsmall.onion(A,B);
        if(ufsmall.cyclect >= 2)
            mode = 3;
    }
    for(auto& i : uf){
        i.onion(A,B);
    }

}

int CountCritical() {
    if(mode == 3)
        return 0;
    if(mode == 0){
        if(ufsmall.cyclect == 0)
            return n;
        return ufsmall.sizee[ufsmall.cycle];
    }
    int resp =0;
    for(auto& i : uf){
        //cout << "->" << i.root << ' ' << i.good << '\n';
        resp+=i.good;
    }

    return resp;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 424 ms 34816 KB Output is correct
2 Correct 1312 ms 77180 KB Output is correct
3 Correct 1947 ms 92088 KB Output is correct
4 Correct 1014 ms 64892 KB Output is correct
5 Correct 1032 ms 64824 KB Output is correct
6 Correct 987 ms 63576 KB Output is correct
7 Correct 1752 ms 96752 KB Output is correct
8 Correct 1566 ms 94884 KB Output is correct
9 Correct 1679 ms 100492 KB Output is correct
10 Correct 718 ms 67740 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 3 ms 852 KB Output is correct
12 Correct 6 ms 1364 KB Output is correct
13 Correct 6 ms 1292 KB Output is correct
14 Correct 4 ms 1108 KB Output is correct
15 Correct 6 ms 1748 KB Output is correct
16 Correct 4 ms 980 KB Output is correct
17 Correct 5 ms 1364 KB Output is correct
18 Correct 6 ms 2004 KB Output is correct
19 Correct 4 ms 980 KB Output is correct
20 Correct 5 ms 1364 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 3 ms 852 KB Output is correct
12 Correct 6 ms 1364 KB Output is correct
13 Correct 6 ms 1292 KB Output is correct
14 Correct 4 ms 1108 KB Output is correct
15 Correct 6 ms 1748 KB Output is correct
16 Correct 4 ms 980 KB Output is correct
17 Correct 5 ms 1364 KB Output is correct
18 Correct 6 ms 2004 KB Output is correct
19 Correct 4 ms 980 KB Output is correct
20 Correct 5 ms 1364 KB Output is correct
21 Correct 15 ms 3212 KB Output is correct
22 Correct 25 ms 4948 KB Output is correct
23 Correct 29 ms 6180 KB Output is correct
24 Correct 55 ms 8432 KB Output is correct
25 Correct 19 ms 7000 KB Output is correct
26 Correct 64 ms 9184 KB Output is correct
27 Correct 41 ms 6264 KB Output is correct
28 Correct 54 ms 9640 KB Output is correct
29 Correct 37 ms 8652 KB Output is correct
30 Correct 52 ms 7624 KB Output is correct

Subtask #5
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 424 ms 34816 KB Output is correct
12 Correct 1312 ms 77180 KB Output is correct
13 Correct 1947 ms 92088 KB Output is correct
14 Correct 1014 ms 64892 KB Output is correct
15 Correct 1032 ms 64824 KB Output is correct
16 Correct 987 ms 63576 KB Output is correct
17 Correct 1752 ms 96752 KB Output is correct
18 Correct 1566 ms 94884 KB Output is correct
19 Correct 1679 ms 100492 KB Output is correct
20 Correct 718 ms 67740 KB Output is correct
21 Correct 3 ms 852 KB Output is correct
22 Correct 6 ms 1364 KB Output is correct
23 Correct 6 ms 1292 KB Output is correct
24 Correct 4 ms 1108 KB Output is correct
25 Correct 6 ms 1748 KB Output is correct
26 Correct 4 ms 980 KB Output is correct
27 Correct 5 ms 1364 KB Output is correct
28 Correct 6 ms 2004 KB Output is correct
29 Correct 4 ms 980 KB Output is correct
30 Correct 5 ms 1364 KB Output is correct
31 Correct 15 ms 3212 KB Output is correct
32 Correct 25 ms 4948 KB Output is correct
33 Correct 29 ms 6180 KB Output is correct
34 Correct 55 ms 8432 KB Output is correct
35 Correct 19 ms 7000 KB Output is correct
36 Correct 64 ms 9184 KB Output is correct
37 Correct 41 ms 6264 KB Output is correct
38 Correct 54 ms 9640 KB Output is correct
39 Correct 37 ms 8652 KB Output is correct
40 Correct 52 ms 7624 KB Output is correct
41 Correct 206 ms 28168 KB Output is correct
42 Correct 651 ms 75528 KB Output is correct
43 Correct 284 ms 65208 KB Output is correct
44 Correct 907 ms 93136 KB Output is correct
45 Correct 1238 ms 92552 KB Output is correct
46 Correct 660 ms 59504 KB Output is correct
47 Correct 888 ms 60816 KB Output is correct
48 Correct 606 ms 85784 KB Output is correct
49 Correct 637 ms 65708 KB Output is correct
50 Correct 668 ms 64872 KB Output is correct
51 Correct 338 ms 58760 KB Output is correct
52 Correct 822 ms 77728 KB Output is correct
53 Correct 626 ms 86032 KB Output is correct
54 Correct 1339 ms 83724 KB Output is correct
55 Correct 1304 ms 90252 KB Output is correct