oj.uz

Submission #49514

# Submission time Handle Problem Language Result Execution time Memory
49514 2018-05-30T06:30:53 Z ho94949 Parachute rings (IOI12_rings) C++17
69 / 100
 1776 ms 94648 KB 
#include<vector>
#include<algorithm>
using namespace std;

const int MAXN = 1048576;

struct UF
{
    int N;
    int ufd[MAXN];
    UF(){}
    UF(int n):N(n)
    {
        for(int i=0; i<n; ++i) ufd[i] = i;
    }
    int Find(int a)
    {
        if(a==ufd[a]) return a;
        return ufd[a] = Find(ufd[a]);
    }
    bool Union(int a, int b)
    {
        a = Find(a); b = Find(b);
        if(a==b) return false;
        ufd[a] = b; return true;
    }
};

struct DAT
{
    int N; UF uf; int numcyc; int cyclen;
    DAT(){};
    DAT(int n): N(n), uf(n), numcyc(0), cyclen(0){}
    void Add(int a, int b)
    {
        if(!uf.Union(a, b)) 
            if(++numcyc == 1)
                for(int i=0; i<N; ++i)
                    if(uf.Find(i) == uf.Find(a))
                        ++cyclen;
    }
};
enum PHASE {DEG2, DEG3_1, DEG3_2, DEG3_3, SP1, INF};
PHASE state;

DAT global;


int N, M;
pair<int, int> EList[MAXN];
vector<int> conn[MAXN];
int deg[MAXN], numdeg[5];

vector<int> specials;
vector<DAT> datas;

void Init(int _N) {
    N = _N; M = 0; numdeg[0] = N;
    DAT d(N); global = d;
    state = DEG2;
}
void updatespecials()
{
    for(auto x: specials)
    {
        DAT d(N);
        for(int i=0; i<M; ++i)
        {
            if(EList[i].first == x || EList[i].second == x) continue;
            d.Add(EList[i].first, EList[i].second);
        }
        datas.push_back(d);
    }
}
void makestate(PHASE state)
{
    specials.clear(); datas.clear();
    if(numdeg[4] == 0)
    {
        for(int i=0; i<N; ++i)
        {
            int cnt = (deg[i] >= 3)?1:0;
            for(auto x: conn[i])
                if(deg[x] >= 3) ++cnt;
            if(cnt == numdeg[3] + numdeg[4])
                specials.push_back(i);
        }
    }
    else
    {
        for(int i=0; i<N; ++i)
            if(deg[i] >= 4)
                specials.push_back(i);                
    }
    updatespecials();
}

void updatestate(PHASE state, int A, int B)
{
    switch(state)
    {
        case DEG2:
            global.Add(A, B);
            break;
        default:
            for(int i=0; i<specials.size(); ++i)
            {
                if(specials[i] == A || specials[i] == B) continue;
                datas[i].Add(A, B);
            }
            break;
    }
}

void Link(int A, int B) {
    if(state == INF) return;
    EList[M++] = make_pair(A, B);
    numdeg[min(4, deg[A])]--; numdeg[min(4, deg[B])]--;
    deg[A]++; deg[B]++;
    numdeg[min(4, deg[A])]++; numdeg[min(4, deg[B])]++;
    conn[A].push_back(B);
    conn[B].push_back(A);
    
    PHASE newstate = DEG2;
    if(numdeg[4] >= 2){ state = INF; return;}
    else if(numdeg[4] == 1 || numdeg[3] >= 4) newstate = SP1;
    else if(numdeg[3] == 3) newstate = DEG3_3;
    else if(numdeg[3] == 2) newstate = DEG3_2;
    else if(numdeg[3] == 1) newstate = DEG3_1;
    else newstate = DEG2;
    if(state != newstate)
    {
        state = newstate;
        makestate(state);
    }
    else updatestate(state, A, B);
}
#include<cstdio>
int CountCritical() {
    //if(state == DEG2) puts("DEG2");
    //printf(">%d %d\n", state, (int)datas.size());
    int ans = 0;
    switch(state)
    {
    case DEG2:
        switch(global.numcyc)
        {
            case 0: return N;
            case 1: return global.cyclen;
            default: return 0;
        }
    case INF:
        return 0;
    default:
        for(const auto& x: datas)
            if(x.numcyc==0) ++ans;
        return ans;
    }
}

Compilation message

rings.cpp: In function 'void updatestate(PHASE, int, int)':
rings.cpp:106:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0; i<specials.size(); ++i)
                          ~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 29048 KB Output is correct
