oj.uz

Submission #799066

# Submission time Handle Problem Language Result Execution time Memory
799066 2023-07-31T09:13:29 Z jlallas384 Parachute rings (IOI12_rings) C++17
37 / 100
 1732 ms 202824 KB 
#include <bits/stdc++.h>
using namespace std;



struct ufds{
    vector<int> sz, par;
    ufds(){}
    ufds(int n): sz(n, 1), par(n){
        iota(par.begin(), par.end(), 0);
    }
    int find(int a){
        return par[a] == a ? a : par[a] = find(par[a]);
    }
    int unite(int a, int b){
        a = find(a), b = find(b);
        if(a == b) return 0;
        if(sz[a] < sz[b]) swap(a, b);
        par[b] = a;
        sz[a] += sz[b];
        return 1;
    }
};

set<int> ans;
vector<vector<int>> g, tree;
vector<int> deg;
int n;
ufds ds;

int bad = 0;
int d4 = 0;

void Init(int N){
    n = N;
    g.resize(n);
    tree.resize(n);
    deg.resize(n);
    for(int i = 0; i < n; i++){
        ans.insert(i);
    }
    ds = ufds(n);
}

void proc(int a, int add = 1){
    if(deg[a] == 4){
        if(add){
            d4++;
            if(d4 == 2) bad = 1;
        }
        if(!ans.count(a)) ans = {};
        else ans = {a};
    }else if(deg[a] == 3){
        set<int> nans;
        if(ans.count(a)) nans.insert(a);
        for(int u: g[a]){
            if(ans.count(u)) nans.insert(u);
        }
        ans = nans;
    }
}

int CountCritical(){    
    if(bad) return 0;
    else return ans.size();
}




int cyc = 0;

vector<int> path;
int dfs(int v, int p, int x){
    path.push_back(v);
    if(v == x) return 1;
    for(int u: tree[v]) if(u != p){
        if(dfs(u, v, x)) return 1;
    }
    path.pop_back();
    return 0;
}

void dfs2(int v, set<int> &vis){
    if(ans.count(v)) return;
    vis.insert(v);
    for(int u: g[v]) if(!vis.count(u)){
        dfs2(u, vis);
    }
}

int dfs3(int v, set<int> &v1, set<int> &v2){
    if(ans.count(v)) return 0;
    if(v1.count(v)) return 1;
    v2.insert(v);
    for(int u: g[v]) if(!v2.count(u)){
        if(dfs3(u, v1, v2)) return 1;
    }
    return 0;
}

void Link(int a, int b){
    if(bad) return;
    int res = ds.unite(a, b);
    deg[a]++, deg[b]++;
    g[a].push_back(b);
    g[b].push_back(a);
    proc(a), proc(b);
    if(!res){
        if(!cyc){
            dfs(a, -1, b);
            ans = {};
            for(int x: path){
                ans.insert(x);
            }
            for(int i = 0; i < n; i++){
                proc(i, 0);
            }
            cyc = 1;
        }else{
            if(ans.size() >= 3) bad = 1;
            g[a].pop_back();
            g[b].pop_back();
            set<int> v1, v2;
            dfs2(a, v1);
            if(dfs3(b, v1, v2)){
                bad = 1;
            }
            g[a].push_back(b);
            g[b].push_back(a);
        }
    }else{
        tree[a].push_back(b);
        tree[b].push_back(a);
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 5 ms 1364 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 4 ms 1108 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 92724 KB Output is correct
2 Correct 1146 ms 117656 KB Output is correct
3 Correct 396 ms 111444 KB Output is correct
4 Correct 1492 ms 173044 KB Output is correct
5 Correct 1538 ms 174516 KB Output is correct
6 Correct 1732 ms 202824 KB Output is correct
7 Correct 392 ms 112092 KB Output is correct
8 Correct 1390 ms 156540 KB Output is correct
9 Correct 1403 ms 171320 KB Output is correct
10 Correct 1059 ms 169736 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 5 ms 1364 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 4 ms 1108 KB Output is correct
11 Incorrect 3 ms 1108 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 5 ms 1364 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 4 ms 1108 KB Output is correct
11 Incorrect 3 ms 1108 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 5 ms 1364 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 4 ms 1108 KB Output is correct
11 Correct 554 ms 92724 KB Output is correct
12 Correct 1146 ms 117656 KB Output is correct
13 Correct 396 ms 111444 KB Output is correct
14 Correct 1492 ms 173044 KB Output is correct
15 Correct 1538 ms 174516 KB Output is correct
16 Correct 1732 ms 202824 KB Output is correct
17 Correct 392 ms 112092 KB Output is correct
18 Correct 1390 ms 156540 KB Output is correct
19 Correct 1403 ms 171320 KB Output is correct
20 Correct 1059 ms 169736 KB Output is correct
21 Incorrect 3 ms 1108 KB Output isn't correct
22 Halted 0 ms 0 KB -