oj.uz

Submission #589372

# Submission time Handle Problem Language Result Execution time Memory
589372 2022-07-04T14:11:35 Z TheScrasse Parachute rings (IOI12_rings) C++17
38 / 100
 4000 ms 216376 KB 
#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
using namespace std;

#define nl "\n"
#define nf endl
#define ll int
#define pb push_back
#define _ << ' ' <<

#define INF (ll)1e9
#define mod 998244353
#define maxn 1000010

ll i, i1, j, k, k1, t, n, m, res, flag[10], a, b;
ll ms[5], status;
vector<array<ll, 2>> el;

struct graph {
    ll dg[maxn], cn3, cyc, pr[maxn], sz[maxn];
    vector<ll> adj[maxn];

    graph() {
        ll i;
        for (i = 1; i <= n; i++) {
            dg[i] = 0; pr[i] = i; sz[i] = 1;
        }
        cn3 = 0; cyc = 0;
    }

    ll find(ll x) {
        if (x == pr[x]) return x;
        return pr[x] = find(pr[x]);
    }

    bool same(ll a, ll b) {
        return (find(a) == find(b));
    }

    void onion(ll a, ll b) {
        a = find(a); b = find(b);
        if (a == b) {
            cyc++; res = sz[a]; return;
        }
        if (sz[a] < sz[b]) swap(a, b);
        pr[b] = a; sz[a] += sz[b];
    }

    void upd(ll p, ll x) {
        cn3 -= (dg[p] >= 3);
        dg[p] += x;
        cn3 += (dg[p] >= 3);
    }
};

graph gr[5];

void ins(ll p, ll a, ll b) {
    if (ms[p] == a || ms[p] == b) return;
    gr[p].upd(a, 1); gr[p].upd(b, 1);
    gr[p].adj[a].pb(b); gr[p].adj[b].pb(a);
    gr[p].onion(a, b);
}

void Init(int N_) {
    n = N_;
    gr[0] = graph(); gr[1] = graph(); gr[2] = graph(); gr[3] = graph(); gr[4] = graph();
}

void Link(int A, int B) {
    a = A + 1; b = B + 1;
    el.pb({a, b});
    for (i = 0; i <= 4; i++) ins(i, a, b);

    if (status == 0) {
        if (gr[0].dg[b] >= 3) swap(a, b);
        if (gr[0].dg[a] >= 3) {
            status = 1;
            ms[1] = a; ms[2] = gr[0].adj[a][0]; ms[3] = gr[0].adj[a][1]; ms[4] = gr[0].adj[a][2];
            gr[1] = graph(); gr[2] = graph(); gr[3] = graph(); gr[4] = graph();
            for (auto [x, y] : el) {
                for (i = 1; i <= 4; i++) ins(i, x, y);
            }
        }
    }
}

int CountCritical() {
    // cout << "status =" _ status _ gr[0].cyc << nl;

    if (status == 0) {
        if (gr[0].cyc == 0) return n;
        if (gr[0].cyc == 1) return res;
        return 0;
    }

    res = 0;
    for (i = 1; i <= 4; i++) {
        if (gr[i].cyc + gr[i].cn3 == 0) res++;
    }
    return res;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 211736 KB Output is correct
2 Correct 807 ms 212244 KB Output is correct
3 Correct 932 ms 212616 KB Output is correct
4 Correct 278 ms 211784 KB Output is correct
5 Correct 577 ms 212132 KB Output is correct
6 Correct 860 ms 212512 KB Output is correct
7 Correct 254 ms 211744 KB Output is correct
8 Correct 693 ms 212252 KB Output is correct
9 Correct 884 ms 212684 KB Output is correct
10 Correct 914 ms 212592 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4051 ms 216204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 211736 KB Output is correct
2 Correct 807 ms 212244 KB Output is correct
3 Correct 932 ms 212616 KB Output is correct
4 Correct 278 ms 211784 KB Output is correct
5 Correct 577 ms 212132 KB Output is correct
6 Correct 860 ms 212512 KB Output is correct
7 Correct 254 ms 211744 KB Output is correct
8 Correct 693 ms 212252 KB Output is correct
9 Correct 884 ms 212684 KB Output is correct
10 Correct 914 ms 212592 KB Output is correct
11 Correct 963 ms 212472 KB Output is correct
12 Correct 1681 ms 213420 KB Output is correct
13 Correct 1630 ms 213356 KB Output is correct
14 Correct 1165 ms 212648 KB Output is correct
15 Correct 1105 ms 212456 KB Output is correct
16 Correct 1635 ms 213388 KB Output is correct
17 Correct 1625 ms 213492 KB Output is correct
18 Correct 1692 ms 213852 KB Output is correct
19 Correct 1691 ms 213388 KB Output is correct
20 Correct 1726 ms 213408 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 211736 KB Output is correct
2 Correct 807 ms 212244 KB Output is correct
3 Correct 932 ms 212616 KB Output is correct
4 Correct 278 ms 211784 KB Output is correct
5 Correct 577 ms 212132 KB Output is correct
6 Correct 860 ms 212512 KB Output is correct
7 Correct 254 ms 211744 KB Output is correct
8 Correct 693 ms 212252 KB Output is correct
9 Correct 884 ms 212684 KB Output is correct
10 Correct 914 ms 212592 KB Output is correct
11 Correct 963 ms 212472 KB Output is correct
12 Correct 1681 ms 213420 KB Output is correct
13 Correct 1630 ms 213356 KB Output is correct
14 Correct 1165 ms 212648 KB Output is correct
15 Correct 1105 ms 212456 KB Output is correct
16 Correct 1635 ms 213388 KB Output is correct
17 Correct 1625 ms 213492 KB Output is correct
18 Correct 1692 ms 213852 KB Output is correct
19 Correct 1691 ms 213388 KB Output is correct
20 Correct 1726 ms 213408 KB Output is correct
21 Execution timed out 4094 ms 216376 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 211736 KB Output is correct
2 Correct 807 ms 212244 KB Output is correct
3 Correct 932 ms 212616 KB Output is correct
4 Correct 278 ms 211784 KB Output is correct
5 Correct 577 ms 212132 KB Output is correct
6 Correct 860 ms 212512 KB Output is correct
7 Correct 254 ms 211744 KB Output is correct
8 Correct 693 ms 212252 KB Output is correct
9 Correct 884 ms 212684 KB Output is correct
10 Correct 914 ms 212592 KB Output is correct
11 Execution timed out 4051 ms 216204 KB Time limit exceeded
12 Halted 0 ms 0 KB -