oj.uz

답안 #248550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
248550 2020-07-12T17:25:18 Z alexandra_udristoiu 낙하산 고리들 (IOI12_rings) C++14
52 / 100
 4000 ms 145344 KB 
#include<vector>
using namespace std;
const int dim = 1000005;
int n, nr3, nr4, m, num, nrcomp, nrcic, np;
int r[dim], g[dim], viz[dim], t[dim], frst[dim], cic[dim], rp[dim], r2[20][dim], nrc[20], nnod[20];
pair<int, int> w[dim];
vector<int> v[dim], g3, g4;
int rad(int x){
    while(r[x] > 0){
        x = r[x];
    }
    return x;
}
void uneste(int i, int x, int y){
    if(x == nnod[i] || y == nnod[i]){
        return;
    }
    int ax = x, ay = y, aux;
    while(r2[i][x] >= 0){
        x = r2[i][x];
    }
    while(r2[i][y] >= 0){
        y = r2[i][y];
    }
    while(r2[i][ax] > 0){
        aux = r2[i][ax];
        r2[i][ax] = x;
        ax = aux;
    }
    while(r2[i][ay] > 0){
        aux = r2[i][ay];
        r2[i][ay] = y;
        ay = aux;
    }
    if(x != y){
        nrc[i]++;
        if(r2[i][x] > r2[i][y]){
            r2[i][x] += r2[i][y];
            r2[i][y] = x;
        }
        else{
            r2[i][y] += r2[i][x];
            r2[i][x] = y;
        }
    }
}
void update(int nod){
    if(rp[nod] == 0 && g3.size() < 4 && g4.size() == 0){
        np++;
        rp[nod] = np;
        nnod[np] = nod;
        for(int i = 1; i <= m; i++){
            uneste(np, w[i].first, w[i].second);
        }
    }
}
void upd(int nod){
    if(g[nod] == 4){
        nr3--;
        nr4++;
        g4.push_back(nod);
    }
    else if(g[nod] == 3){
        nr3++;
        g3.push_back(nod);
        update(nod);
        for(int i = 0; i < v[nod].size(); i++){
            frst[ v[nod][i] ] = nod;
            update(v[nod][i]);
        }
    }
}
int verif(int nod){
    if(m - g[nod] != nrc[ rp[nod] ] ){
        return 0;
    }
    int i, n3 = 0;
    if(g[nod] == 3){
        n3++;
    }
    for(int i = 0; i < v[nod].size(); i++){
        if(g[ v[nod][i] ] == 3){
            n3++;
        }
    }
    if(n3 != nr3){
        return 0;
    }
    return 1;
}

void Init(int N) {
    n = N;
    for(int i = 0; i < n; i++){
        r[i] = -1;
        for(int ii = 1; ii <= 18; ii++){
            r2[ii][i] = -1;
        }
    }
}

static void dfs(int nod, int tt){
    t[nod] = tt;
    for(int i = 0; i < v[nod].size(); i++){
        if(v[nod][i] != tt){
            dfs(v[nod][i], nod);
        }
    }
}
void Link(int x, int y) {
    int r1, r2, nod;
    g[x]++;
    g[y]++;
    if(g[x] == 3){
        frst[y] = x;
        update(y);
    }
    if(g[y] == 3){
        frst[x] = y;
        update(x);
    }
    upd(x);
    upd(y);
    r1 = rad(x);
    r2 = rad(y);
    m++;
    if(r1 != r2){
        if(r[r1] < r[r2]){
            r[r1] += r[r2];
            r[r2] = r1;
            cic[r1] |= cic[r2];
        }
        else{
            r[r2] += r[r1];
            r[r1] = r2;
            cic[r2] |= cic[r1];
            swap(r1, r2);
        }
    }
    else{
        nrcic++;
        if(nrcic == 1){
            t[x] = -1;
            dfs(x, -1);
            nod = y;
            while(nod != -1){
                viz[nod] = 1;
                nod = t[nod];
                num++;
            }
        }
        if(cic[r1] == 0){
            nrcomp++;
            cic[r1] = 1;
        }
    }
    v[x].push_back(y);
    v[y].push_back(x);
    w[m] = make_pair(x, y);
    for(int i = 1; i <= np; i++){
        uneste(i, x, y);
    }
}

int CountCritical() {
    if(nr4 > 1){
        return 0;
    }
    if(nr4 == 1){
        return verif(g4[0]);
    }
    if(nr3 > 3){
        return 0;
    }
    if(nr3 != 0){
        int nr = 0;
        for(int i = 0; i < nr3; i++){
            nr += verif(g3[i]);
            int nod = g3[i];
            for(int j = 0; j < v[nod].size(); j++){
                if(frst[ v[nod][j] ] == nod && g[ v[nod][j] ] < 3){
                    nr += verif(v[nod][j]);
                }
            }
        }
        return nr;
    }
    if(nrcomp > 1){
        return 0;
    }
    if(nrcomp == 1){
        return num;
    }
    return n;
}

