답안 #366964

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
366964	2021-02-15T21:00:47 Z	MilosMilutinovic	슈퍼트리 잇기 (IOI20_supertrees)	C++14	40 / 100	290 ms	30316 KB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define pb push_back
const int N=1050;
vector<int> E[N];
void AddEdge(int u,int v){E[u].pb(v),E[v].pb(u);}
bool was[N];
vector<int> Euler;
vector<vector<int>> p;
void DFS(int u){
	was[u]=true,Euler.pb(u);
	for(int v:E[u])if(!was[v]&&p[u][v]==1)DFS(v);
}
void DFS1(int u){
	was[u]=true,Euler.pb(u);
	for(int v:E[u])if(!was[v]&&p[u][v]==2)DFS1(v);
}
int construct(vector<vector<int>> P){
	p=P;int n=(int)p.size();
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==3)return 0;
	for(int i=0;i<n;i++)for(int j=i;j<n;j++)if(p[i][j]>0)AddEdge(i,j);
	bool one=true,two=true;
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==1)two=false;
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==2)one=false;
	vector<vector<int>> ans(n,vector<int>(n,0));
	vector<int> root;
	for(int i=0;i<n;i++){
		if(!was[i]){
			DFS(i);
			if(one){
				for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]==0)return 0;
			}
			root.pb(i);
			for(int j=1;j<(int)Euler.size();j++){
				int x=Euler[j],y=Euler[j-1];
				ans[x][y]=ans[y][x]=1;
			}
			Euler.clear();
		}
	}
	for(int i=0;i<n;i++)was[i]=false;
	for(int i=0;i<n;i++){
		if(!was[i]){
			DFS1(i);
			if((int)Euler.size()==2)return 0;
			for(int j=1;j<(int)Euler.size();j++){
				int x=Euler[j],y=Euler[j-1];
				ans[x][y]=ans[y][x]=1;
			}
			for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]==0)return 0;
			if((int)Euler.size()>2){
				int x=Euler[0],y=Euler.back();
				ans[x][y]=ans[y][x]=1;
			}
			Euler.clear();
		}
	}
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:23:16: warning: variable 'two' set but not used [-Wunused-but-set-variable]
   23 |  bool one=true,two=true;
      |                ^~~

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	11 ms	1644 KB	Output is correct
7	Correct	260 ms	30316 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	11 ms	1644 KB	Output is correct
7	Correct	260 ms	30316 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	14 ms	1516 KB	Output is correct
13	Correct	259 ms	26336 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	7 ms	1132 KB	Output is correct
17	Correct	121 ms	19180 KB	Output is correct
18	Correct	1 ms	380 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Correct	63 ms	6892 KB	Output is correct
21	Correct	252 ms	26604 KB	Output is correct
22	Correct	249 ms	26092 KB	Output is correct
23	Correct	265 ms	28268 KB	Output is correct
24	Correct	268 ms	26220 KB	Output is correct
25	Correct	111 ms	16748 KB	Output is correct
26	Correct	102 ms	16236 KB	Output is correct
27	Correct	290 ms	29420 KB	Output is correct
28	Correct	247 ms	26092 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	396 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	14 ms	1388 KB	Output is correct
9	Correct	249 ms	26092 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	15 ms	1644 KB	Output is correct
13	Correct	270 ms	30316 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	6 ms	1280 KB	Output is correct
17	Correct	118 ms	19052 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	0 ms	364 KB	Output is correct
21	Correct	64 ms	7020 KB	Output is correct
22	Correct	253 ms	26616 KB	Output is correct
23	Correct	256 ms	26220 KB	Output is correct
24	Correct	266 ms	29292 KB	Output is correct
25	Correct	108 ms	16364 KB	Output is correct
26	Correct	105 ms	16876 KB	Output is correct
27	Correct	250 ms	26092 KB	Output is correct
28	Correct	271 ms	28156 KB	Output is correct
29	Correct	101 ms	16236 KB	Output is correct

