oj.uz

Submission #828168

# Submission time Handle Problem Language Result Execution time Memory
828168 2023-08-17T06:14:43 Z jlallas384 Parachute rings (IOI12_rings) C++17
20 / 100
 1732 ms 262144 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;
}
 
vector<pair<int,int>> eds;
map<int, ufds> mp;
 
void Link(int a, int b){
    if(bad || ans.size() == 0) return;
    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);
    if(mp.size()){
        set<int> nans;
        for(int x: ans) if(x != a && x != b){
            int bad = 0;
            if(!mp[x].unite(a, b)){
                bad = 1;
            }
            if(!bad) nans.insert(x);
        }
        ans = nans;
        assert(ans.size());
    }
    if(!res){
        if(!cyc){
            dfs(a, -1, b);
            ans = {};
            for(int x: path){
                ans.insert(x);
            }
            cyc = 1;
        }else{
            if(mp.size() == 0){
                set<int> nans;
                for(int x: ans){
                    mp[x] = ufds(n);
                    int tbad = 0;
                    for(auto [u, v]: eds){
                        if(u != x && v != x){
                            if(!mp[x].unite(u, v)) tbad = 1;
                        }
                    }
                    if(!tbad) nans.insert(x);
                }
                ans = nans;
                assert(ans.size() <= 2);
            }
        }
    }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 212 KB Output is correct
2 Correct 3 ms 976 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 1 ms 428 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 3 ms 1492 KB Output is correct
7 Correct 1 ms 820 KB Output is correct
8 Correct 6 ms 2324 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 3 ms 1108 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 601 ms 92992 KB Output is correct
2 Correct 1154 ms 117768 KB Output is correct
3 Correct 397 ms 108476 KB Output is correct
4 Correct 1638 ms 178388 KB Output is correct
5 Correct 1650 ms 180524 KB Output is correct
6 Correct 1732 ms 210592 KB Output is correct
7 Correct 362 ms 109984 KB Output is correct
8 Correct 1334 ms 161880 KB Output is correct
9 Correct 1417 ms 177112 KB Output is correct
10 Runtime error 1359 ms 262144 KB Execution killed with signal 9
11 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 976 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 1 ms 428 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 3 ms 1492 KB Output is correct
7 Correct 1 ms 820 KB Output is correct
8 Correct 6 ms 2324 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 3 ms 1108 KB Output is correct
11 Runtime error 4 ms 2144 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 976 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 1 ms 428 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 3 ms 1492 KB Output is correct
7 Correct 1 ms 820 KB Output is correct
8 Correct 6 ms 2324 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 3 ms 1108 KB Output is correct
11 Runtime error 4 ms 2144 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 976 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 1 ms 428 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 3 ms 1492 KB Output is correct
7 Correct 1 ms 820 KB Output is correct
8 Correct 6 ms 2324 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 3 ms 1108 KB Output is correct
11 Correct 601 ms 92992 KB Output is correct
12 Correct 1154 ms 117768 KB Output is correct
13 Correct 397 ms 108476 KB Output is correct
14 Correct 1638 ms 178388 KB Output is correct
15 Correct 1650 ms 180524 KB Output is correct
16 Correct 1732 ms 210592 KB Output is correct
17 Correct 362 ms 109984 KB Output is correct
18 Correct 1334 ms 161880 KB Output is correct
19 Correct 1417 ms 177112 KB Output is correct
20 Runtime error 1359 ms 262144 KB Execution killed with signal 9
21 Halted 0 ms 0 KB -