답안 #50090 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
50090	2018-06-07T13:51:34 Z	top34051	낙하산 고리들 (IOI12_rings)	C++17	55 / 100	4000 ms	94628 KB

rings

#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;
map<int,int> ok;

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()) {
        ok.clear();
        if(deg[4].size()<=1) {
            for(auto u : deg[4]) if(check(u)) ok[u];
        }
        return ok.size();
    }
    if(deg[3].size()) {
        ok.clear();
        if(deg[3].size()<=3) {
            for(auto u : deg[3]) {
                if(check(u)) ok[u];
                for(auto v : way[u]) if(check(v)) ok[v];
            }
        }
        return ok.size();
    }
    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

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	27768 KB	Output is correct
2	Correct	29 ms	31952 KB	Output is correct
3	Correct	30 ms	32080 KB	Output is correct
4	Correct	25 ms	32080 KB	Output is correct
5	Correct	26 ms	32080 KB	Output is correct
6	Correct	28 ms	32080 KB	Output is correct
7	Correct	22 ms	32080 KB	Output is correct
8	Correct	26 ms	32080 KB	Output is correct
9	Correct	34 ms	32196 KB	Output is correct
10	Correct	33 ms	32196 KB	Output is correct

Subtask #2
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	510 ms	46512 KB	Output is correct
2	Correct	1076 ms	60592 KB	Output is correct
3	Correct	987 ms	60592 KB	Output is correct
4	Correct	1391 ms	63844 KB	Output is correct
5	Correct	1272 ms	64680 KB	Output is correct
6	Correct	1304 ms	94628 KB	Output is correct
7	Correct	854 ms	94628 KB	Output is correct
8	Correct	1939 ms	94628 KB	Output is correct
9	Correct	1546 ms	94628 KB	Output is correct
10	Correct	956 ms	94628 KB	Output is correct

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	27768 KB	Output is correct
2	Correct	29 ms	31952 KB	Output is correct
3	Correct	30 ms	32080 KB	Output is correct
4	Correct	25 ms	32080 KB	Output is correct
5	Correct	26 ms	32080 KB	Output is correct
6	Correct	28 ms	32080 KB	Output is correct
7	Correct	22 ms	32080 KB	Output is correct
8	Correct	26 ms	32080 KB	Output is correct
9	Correct	34 ms	32196 KB	Output is correct
10	Correct	33 ms	32196 KB	Output is correct
11	Correct	112 ms	94628 KB	Output is correct
12	Correct	113 ms	94628 KB	Output is correct
13	Correct	181 ms	94628 KB	Output is correct
14	Correct	93 ms	94628 KB	Output is correct
15	Correct	124 ms	94628 KB	Output is correct
16	Correct	85 ms	94628 KB	Output is correct
17	Correct	38 ms	94628 KB	Output is correct
18	Correct	53 ms	94628 KB	Output is correct
19	Correct	89 ms	94628 KB	Output is correct
20	Correct	187 ms	94628 KB	Output is correct

Subtask #4
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	27768 KB	Output is correct
2	Correct	29 ms	31952 KB	Output is correct
3	Correct	30 ms	32080 KB	Output is correct
4	Correct	25 ms	32080 KB	Output is correct
5	Correct	26 ms	32080 KB	Output is correct
6	Correct	28 ms	32080 KB	Output is correct
7	Correct	22 ms	32080 KB	Output is correct
8	Correct	26 ms	32080 KB	Output is correct
9	Correct	34 ms	32196 KB	Output is correct
10	Correct	33 ms	32196 KB	Output is correct
11	Correct	112 ms	94628 KB	Output is correct
12	Correct	113 ms	94628 KB	Output is correct
13	Correct	181 ms	94628 KB	Output is correct
14	Correct	93 ms	94628 KB	Output is correct
15	Correct	124 ms	94628 KB	Output is correct
16	Correct	85 ms	94628 KB	Output is correct
17	Correct	38 ms	94628 KB	Output is correct
18	Correct	53 ms	94628 KB	Output is correct
19	Correct	89 ms	94628 KB	Output is correct
20	Correct	187 ms	94628 KB	Output is correct
21	Execution timed out	4030 ms	94628 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

Subtask #5
0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	27768 KB	Output is correct
2	Correct	29 ms	31952 KB	Output is correct
3	Correct	30 ms	32080 KB	Output is correct
4	Correct	25 ms	32080 KB	Output is correct
5	Correct	26 ms	32080 KB	Output is correct
6	Correct	28 ms	32080 KB	Output is correct
7	Correct	22 ms	32080 KB	Output is correct
8	Correct	26 ms	32080 KB	Output is correct
9	Correct	34 ms	32196 KB	Output is correct
10	Correct	33 ms	32196 KB	Output is correct
11	Correct	510 ms	46512 KB	Output is correct
12	Correct	1076 ms	60592 KB	Output is correct
13	Correct	987 ms	60592 KB	Output is correct
14	Correct	1391 ms	63844 KB	Output is correct
15	Correct	1272 ms	64680 KB	Output is correct
16	Correct	1304 ms	94628 KB	Output is correct
17	Correct	854 ms	94628 KB	Output is correct
18	Correct	1939 ms	94628 KB	Output is correct
19	Correct	1546 ms	94628 KB	Output is correct
20	Correct	956 ms	94628 KB	Output is correct
21	Correct	112 ms	94628 KB	Output is correct
22	Correct	113 ms	94628 KB	Output is correct
23	Correct	181 ms	94628 KB	Output is correct
24	Correct	93 ms	94628 KB	Output is correct
25	Correct	124 ms	94628 KB	Output is correct
26	Correct	85 ms	94628 KB	Output is correct
27	Correct	38 ms	94628 KB	Output is correct
28	Correct	53 ms	94628 KB	Output is correct
29	Correct	89 ms	94628 KB	Output is correct
30	Correct	187 ms	94628 KB	Output is correct
31	Execution timed out	4030 ms	94628 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

답안 #50090

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 17.0 / 17.0

Subtask #3 18.0 / 18.0

Subtask #4 0 / 14.0

Subtask #5 0 / 31.0

Subtask #1
20.0 / 20.0

Subtask #2
17.0 / 17.0

Subtask #3
18.0 / 18.0

Subtask #4
0 / 14.0

Subtask #5
0 / 31.0