oj.uz

Submission #736220

# Submission time Handle Problem Language Result Execution time Memory
736220 2023-05-05T10:33:39 Z becaido Parachute rings (IOI12_rings) C++17
0 / 100
 1844 ms 148936 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 1e6 + 5;

int n, mxdeg;
vector<int> adj[SIZE];

struct DS {
    int p, mxD;
    int cycle, csum;
    int to[SIZE], sz[SIZE], sum[SIZE], deg[SIZE], mxdeg[SIZE];
    void init() {
        mxD = cycle = csum = 0;
        iota(to + 1, to + n + 1, 1);
        fill(sz + 1, sz + n + 1, 1);
        fill(sum + 1, sum + n + 1, 0);
        fill(deg + 1, deg + n + 1, 0);
        fill(mxdeg + 1, mxdeg + n + 1, 0);
    }
    void build(int P = 0) {
        p = P;
        init();
        FOR (i, 1, n) for (int j : adj[i]) if (i < j) Merge(i, j);
    }
    int dsu(int x) {
        return x == to[x] ? x : (to[x] = dsu(to[x]));
    }
    void add(int x) {
        if (mxdeg[x] == 2 && sz[x] == sum[x]) cycle++, csum = sz[x];
        mxD = max(mxD, min(mxdeg[x], 4));
    }
    void del(int x) {
        if (mxdeg[x] == 2 && sz[x] == sum[x]) cycle--;
    }
    void Merge(int a, int b) {
        if (a == p || b == p) return;
        int da = dsu(a), db = dsu(b);
        if (da == db) del(da);
        else del(da), del(db);

        sum[da] -= deg[a] == 2;
        sum[db] -= deg[b] == 2;
        mxdeg[da] = max(mxdeg[da], ++deg[a]);
        mxdeg[db] = max(mxdeg[db], ++deg[b]);
        sum[da] += deg[a] == 2;
        sum[db] += deg[b] == 2;

        if (da == db) {
            add(da);
            return;
        }
        if (sz[da] < sz[db]) swap(da, db);
        to[db] = da;
        sz[da] += sz[db];
        sum[da] += sum[db];
        mxdeg[da] = max(mxdeg[da], mxdeg[db]);
        add(da);
    }
} ori, ds[4];

void Init(int N) {
    n = N;
    ori.build();
}

void Link(int a, int b) {
    a++, b++;
    if (a > b) swap(a, b);
    adj[a].pb(b);
    adj[b].pb(a);
    ori.Merge(a, b);
    int cur = ori.mxD;
    if (cur == mxdeg + 1) {
        if (cur == 4) {
            FOR (i, 1, n) if (adj[i].size() == 4) {
                ds[0].build(i);
                break;
            }
        }
        if (cur == 3) {
            FOR (i, 1, n) if (adj[i].size() == 3) {
                ds[0].build(i);
                int k = 0;
                for (int j : adj[i]) ds[++k].build(j);
                break;
            }
        }
    }
    mxdeg = cur;
    if (mxdeg == 4) ds[0].Merge(a, b);
    else if (mxdeg == 3) FOR (i, 0, 3) ds[i].Merge(a, b);
}

int CountCritical() {
    if (mxdeg <= 1) return n;
    if (mxdeg == 2) return ori.cycle == 0 ? n : ori.cycle == 1 ? ori.csum : 0;
    int ans = 0;
    FOR (i, 0, (mxdeg == 3 ? 3 : 0)) ans += ds[i].mxD <= 1 || (ds[i].mxD == 2 && ds[i].cycle == 0);
    return ans;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 16 ms 24568 KB Output is correct
3 Correct 16 ms 24660 KB Output is correct
4 Correct 14 ms 23796 KB Output is correct
5 Correct 15 ms 23892 KB Output is correct
6 Correct 15 ms 24020 KB Output is correct
7 Correct 14 ms 24404 KB Output is correct
8 Correct 15 ms 24020 KB Output is correct
9 Incorrect 18 ms 24668 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 50348 KB Output is correct
2 Correct 1235 ms 127332 KB Output is correct
3 Correct 1180 ms 148936 KB Output is correct
4 Correct 1108 ms 74736 KB Output is correct
5 Correct 993 ms 74736 KB Output is correct
6 Correct 995 ms 73596 KB Output is correct
7 Correct 1203 ms 148312 KB Output is correct
8 Incorrect 1844 ms 144844 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 16 ms 24568 KB Output is correct
3 Correct 16 ms 24660 KB Output is correct
4 Correct 14 ms 23796 KB Output is correct
5 Correct 15 ms 23892 KB Output is correct
6 Correct 15 ms 24020 KB Output is correct
7 Correct 14 ms 24404 KB Output is correct
8 Correct 15 ms 24020 KB Output is correct
9 Incorrect 18 ms 24668 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 16 ms 24568 KB Output is correct
3 Correct 16 ms 24660 KB Output is correct
4 Correct 14 ms 23796 KB Output is correct
5 Correct 15 ms 23892 KB Output is correct
6 Correct 15 ms 24020 KB Output is correct
7 Correct 14 ms 24404 KB Output is correct
8 Correct 15 ms 24020 KB Output is correct
9 Incorrect 18 ms 24668 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 16 ms 24568 KB Output is correct
3 Correct 16 ms 24660 KB Output is correct
4 Correct 14 ms 23796 KB Output is correct
5 Correct 15 ms 23892 KB Output is correct
6 Correct 15 ms 24020 KB Output is correct
7 Correct 14 ms 24404 KB Output is correct
8 Correct 15 ms 24020 KB Output is correct
9 Incorrect 18 ms 24668 KB Output isn't correct
10 Halted 0 ms 0 KB -