Subtask #4
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	64 ms	7020 KB	Output is correct
5	Correct	251 ms	26604 KB	Output is correct
6	Correct	252 ms	26220 KB	Output is correct
7	Correct	273 ms	28140 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	63 ms	6892 KB	Output is correct
10	Correct	266 ms	26604 KB	Output is correct
11	Correct	249 ms	26092 KB	Output is correct
12	Correct	270 ms	29292 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Incorrect	1 ms	364 KB	Too many ways to get from 0 to 4, should be 1 found no less than 2
16	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	11 ms	1644 KB	Output is correct
7	Correct	260 ms	30316 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	14 ms	1516 KB	Output is correct
13	Correct	259 ms	26336 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	7 ms	1132 KB	Output is correct
17	Correct	121 ms	19180 KB	Output is correct
18	Correct	1 ms	380 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Correct	63 ms	6892 KB	Output is correct
21	Correct	252 ms	26604 KB	Output is correct
22	Correct	249 ms	26092 KB	Output is correct
23	Correct	265 ms	28268 KB	Output is correct
24	Correct	268 ms	26220 KB	Output is correct
25	Correct	111 ms	16748 KB	Output is correct
26	Correct	102 ms	16236 KB	Output is correct
27	Correct	290 ms	29420 KB	Output is correct
28	Correct	247 ms	26092 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	396 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	0 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	0 ms	364 KB	Output is correct
35	Correct	1 ms	512 KB	Output is correct
36	Correct	14 ms	1388 KB	Output is correct
37	Correct	249 ms	26092 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	15 ms	1644 KB	Output is correct
41	Correct	270 ms	30316 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	6 ms	1280 KB	Output is correct
45	Correct	118 ms	19052 KB	Output is correct
46	Correct	1 ms	364 KB	Output is correct
47	Correct	1 ms	364 KB	Output is correct
48	Correct	0 ms	364 KB	Output is correct
49	Correct	64 ms	7020 KB	Output is correct
50	Correct	253 ms	26616 KB	Output is correct
51	Correct	256 ms	26220 KB	Output is correct
52	Correct	266 ms	29292 KB	Output is correct
53	Correct	108 ms	16364 KB	Output is correct
54	Correct	105 ms	16876 KB	Output is correct
55	Correct	250 ms	26092 KB	Output is correct
56	Correct	271 ms	28156 KB	Output is correct
57	Correct	101 ms	16236 KB	Output is correct
58	Correct	1 ms	364 KB	Output is correct
59	Correct	0 ms	364 KB	Output is correct
60	Correct	5 ms	1260 KB	Output is correct
61	Correct	121 ms	20716 KB	Output is correct
62	Correct	1 ms	364 KB	Output is correct
63	Correct	1 ms	364 KB	Output is correct
64	Correct	1 ms	364 KB	Output is correct
65	Incorrect	63 ms	6892 KB	Too many ways to get from 1 to 256, should be 2 found no less than 3
66	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	512 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	11 ms	1644 KB	Output is correct
7	Correct	260 ms	30316 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	14 ms	1516 KB	Output is correct
13	Correct	259 ms	26336 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	7 ms	1132 KB	Output is correct
17	Correct	121 ms	19180 KB	Output is correct
18	Correct	1 ms	380 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Correct	63 ms	6892 KB	Output is correct
21	Correct	252 ms	26604 KB	Output is correct
22	Correct	249 ms	26092 KB	Output is correct
23	Correct	265 ms	28268 KB	Output is correct
24	Correct	268 ms	26220 KB	Output is correct
25	Correct	111 ms	16748 KB	Output is correct
26	Correct	102 ms	16236 KB	Output is correct
27	Correct	290 ms	29420 KB	Output is correct
28	Correct	247 ms	26092 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	396 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	0 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	0 ms	364 KB	Output is correct
35	Correct	1 ms	512 KB	Output is correct
36	Correct	14 ms	1388 KB	Output is correct
37	Correct	249 ms	26092 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	15 ms	1644 KB	Output is correct
41	Correct	270 ms	30316 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	6 ms	1280 KB	Output is correct
45	Correct	118 ms	19052 KB	Output is correct
46	Correct	1 ms	364 KB	Output is correct
47	Correct	1 ms	364 KB	Output is correct
48	Correct	0 ms	364 KB	Output is correct
49	Correct	64 ms	7020 KB	Output is correct
50	Correct	253 ms	26616 KB	Output is correct
51	Correct	256 ms	26220 KB	Output is correct
52	Correct	266 ms	29292 KB	Output is correct
53	Correct	108 ms	16364 KB	Output is correct
54	Correct	105 ms	16876 KB	Output is correct
55	Correct	250 ms	26092 KB	Output is correct
56	Correct	271 ms	28156 KB	Output is correct
57	Correct	101 ms	16236 KB	Output is correct
58	Correct	1 ms	364 KB	Output is correct
59	Correct	1 ms	364 KB	Output is correct
60	Correct	1 ms	364 KB	Output is correct
61	Correct	64 ms	7020 KB	Output is correct
62	Correct	251 ms	26604 KB	Output is correct
63	Correct	252 ms	26220 KB	Output is correct
64	Correct	273 ms	28140 KB	Output is correct
65	Correct	1 ms	364 KB	Output is correct
66	Correct	63 ms	6892 KB	Output is correct
67	Correct	266 ms	26604 KB	Output is correct
68	Correct	249 ms	26092 KB	Output is correct
69	Correct	270 ms	29292 KB	Output is correct
70	Correct	1 ms	364 KB	Output is correct
71	Correct	0 ms	364 KB	Output is correct
72	Incorrect	1 ms	364 KB	Too many ways to get from 0 to 4, should be 1 found no less than 2
73	Halted	0 ms	0 KB	-

답안 #366964

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 19.0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
19.0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0