oj.uz

답안 #589381

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
589381 2022-07-04T14:20:09 Z TheScrasse 낙하산 고리들 (IOI12_rings) C++17
38 / 100
 4000 ms 216956 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")

#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

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 211648 KB Output is correct
2 Correct 784 ms 212292 KB Output is correct
3 Correct 912 ms 212528 KB Output is correct
4 Correct 269 ms 211784 KB Output is correct
5 Correct 581 ms 212108 KB Output is correct
6 Correct 895 ms 212596 KB Output is correct
7 Correct 256 ms 211880 KB Output is correct
8 Correct 723 ms 212484 KB Output is correct
9 Correct 950 ms 212512 KB Output is correct
10 Correct 895 ms 212504 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4069 ms 216956 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 211648 KB Output is correct
2 Correct 784 ms 212292 KB Output is correct
3 Correct 912 ms 212528 KB Output is correct
4 Correct 269 ms 211784 KB Output is correct
5 Correct 581 ms 212108 KB Output is correct
6 Correct 895 ms 212596 KB Output is correct
7 Correct 256 ms 211880 KB Output is correct
8 Correct 723 ms 212484 KB Output is correct
9 Correct 950 ms 212512 KB Output is correct
10 Correct 895 ms 212504 KB Output is correct
11 Correct 949 ms 212452 KB Output is correct
12 Correct 1686 ms 213236 KB Output is correct
13 Correct 1732 ms 213188 KB Output is correct
14 Correct 1123 ms 212708 KB Output is correct
15 Correct 1086 ms 212428 KB Output is correct
16 Correct 1608 ms 213188 KB Output is correct
17 Correct 1641 ms 213292 KB Output is correct
18 Correct 1659 ms 213696 KB Output is correct
19 Correct 1607 ms 213324 KB Output is correct
20 Correct 1679 ms 213344 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 211648 KB Output is correct
2 Correct 784 ms 212292 KB Output is correct
3 Correct 912 ms 212528 KB Output is correct
4 Correct 269 ms 211784 KB Output is correct
5 Correct 581 ms 212108 KB Output is correct
6 Correct 895 ms 212596 KB Output is correct
7 Correct 256 ms 211880 KB Output is correct
8 Correct 723 ms 212484 KB Output is correct
9 Correct 950 ms 212512 KB Output is correct
10 Correct 895 ms 212504 KB Output is correct
11 Correct 949 ms 212452 KB Output is correct
12 Correct 1686 ms 213236 KB Output is correct
13 Correct 1732 ms 213188 KB Output is correct
14 Correct 1123 ms 212708 KB Output is correct
15 Correct 1086 ms 212428 KB Output is correct
16 Correct 1608 ms 213188 KB Output is correct
17 Correct 1641 ms 213292 KB Output is correct
18 Correct 1659 ms 213696 KB Output is correct
19 Correct 1607 ms 213324 KB Output is correct
20 Correct 1679 ms 213344 KB Output is correct
21 Execution timed out 4078 ms 216164 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 211648 KB Output is correct
2 Correct 784 ms 212292 KB Output is correct
3 Correct 912 ms 212528 KB Output is correct
4 Correct 269 ms 211784 KB Output is correct
5 Correct 581 ms 212108 KB Output is correct
6 Correct 895 ms 212596 KB Output is correct
7 Correct 256 ms 211880 KB Output is correct
8 Correct 723 ms 212484 KB Output is correct
9 Correct 950 ms 212512 KB Output is correct
10 Correct 895 ms 212504 KB Output is correct
11 Execution timed out 4069 ms 216956 KB Time limit exceeded
12 Halted 0 ms 0 KB -