oj.uz

Submission #367126

# Submission time Handle Problem Language Result Execution time Memory
367126 2021-02-16T10:26:10 Z MilosMilutinovic Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 335 ms 31980 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define pb push_back
const int N=1050;
vector<int> E[N];
vector<vector<int>> p;
vector<vector<int>> ans(N,vector<int>(N,0));
void AddEdge(int u,int v){E[u].pb(v);E[v].pb(u);}
vector<int> Euler;
bool was[N];
void DFS1(int u){
	was[u]=true,Euler.pb(u);
	for(int v:E[u])if(!was[v]&&p[u][v]==1)DFS1(v);
}
void DFS2(int u){
	was[u]=true,Euler.pb(u);
	for(int v:E[u])if(!was[v]&&p[u][v]==2)DFS2(v);
}
int construct(vector<vector<int>> P){
	p=P;int n=(int)P.size();
	ans.resize(n);
	for(int i=0;i<n;i++)ans[i].resize(n);
	for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)if(p[i][j]>0)AddEdge(i,j);
	bool one=false,two=false;
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==1)one=true;
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==2)two=true;
	if(!one&&!two){build(ans);return 1;}
	if(one&&!two){
		for(int i=0;i<n;i++){
			if(!was[i]){
				DFS1(i);
				if((int)Euler.size()==1){Euler.clear();continue;}
				for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]==0)return 0;
				for(int i=1;i<(int)Euler.size();i++){
					int x=Euler[i],y=Euler[i-1];
					ans[x][y]=ans[y][x]=1;
				}
				Euler.clear();
			}
		}
		build(ans);
		return 1;
	}
	if(!one&&two){
		for(int i=0;i<n;i++){
			if(!was[i]){
				DFS2(i);
				if((int)Euler.size()==1){Euler.clear();continue;}
				if((int)Euler.size()==2)return 0;
				for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]==0)return 0;
				for(int i=1;i<(int)Euler.size();i++){
					int x=Euler[i],y=Euler[i-1];
					ans[x][y]=ans[y][x]=1;
				}
				if(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:66:1: warning: control reaches end of non-void function [-Wreturn-type]
   66 | }
      | ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5228 KB Output is correct
7 Correct 253 ms 30444 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5228 KB Output is correct
7 Correct 253 ms 30444 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 3 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5228 KB Output is correct
13 Correct 262 ms 26220 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Correct 3 ms 4716 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 119 ms 19180 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 64 ms 8172 KB Output is correct
21 Correct 335 ms 26860 KB Output is correct
22 Correct 240 ms 26348 KB Output is correct
23 Correct 258 ms 28524 KB Output is correct
24 Correct 245 ms 26348 KB Output is correct
25 Correct 124 ms 16876 KB Output is correct
26 Correct 103 ms 16492 KB Output is correct
27 Correct 253 ms 29548 KB Output is correct
28 Correct 242 ms 26348 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 4 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 4 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 3 ms 4716 KB Output is correct
7 Correct 3 ms 4716 KB Output is correct
8 Correct 13 ms 5356 KB Output is correct
9 Correct 244 ms 27884 KB Output is correct
10 Correct 3 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5356 KB Output is correct
13 Correct 249 ms 31980 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Correct 3 ms 4716 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 131 ms 20712 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 3 ms 4716 KB Output is correct
21 Correct 68 ms 8812 KB Output is correct
22 Correct 290 ms 28396 KB Output is correct
23 Correct 245 ms 27884 KB Output is correct
24 Correct 265 ms 30956 KB Output is correct
25 Correct 106 ms 18156 KB Output is correct
26 Correct 108 ms 18412 KB Output is correct
27 Correct 247 ms 27884 KB Output is correct
28 Correct 257 ms 29932 KB Output is correct
29 Correct 110 ms 18156 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 70 ms 8684 KB Output is correct
5 Correct 247 ms 28396 KB Output is correct
6 Correct 249 ms 27884 KB Output is correct
7 Correct 261 ms 30084 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 68 ms 8684 KB Output is correct
10 Correct 247 ms 28396 KB Output is correct
11 Correct 246 ms 27884 KB Output is correct
12 Correct 267 ms 31212 KB Output is correct
13 Correct 3 ms 4716 KB Output is correct
14 Incorrect 3 ms 4716 KB Too few ways to get from 4 to 5, should be 1 found 0
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5228 KB Output is correct
7 Correct 253 ms 30444 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 3 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5228 KB Output is correct
13 Correct 262 ms 26220 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Correct 3 ms 4716 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 119 ms 19180 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 64 ms 8172 KB Output is correct
21 Correct 335 ms 26860 KB Output is correct
22 Correct 240 ms 26348 KB Output is correct
23 Correct 258 ms 28524 KB Output is correct
24 Correct 245 ms 26348 KB Output is correct
25 Correct 124 ms 16876 KB Output is correct
26 Correct 103 ms 16492 KB Output is correct
27 Correct 253 ms 29548 KB Output is correct
28 Correct 242 ms 26348 KB Output is correct
29 Correct 3 ms 4716 KB Output is correct
30 Correct 4 ms 4716 KB Output is correct
31 Correct 3 ms 4716 KB Output is correct
32 Correct 4 ms 4716 KB Output is correct
33 Correct 3 ms 4716 KB Output is correct
34 Correct 3 ms 4716 KB Output is correct
35 Correct 3 ms 4716 KB Output is correct
36 Correct 13 ms 5356 KB Output is correct
37 Correct 244 ms 27884 KB Output is correct
38 Correct 3 ms 4716 KB Output is correct
39 Correct 3 ms 4716 KB Output is correct
40 Correct 13 ms 5356 KB Output is correct
41 Correct 249 ms 31980 KB Output is correct
42 Correct 3 ms 4716 KB Output is correct
43 Correct 3 ms 4716 KB Output is correct
44 Correct 8 ms 5228 KB Output is correct
45 Correct 131 ms 20712 KB Output is correct
46 Correct 3 ms 4716 KB Output is correct
47 Correct 3 ms 4716 KB Output is correct
48 Correct 3 ms 4716 KB Output is correct
49 Correct 68 ms 8812 KB Output is correct
50 Correct 290 ms 28396 KB Output is correct
51 Correct 245 ms 27884 KB Output is correct
52 Correct 265 ms 30956 KB Output is correct
53 Correct 106 ms 18156 KB Output is correct
54 Correct 108 ms 18412 KB Output is correct
55 Correct 247 ms 27884 KB Output is correct
56 Correct 257 ms 29932 KB Output is correct
57 Correct 110 ms 18156 KB Output is correct
58 Correct 3 ms 4716 KB Output is correct
59 Correct 3 ms 4716 KB Output is correct
60 Correct 8 ms 5372 KB Output is correct
61 Correct 121 ms 22636 KB Output is correct
62 Correct 3 ms 4752 KB Output is correct
63 Incorrect 4 ms 4716 KB Too few ways to get from 0 to 1, should be 1 found 0
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5228 KB Output is correct
7 Correct 253 ms 30444 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 3 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5228 KB Output is correct
13 Correct 262 ms 26220 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Correct 3 ms 4716 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 119 ms 19180 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 64 ms 8172 KB Output is correct
21 Correct 335 ms 26860 KB Output is correct
22 Correct 240 ms 26348 KB Output is correct
23 Correct 258 ms 28524 KB Output is correct
24 Correct 245 ms 26348 KB Output is correct
25 Correct 124 ms 16876 KB Output is correct
26 Correct 103 ms 16492 KB Output is correct
27 Correct 253 ms 29548 KB Output is correct
28 Correct 242 ms 26348 KB Output is correct
29 Correct 3 ms 4716 KB Output is correct
30 Correct 4 ms 4716 KB Output is correct
31 Correct 3 ms 4716 KB Output is correct
32 Correct 4 ms 4716 KB Output is correct
33 Correct 3 ms 4716 KB Output is correct
34 Correct 3 ms 4716 KB Output is correct
35 Correct 3 ms 4716 KB Output is correct
36 Correct 13 ms 5356 KB Output is correct
37 Correct 244 ms 27884 KB Output is correct
38 Correct 3 ms 4716 KB Output is correct
39 Correct 3 ms 4716 KB Output is correct
40 Correct 13 ms 5356 KB Output is correct
41 Correct 249 ms 31980 KB Output is correct
42 Correct 3 ms 4716 KB Output is correct
43 Correct 3 ms 4716 KB Output is correct
44 Correct 8 ms 5228 KB Output is correct
45 Correct 131 ms 20712 KB Output is correct
46 Correct 3 ms 4716 KB Output is correct
47 Correct 3 ms 4716 KB Output is correct
48 Correct 3 ms 4716 KB Output is correct
49 Correct 68 ms 8812 KB Output is correct
50 Correct 290 ms 28396 KB Output is correct
51 Correct 245 ms 27884 KB Output is correct
52 Correct 265 ms 30956 KB Output is correct
53 Correct 106 ms 18156 KB Output is correct
54 Correct 108 ms 18412 KB Output is correct
55 Correct 247 ms 27884 KB Output is correct
56 Correct 257 ms 29932 KB Output is correct
57 Correct 110 ms 18156 KB Output is correct
58 Correct 3 ms 4716 KB Output is correct
59 Correct 3 ms 4716 KB Output is correct
60 Correct 3 ms 4716 KB Output is correct
61 Correct 70 ms 8684 KB Output is correct
62 Correct 247 ms 28396 KB Output is correct
63 Correct 249 ms 27884 KB Output is correct
64 Correct 261 ms 30084 KB Output is correct
65 Correct 3 ms 4716 KB Output is correct
66 Correct 68 ms 8684 KB Output is correct
67 Correct 247 ms 28396 KB Output is correct
68 Correct 246 ms 27884 KB Output is correct
69 Correct 267 ms 31212 KB Output is correct
70 Correct 3 ms 4716 KB Output is correct
71 Incorrect 3 ms 4716 KB Too few ways to get from 4 to 5, should be 1 found 0
72 Halted 0 ms 0 KB -