oj.uz

Submission #828166

# Submission time Handle Problem Language Result Execution time Memory
828166 2023-08-17T06:12:30 Z jlallas384 Parachute rings (IOI12_rings) C++17
20 / 100
 4000 ms 152796 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 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;
}

vector<pair<int,int>> eds;


void Link(int a, int b){
    int res = ds.unite(a, b);
    deg[a]++, deg[b]++;
    g[a].push_back(b);
    g[b].push_back(a);
    eds.emplace_back(a, b);
    proc(a), proc(b);
    cyc += !res;
}

int CountCritical(){    
    if(cyc == 0) return ans.size();
    int fans = 0;
    for(int x: ans){
        ufds f(n);
        int can = 1;
        for(auto [u, v]: eds) if(u != x && v != x){
            if(!f.unite(u, v)) can = 0;
        }
        fans += can;
    }
    return fans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 39 ms 772 KB Output is correct
6 Correct 120 ms 1108 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 104 ms 952 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 75560 KB Output is correct
2 Correct 744 ms 102960 KB Output is correct
3 Correct 851 ms 106524 KB Output is correct
4 Execution timed out 4086 ms 152796 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 39 ms 772 KB Output is correct
6 Correct 120 ms 1108 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 104 ms 952 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 3 ms 980 KB Output is correct
12 Correct 1519 ms 1900 KB Output is correct
13 Correct 7 ms 1748 KB Output is correct
14 Correct 5 ms 1492 KB Output is correct
15 Correct 7 ms 2516 KB Output is correct
16 Execution timed out 4073 ms 1940 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 39 ms 772 KB Output is correct
6 Correct 120 ms 1108 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 104 ms 952 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 3 ms 980 KB Output is correct
12 Correct 1519 ms 1900 KB Output is correct
13 Correct 7 ms 1748 KB Output is correct
14 Correct 5 ms 1492 KB Output is correct
15 Correct 7 ms 2516 KB Output is correct
16 Execution timed out 4073 ms 1940 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 39 ms 772 KB Output is correct
6 Correct 120 ms 1108 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 104 ms 952 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 371 ms 75560 KB Output is correct
12 Correct 744 ms 102960 KB Output is correct
13 Correct 851 ms 106524 KB Output is correct
14 Execution timed out 4086 ms 152796 KB Time limit exceeded
15 Halted 0 ms 0 KB -