oj.uz

Submission #50107

# Submission time Handle Problem Language Result Execution time Memory
50107 2018-06-07T14:33:02 Z top34051 Parachute rings (IOI12_rings) C++17
55 / 100
 4000 ms 94828 KB 
#include<bits/stdc++.h>
using namespace std;

const int maxn = 1e6 + 5;

int n;
vector<int> way[maxn];
vector<int> deg[10];
int cut[maxn];
int sz, cy, vis[maxn];
stack<int> st;
int ok[maxn];

void Init(int _n) {
    n = _n;
}

void cycle(int u, int last, int ban) {
    if(vis[u]) {
        while(!st.empty()) {
            int v = st.top(); st.pop();
            sz++;
            if(v==u) break;
        }
        cy++;
        return ;
    }
    vis[u] = 1; st.push(u);
    for(auto v : way[u]) {
        if(v!=ban && v!=last && vis[v]<2) {
            cycle(v,u,ban);
        }
    }
    vis[u] = 2;
    if(!st.empty()) st.pop();
}

int check(int u) {
    memset(cut,0,sizeof(cut));
    for(auto v : way[u]) cut[v]++;
    for(int i=1;i<=n;i++) if(i!=u && way[i].size()-cut[i]>2) return 0;
    sz = cy = 0; memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++) if(i!=u && !vis[i]) cycle(i,0,u);
    return cy==0;
}

int CountCritical() {
    for(int i=0;i<=4;i++) deg[i].clear();
    for(int x=1;x<=n;x++) deg[min(4,(int)way[x].size())].push_back(x);
    if(deg[4].size()) {
        memset(ok,0,sizeof(ok));
        if(deg[4].size()<=1) {
            for(auto u : deg[4]) if(check(u)) ok[u] = 1;
        }
        int res = 0;
        for(int x=1;x<=n;x++) res += ok[x];
        return res;
    }
    if(deg[3].size()) {
        memset(ok,0,sizeof(ok));
        if(deg[3].size()<=3) {
            for(auto u : deg[3]) {
                if(check(u)) ok[u] = 1;
                for(auto v : way[u]) if(check(v)) ok[v] = 1;
            }
        }
        int res = 0;
        for(int x=1;x<=n;x++) res += ok[x];
        return res;
    }
    sz = cy = 0; memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++) if(!vis[i]) cycle(i,0,0);
    if(cy==0) return n;
    else if(cy==1) return sz;
    else return 0;
}

void Link(int x, int y) {
    x++; y++;
    way[x].push_back(y); way[y].push_back(x);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 27768 KB Output is correct
2 Correct 34 ms 35916 KB Output is correct
3 Correct 35 ms 35916 KB Output is correct
4 Correct 26 ms 35916 KB Output is correct
5 Correct 27 ms 35916 KB Output is correct
6 Correct 28 ms 35916 KB Output is correct
7 Correct 27 ms 35916 KB Output is correct
8 Correct 28 ms 35916 KB Output is correct
9 Correct 41 ms 36052 KB Output is correct
10 Correct 36 ms 36052 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 549 ms 46632 KB Output is correct
2 Correct 1119 ms 64460 KB Output is correct
3 Correct 935 ms 64460 KB Output is correct
4 Correct 1259 ms 64460 KB Output is correct
5 Correct 1262 ms 64672 KB Output is correct
6 Correct 1251 ms 94828 KB Output is correct
7 Correct 910 ms 94828 KB Output is correct
8 Correct 1931 ms 94828 KB Output is correct
9 Correct 1495 ms 94828 KB Output is correct
10 Correct 935 ms 94828 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 27768 KB Output is correct
2 Correct 34 ms 35916 KB Output is correct
3 Correct 35 ms 35916 KB Output is correct
4 Correct 26 ms 35916 KB Output is correct
5 Correct 27 ms 35916 KB Output is correct
6 Correct 28 ms 35916 KB Output is correct
7 Correct 27 ms 35916 KB Output is correct
8 Correct 28 ms 35916 KB Output is correct
9 Correct 41 ms 36052 KB Output is correct
10 Correct 36 ms 36052 KB Output is correct
11 Correct 124 ms 94828 KB Output is correct
12 Correct 117 ms 94828 KB Output is correct
13 Correct 201 ms 94828 KB Output is correct
14 Correct 110 ms 94828 KB Output is correct
15 Correct 138 ms 94828 KB Output is correct
16 Correct 88 ms 94828 KB Output is correct
17 Correct 63 ms 94828 KB Output is correct
18 Correct 78 ms 94828 KB Output is correct
19 Correct 92 ms 94828 KB Output is correct
20 Correct 208 ms 94828 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 27768 KB Output is correct
2 Correct 34 ms 35916 KB Output is correct
3 Correct 35 ms 35916 KB Output is correct
4 Correct 26 ms 35916 KB Output is correct
5 Correct 27 ms 35916 KB Output is correct
6 Correct 28 ms 35916 KB Output is correct
7 Correct 27 ms 35916 KB Output is correct
8 Correct 28 ms 35916 KB Output is correct
9 Correct 41 ms 36052 KB Output is correct
10 Correct 36 ms 36052 KB Output is correct
11 Correct 124 ms 94828 KB Output is correct
12 Correct 117 ms 94828 KB Output is correct
13 Correct 201 ms 94828 KB Output is correct
14 Correct 110 ms 94828 KB Output is correct
15 Correct 138 ms 94828 KB Output is correct
16 Correct 88 ms 94828 KB Output is correct
17 Correct 63 ms 94828 KB Output is correct
18 Correct 78 ms 94828 KB Output is correct
19 Correct 92 ms 94828 KB Output is correct
20 Correct 208 ms 94828 KB Output is correct
21 Execution timed out 4019 ms 94828 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 27768 KB Output is correct
2 Correct 34 ms 35916 KB Output is correct
3 Correct 35 ms 35916 KB Output is correct
4 Correct 26 ms 35916 KB Output is correct
5 Correct 27 ms 35916 KB Output is correct
6 Correct 28 ms 35916 KB Output is correct
7 Correct 27 ms 35916 KB Output is correct
8 Correct 28 ms 35916 KB Output is correct
9 Correct 41 ms 36052 KB Output is correct
10 Correct 36 ms 36052 KB Output is correct
11 Correct 549 ms 46632 KB Output is correct
12 Correct 1119 ms 64460 KB Output is correct
13 Correct 935 ms 64460 KB Output is correct
14 Correct 1259 ms 64460 KB Output is correct
15 Correct 1262 ms 64672 KB Output is correct
16 Correct 1251 ms 94828 KB Output is correct
17 Correct 910 ms 94828 KB Output is correct
18 Correct 1931 ms 94828 KB Output is correct
19 Correct 1495 ms 94828 KB Output is correct
20 Correct 935 ms 94828 KB Output is correct
21 Correct 124 ms 94828 KB Output is correct
22 Correct 117 ms 94828 KB Output is correct
23 Correct 201 ms 94828 KB Output is correct
24 Correct 110 ms 94828 KB Output is correct
25 Correct 138 ms 94828 KB Output is correct
26 Correct 88 ms 94828 KB Output is correct
27 Correct 63 ms 94828 KB Output is correct
28 Correct 78 ms 94828 KB Output is correct
29 Correct 92 ms 94828 KB Output is correct
30 Correct 208 ms 94828 KB Output is correct
31 Execution timed out 4019 ms 94828 KB Time limit exceeded
32 Halted 0 ms 0 KB -