Submission #366960

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
366960	2021-02-15T20:34:08 Z	MilosMilutinovic	Connecting Supertrees (IOI20_supertrees)	C++14	40 / 100	298 ms	26988 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> comp;
void DFS(int u){
	was[u]=true,comp.push_back(u);
	for(int v:E[u])if(!was[v])DFS(v);
}
int construct(vector<vector<int>> 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);
	vector<vector<int>> ans(n,vector<int>(n,0));
	bool two=false;
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==2)two=true;
	for(int i=0;i<n;i++){
		if(!was[i]){
			DFS(i);
			if(two&&(int)comp.size()==2)return 0;
			for(int x:comp)for(int y:comp)if(x!=y&&p[x][y]==0)return 0;
			for(int i=1;i<(int)comp.size();i++){
				int x=comp[i],y=comp[i-1];
				ans[x][y]=ans[y][x]=1;
			}
			if(two&&(int)comp.size()>=3){
				int x=comp[0],y=comp.back();
				ans[x][y]=ans[y][x]=1;
			}
			comp.clear();
		}
	}
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	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	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	11 ms	1516 KB	Output is correct
7	Correct	260 ms	26220 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	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	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	11 ms	1516 KB	Output is correct
7	Correct	260 ms	26220 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	0 ms	364 KB	Output is correct
12	Correct	11 ms	1260 KB	Output is correct
13	Correct	285 ms	22148 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	1004 KB	Output is correct
17	Correct	120 ms	15232 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	65 ms	5868 KB	Output is correct
21	Correct	256 ms	22764 KB	Output is correct
22	Correct	271 ms	22140 KB	Output is correct
23	Correct	263 ms	24172 KB	Output is correct
24	Correct	254 ms	22252 KB	Output is correct
25	Correct	128 ms	12908 KB	Output is correct
26	Correct	106 ms	12284 KB	Output is correct
27	Correct	298 ms	25196 KB	Output is correct
28	Correct	277 ms	22124 KB	Output is correct

Subtask #3
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	11 ms	1260 KB	Output is correct
9	Correct	251 ms	22124 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	12 ms	1516 KB	Output is correct
13	Correct	268 ms	26220 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	5 ms	1004 KB	Output is correct
17	Correct	119 ms	15100 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	63 ms	5868 KB	Output is correct
22	Correct	263 ms	22764 KB	Output is correct
23	Correct	264 ms	22268 KB	Output is correct
24	Correct	276 ms	25452 KB	Output is correct
25	Correct	107 ms	12396 KB	Output is correct
26	Correct	108 ms	12908 KB	Output is correct
27	Correct	252 ms	22252 KB	Output is correct
28	Correct	270 ms	24300 KB	Output is correct
29	Correct	107 ms	12268 KB	Output is correct

Subtask #4
0 / 35.0