Compilation message

rings.cpp: In function 'void upd(int)':
rings.cpp:67:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < v[nod].size(); i++){
                        ~~^~~~~~~~~~~~~~~
rings.cpp: In function 'int verif(int)':
rings.cpp:81:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < v[nod].size(); i++){
                    ~~^~~~~~~~~~~~~~~
rings.cpp:77:9: warning: unused variable 'i' [-Wunused-variable]
     int i, n3 = 0;
         ^
rings.cpp: In function 'void dfs(int, int)':
rings.cpp:104:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < v[nod].size(); i++){
                    ~~^~~~~~~~~~~~~~~
rings.cpp: In function 'int CountCritical()':
rings.cpp:180:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = 0; j < v[nod].size(); j++){
                            ~~^~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23936 KB Output is correct
2 Correct 15 ms 24576 KB Output is correct
3 Correct 15 ms 24576 KB Output is correct
4 Correct 13 ms 24064 KB Output is correct
5 Correct 14 ms 24448 KB Output is correct
6 Correct 16 ms 24832 KB Output is correct
7 Correct 13 ms 24448 KB Output is correct
8 Correct 21 ms 24568 KB Output is correct
9 Correct 15 ms 24704 KB Output is correct
10 Correct 19 ms 24704 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 466 ms 87032 KB Output is correct
2 Correct 1229 ms 121156 KB Output is correct
3 Execution timed out 4064 ms 145344 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23936 KB Output is correct
2 Correct 15 ms 24576 KB Output is correct
3 Correct 15 ms 24576 KB Output is correct
4 Correct 13 ms 24064 KB Output is correct
5 Correct 14 ms 24448 KB Output is correct
6 Correct 16 ms 24832 KB Output is correct
7 Correct 13 ms 24448 KB Output is correct
8 Correct 21 ms 24568 KB Output is correct
9 Correct 15 ms 24704 KB Output is correct
10 Correct 19 ms 24704 KB Output is correct
11 Correct 22 ms 24704 KB Output is correct
12 Correct 27 ms 25344 KB Output is correct
13 Correct 20 ms 25344 KB Output is correct
14 Correct 18 ms 25216 KB Output is correct
15 Correct 18 ms 26112 KB Output is correct
16 Correct 18 ms 25344 KB Output is correct
17 Correct 20 ms 25368 KB Output is correct
18 Correct 26 ms 26360 KB Output is correct
19 Correct 24 ms 25336 KB Output is correct
20 Correct 23 ms 25216 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23936 KB Output is correct
2 Correct 15 ms 24576 KB Output is correct
3 Correct 15 ms 24576 KB Output is correct
4 Correct 13 ms 24064 KB Output is correct
5 Correct 14 ms 24448 KB Output is correct
6 Correct 16 ms 24832 KB Output is correct
7 Correct 13 ms 24448 KB Output is correct
8 Correct 21 ms 24568 KB Output is correct
9 Correct 15 ms 24704 KB Output is correct
10 Correct 19 ms 24704 KB Output is correct
11 Correct 22 ms 24704 KB Output is correct
12 Correct 27 ms 25344 KB Output is correct
13 Correct 20 ms 25344 KB Output is correct
14 Correct 18 ms 25216 KB Output is correct
15 Correct 18 ms 26112 KB Output is correct
16 Correct 18 ms 25344 KB Output is correct
17 Correct 20 ms 25368 KB Output is correct
18 Correct 26 ms 26360 KB Output is correct
19 Correct 24 ms 25336 KB Output is correct
20 Correct 23 ms 25216 KB Output is correct
21 Correct 45 ms 29304 KB Output is correct
22 Correct 59 ms 32528 KB Output is correct
23 Correct 72 ms 34684 KB Output is correct
24 Correct 1200 ms 34468 KB Output is correct
25 Correct 361 ms 33400 KB Output is correct
26 Correct 73 ms 34936 KB Output is correct
27 Correct 63 ms 34428 KB Output is correct
28 Correct 127 ms 35192 KB Output is correct
29 Correct 86 ms 34552 KB Output is correct
30 Correct 76 ms 37240 KB Output is correct

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23936 KB Output is correct
2 Correct 15 ms 24576 KB Output is correct
3 Correct 15 ms 24576 KB Output is correct
4 Correct 13 ms 24064 KB Output is correct
5 Correct 14 ms 24448 KB Output is correct
6 Correct 16 ms 24832 KB Output is correct
7 Correct 13 ms 24448 KB Output is correct
8 Correct 21 ms 24568 KB Output is correct
9 Correct 15 ms 24704 KB Output is correct
10 Correct 19 ms 24704 KB Output is correct
11 Correct 466 ms 87032 KB Output is correct
12 Correct 1229 ms 121156 KB Output is correct
13 Execution timed out 4064 ms 145344 KB Time limit exceeded
14 Halted 0 ms 0 KB -