2 Correct 48 ms 49776 KB Output is correct
3 Correct 49 ms 49820 KB Output is correct
4 Correct 26 ms 49820 KB Output is correct
5 Correct 30 ms 49820 KB Output is correct
6 Correct 29 ms 49820 KB Output is correct
7 Correct 48 ms 50052 KB Output is correct
8 Correct 32 ms 50052 KB Output is correct
9 Correct 51 ms 50132 KB Output is correct
10 Correct 51 ms 50132 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 53956 KB Output is correct
2 Correct 1160 ms 83312 KB Output is correct
3 Correct 373 ms 83312 KB Output is correct
4 Correct 1548 ms 83312 KB Output is correct
5 Correct 1473 ms 83312 KB Output is correct
6 Correct 1502 ms 83312 KB Output is correct
7 Correct 358 ms 83312 KB Output is correct
8 Correct 1617 ms 89764 KB Output is correct
9 Correct 1776 ms 94648 KB Output is correct
10 Correct 950 ms 94648 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 29048 KB Output is correct
2 Correct 48 ms 49776 KB Output is correct
3 Correct 49 ms 49820 KB Output is correct
4 Correct 26 ms 49820 KB Output is correct
5 Correct 30 ms 49820 KB Output is correct
6 Correct 29 ms 49820 KB Output is correct
7 Correct 48 ms 50052 KB Output is correct
8 Correct 32 ms 50052 KB Output is correct
9 Correct 51 ms 50132 KB Output is correct
10 Correct 51 ms 50132 KB Output is correct
11 Correct 52 ms 94648 KB Output is correct
12 Correct 56 ms 94648 KB Output is correct
13 Correct 59 ms 94648 KB Output is correct
14 Correct 57 ms 94648 KB Output is correct
15 Correct 52 ms 94648 KB Output is correct
16 Correct 32 ms 94648 KB Output is correct
17 Correct 53 ms 94648 KB Output is correct
18 Correct 57 ms 94648 KB Output is correct
19 Correct 34 ms 94648 KB Output is correct
20 Correct 56 ms 94648 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 29048 KB Output is correct
2 Correct 48 ms 49776 KB Output is correct
3 Correct 49 ms 49820 KB Output is correct
4 Correct 26 ms 49820 KB Output is correct
5 Correct 30 ms 49820 KB Output is correct
6 Correct 29 ms 49820 KB Output is correct
7 Correct 48 ms 50052 KB Output is correct
8 Correct 32 ms 50052 KB Output is correct
9 Correct 51 ms 50132 KB Output is correct
10 Correct 51 ms 50132 KB Output is correct
11 Correct 52 ms 94648 KB Output is correct
12 Correct 56 ms 94648 KB Output is correct
13 Correct 59 ms 94648 KB Output is correct
14 Correct 57 ms 94648 KB Output is correct
15 Correct 52 ms 94648 KB Output is correct
16 Correct 32 ms 94648 KB Output is correct
17 Correct 53 ms 94648 KB Output is correct
18 Correct 57 ms 94648 KB Output is correct
19 Correct 34 ms 94648 KB Output is correct
20 Correct 56 ms 94648 KB Output is correct
21 Correct 48 ms 94648 KB Output is correct
22 Correct 61 ms 94648 KB Output is correct
23 Correct 71 ms 94648 KB Output is correct
24 Correct 97 ms 94648 KB Output is correct
25 Correct 71 ms 94648 KB Output is correct
26 Correct 102 ms 94648 KB Output is correct
27 Correct 84 ms 94648 KB Output is correct
28 Correct 110 ms 94648 KB Output is correct
29 Correct 77 ms 94648 KB Output is correct
30 Correct 91 ms 94648 KB Output is correct

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 29048 KB Output is correct
2 Correct 48 ms 49776 KB Output is correct
3 Correct 49 ms 49820 KB Output is correct
4 Correct 26 ms 49820 KB Output is correct
5 Correct 30 ms 49820 KB Output is correct
6 Correct 29 ms 49820 KB Output is correct
7 Correct 48 ms 50052 KB Output is correct
8 Correct 32 ms 50052 KB Output is correct
9 Correct 51 ms 50132 KB Output is correct
10 Correct 51 ms 50132 KB Output is correct
11 Correct 493 ms 53956 KB Output is correct
12 Correct 1160 ms 83312 KB Output is correct
13 Correct 373 ms 83312 KB Output is correct
14 Correct 1548 ms 83312 KB Output is correct
15 Correct 1473 ms 83312 KB Output is correct
16 Correct 1502 ms 83312 KB Output is correct
17 Correct 358 ms 83312 KB Output is correct
18 Correct 1617 ms 89764 KB Output is correct
19 Correct 1776 ms 94648 KB Output is correct
20 Correct 950 ms 94648 KB Output is correct
21 Correct 52 ms 94648 KB Output is correct
22 Correct 56 ms 94648 KB Output is correct
23 Correct 59 ms 94648 KB Output is correct
24 Correct 57 ms 94648 KB Output is correct
25 Correct 52 ms 94648 KB Output is correct
26 Correct 32 ms 94648 KB Output is correct
27 Correct 53 ms 94648 KB Output is correct
28 Correct 57 ms 94648 KB Output is correct
29 Correct 34 ms 94648 KB Output is correct
30 Correct 56 ms 94648 KB Output is correct
31 Correct 48 ms 94648 KB Output is correct
32 Correct 61 ms 94648 KB Output is correct
33 Correct 71 ms 94648 KB Output is correct
34 Correct 97 ms 94648 KB Output is correct
35 Correct 71 ms 94648 KB Output is correct
36 Correct 102 ms 94648 KB Output is correct
37 Correct 84 ms 94648 KB Output is correct
38 Correct 110 ms 94648 KB Output is correct
39 Correct 77 ms 94648 KB Output is correct
40 Correct 91 ms 94648 KB Output is correct
41 Correct 264 ms 94648 KB Output is correct
42 Correct 680 ms 94648 KB Output is correct
43 Correct 317 ms 94648 KB Output is correct
44 Correct 386 ms 94648 KB Output is correct
45 Incorrect 584 ms 94648 KB Output isn't correct
46 Halted 0 ms 0 KB -