#	Verdict	Execution time	Memory	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	6380 KB	Output is correct
5	Correct	259 ms	24300 KB	Output is correct
6	Correct	260 ms	23788 KB	Output is correct
7	Correct	281 ms	25836 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	68 ms	6380 KB	Output is correct
10	Correct	264 ms	24300 KB	Output is correct
11	Correct	260 ms	23788 KB	Output is correct
12	Correct	268 ms	26988 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Incorrect	1 ms	364 KB	Too many ways to get from 4 to 8, should be 1 found no less than 2
15	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	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	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	11 ms	1516 KB	Output is correct
7	Correct	260 ms	26220 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	0 ms	364 KB	Output is correct
12	Correct	11 ms	1260 KB	Output is correct
13	Correct	285 ms	22148 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	1004 KB	Output is correct
17	Correct	120 ms	15232 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	65 ms	5868 KB	Output is correct
21	Correct	256 ms	22764 KB	Output is correct
22	Correct	271 ms	22140 KB	Output is correct
23	Correct	263 ms	24172 KB	Output is correct
24	Correct	254 ms	22252 KB	Output is correct
25	Correct	128 ms	12908 KB	Output is correct
26	Correct	106 ms	12284 KB	Output is correct
27	Correct	298 ms	25196 KB	Output is correct
28	Correct	277 ms	22124 KB	Output is correct
29	Correct	0 ms	364 KB	Output is correct
30	Correct	1 ms	364 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	1 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	11 ms	1260 KB	Output is correct
37	Correct	251 ms	22124 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	12 ms	1516 KB	Output is correct
41	Correct	268 ms	26220 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	5 ms	1004 KB	Output is correct
45	Correct	119 ms	15100 KB	Output is correct
46	Correct	1 ms	364 KB	Output is correct
47	Correct	1 ms	364 KB	Output is correct
48	Correct	1 ms	364 KB	Output is correct
49	Correct	63 ms	5868 KB	Output is correct
50	Correct	263 ms	22764 KB	Output is correct
51	Correct	264 ms	22268 KB	Output is correct
52	Correct	276 ms	25452 KB	Output is correct
53	Correct	107 ms	12396 KB	Output is correct
54	Correct	108 ms	12908 KB	Output is correct
55	Correct	252 ms	22252 KB	Output is correct
56	Correct	270 ms	24300 KB	Output is correct
57	Correct	107 ms	12268 KB	Output is correct
58	Correct	1 ms	364 KB	Output is correct
59	Correct	1 ms	364 KB	Output is correct
60	Correct	6 ms	1132 KB	Output is correct
61	Correct	124 ms	18284 KB	Output is correct
62	Correct	1 ms	492 KB	Output is correct
63	Incorrect	1 ms	364 KB	Too many ways to get from 0 to 9, should be 1 found no less than 2
64	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	Verdict	Execution time	Memory	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	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	11 ms	1516 KB	Output is correct
7	Correct	260 ms	26220 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	0 ms	364 KB	Output is correct
12	Correct	11 ms	1260 KB	Output is correct
13	Correct	285 ms	22148 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	1004 KB	Output is correct
17	Correct	120 ms	15232 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	65 ms	5868 KB	Output is correct
21	Correct	256 ms	22764 KB	Output is correct
22	Correct	271 ms	22140 KB	Output is correct
23	Correct	263 ms	24172 KB	Output is correct
24	Correct	254 ms	22252 KB	Output is correct
25	Correct	128 ms	12908 KB	Output is correct
26	Correct	106 ms	12284 KB	Output is correct
27	Correct	298 ms	25196 KB	Output is correct
28	Correct	277 ms	22124 KB	Output is correct
29	Correct	0 ms	364 KB	Output is correct
30	Correct	1 ms	364 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	1 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	11 ms	1260 KB	Output is correct
37	Correct	251 ms	22124 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	12 ms	1516 KB	Output is correct
41	Correct	268 ms	26220 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	5 ms	1004 KB	Output is correct
45	Correct	119 ms	15100 KB	Output is correct
46	Correct	1 ms	364 KB	Output is correct
47	Correct	1 ms	364 KB	Output is correct
48	Correct	1 ms	364 KB	Output is correct
49	Correct	63 ms	5868 KB	Output is correct
50	Correct	263 ms	22764 KB	Output is correct
51	Correct	264 ms	22268 KB	Output is correct
52	Correct	276 ms	25452 KB	Output is correct
53	Correct	107 ms	12396 KB	Output is correct
54	Correct	108 ms	12908 KB	Output is correct
55	Correct	252 ms	22252 KB	Output is correct
56	Correct	270 ms	24300 KB	Output is correct
57	Correct	107 ms	12268 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	6380 KB	Output is correct
62	Correct	259 ms	24300 KB	Output is correct
63	Correct	260 ms	23788 KB	Output is correct
64	Correct	281 ms	25836 KB	Output is correct
65	Correct	1 ms	364 KB	Output is correct
66	Correct	68 ms	6380 KB	Output is correct
67	Correct	264 ms	24300 KB	Output is correct
68	Correct	260 ms	23788 KB	Output is correct
69	Correct	268 ms	26988 KB	Output is correct
70	Correct	1 ms	364 KB	Output is correct
71	Incorrect	1 ms	364 KB	Too many ways to get from 4 to 8, should be 1 found no less than 2
72	Halted	0 ms	0 KB	-

Submission #366960

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