oj.uz

답안 #481684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
481684 2021-10-21T10:57:50 Z Haruto810198 낙하산 고리들 (IOI12_rings) C++17
38 / 100
 4000 ms 262144 KB 
#include <bits/stdc++.h>

using namespace std;

//#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int MAX = 1000010;

int n;
vi check_id;

struct Graph{
    vi edge[MAX];
    int deg[MAX];
    int p[MAX], sz[MAX];
    int cyc, cyclen, deg3;

    void init(){
        FOR(i, 0, n-1, 1){
            edge[i].clear();
            deg[i] = 0;
            p[i] = i;
            sz[i] = 1;
        }
        cyc = 0;
        cyclen = 0;
        deg3 = 0;
    }

    int findp(int v){
        if(v == p[v]) return v;
        return p[v] = findp(p[v]);
    }

    bool uni(int u, int v){
        int pu = findp(u);
        int pv = findp(v);
        if(pu == pv) return 0;
        if(sz[pu] > sz[pv]){
            p[pv] = pu;
            sz[pu] += sz[pv];
        }
        else{
            p[pu] = pv;
            sz[pv] += sz[pu];
        }
        return 1;
    }

    void add_edge(int u, int v){
        edge[u].pb(v);
        edge[v].pb(u);
        deg[u]++;
        deg[v]++;
        if(deg[u] == 3) deg3++;
        if(deg[v] == 3) deg3++;
        if(!uni(u, v) and deg3 == 0){
            cyc++;
            cyclen = sz[findp(u)];
        }
    }
};

Graph G_now, G_check[4];

void Init(int N){
    n = N;
    G_now.init();
}

void Link(int u, int v){

    if(G_now.deg3 == 0){
        G_now.add_edge(u, v);

        if(G_now.deg3 > 0){
            if(G_now.deg[u] < G_now.deg[v]) swap(u, v);
            check_id = G_now.edge[u];
            check_id.pb(u);

            FOR(i, 0, 3, 1){
                G_check[i].init();
                FOR(uu, 0, n-1, 1){
                    if(uu == check_id[i]) continue;
                    for(int vv : G_now.edge[uu]){
                        if(vv == check_id[i] or uu < vv) continue;
                        G_check[i].add_edge(uu, vv);
                    }
                }
            }

            G_now.init();
            G_now.deg3 = 1;
        }

        return;
    }

    if(G_now.deg3 > 0){
        FOR(i, 0, 3, 1){
            if(u != check_id[i] and v != check_id[i]){
                G_check[i].add_edge(u, v);
            }
        }
    }

}

int CountCritical(){
    if(G_now.deg3 == 0){
        if(G_now.cyc == 0) return n;
        else if(G_now.cyc == 1) return G_now.cyclen;
        else return 0;
    }
    else{
        int ret = 0;
        FOR(i, 0, 3, 1){
            if(G_check[i].cyc == 0 and G_check[i].deg3 == 0) ret++;
            else{
                G_check[i].init();
                G_check[i].deg3 = 1;
            }
        }
        return ret;
    }
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 117708 KB Output is correct
2 Correct 57 ms 118612 KB Output is correct
3 Correct 57 ms 118724 KB Output is correct
4 Correct 52 ms 117780 KB Output is correct
5 Correct 55 ms 117836 KB Output is correct
6 Correct 54 ms 117972 KB Output is correct
7 Correct 54 ms 118132 KB Output is correct
8 Correct 53 ms 118012 KB Output is correct
9 Correct 57 ms 118848 KB Output is correct
10 Correct 57 ms 118864 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 140156 KB Output is correct
2 Runtime error 1189 ms 262144 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 117708 KB Output is correct
2 Correct 57 ms 118612 KB Output is correct
3 Correct 57 ms 118724 KB Output is correct
4 Correct 52 ms 117780 KB Output is correct
5 Correct 55 ms 117836 KB Output is correct
6 Correct 54 ms 117972 KB Output is correct
7 Correct 54 ms 118132 KB Output is correct
8 Correct 53 ms 118012 KB Output is correct
9 Correct 57 ms 118848 KB Output is correct
10 Correct 57 ms 118864 KB Output is correct
11 Correct 56 ms 118844 KB Output is correct
12 Correct 61 ms 119924 KB Output is correct
13 Correct 62 ms 119716 KB Output is correct
14 Correct 61 ms 119068 KB Output is correct
15 Correct 66 ms 119492 KB Output is correct
16 Correct 57 ms 118168 KB Output is correct
17 Correct 66 ms 119664 KB Output is correct
18 Correct 76 ms 120644 KB Output is correct
19 Correct 54 ms 118212 KB Output is correct
20 Correct 61 ms 119952 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 117708 KB Output is correct
2 Correct 57 ms 118612 KB Output is correct
3 Correct 57 ms 118724 KB Output is correct
4 Correct 52 ms 117780 KB Output is correct
5 Correct 55 ms 117836 KB Output is correct
6 Correct 54 ms 117972 KB Output is correct
7 Correct 54 ms 118132 KB Output is correct
8 Correct 53 ms 118012 KB Output is correct
9 Correct 57 ms 118848 KB Output is correct
10 Correct 57 ms 118864 KB Output is correct
11 Correct 56 ms 118844 KB Output is correct
12 Correct 61 ms 119924 KB Output is correct
13 Correct 62 ms 119716 KB Output is correct
14 Correct 61 ms 119068 KB Output is correct
15 Correct 66 ms 119492 KB Output is correct
16 Correct 57 ms 118168 KB Output is correct
17 Correct 66 ms 119664 KB Output is correct
18 Correct 76 ms 120644 KB Output is correct
19 Correct 54 ms 118212 KB Output is correct
20 Correct 61 ms 119952 KB Output is correct
21 Correct 65 ms 119372 KB Output is correct
22 Correct 75 ms 120256 KB Output is correct
23 Correct 80 ms 120944 KB Output is correct
24 Execution timed out 4090 ms 124944 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 117708 KB Output is correct
2 Correct 57 ms 118612 KB Output is correct
3 Correct 57 ms 118724 KB Output is correct
4 Correct 52 ms 117780 KB Output is correct
5 Correct 55 ms 117836 KB Output is correct
6 Correct 54 ms 117972 KB Output is correct
7 Correct 54 ms 118132 KB Output is correct
8 Correct 53 ms 118012 KB Output is correct
9 Correct 57 ms 118848 KB Output is correct
10 Correct 57 ms 118864 KB Output is correct
11 Correct 385 ms 140156 KB Output is correct
12 Runtime error 1189 ms 262144 KB Execution killed with signal 9
13 Halted 0 ms 0 KB -