oj.uz

Submission #367145

# Submission time Handle Problem Language Result Execution time Memory
367145 2021-02-16T10:55:11 Z MilosMilutinovic Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 290 ms 30444 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();
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==3)return 0;
	ans.resize(n);
	for(int i=0;i<n;i++)ans[i].resize(n);
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)ans[i][j]=0;
	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;
	}
	if(one&&two){
		vector<int> root;
		for(int i=0;i<n;i++){
			if(!was[i]){
				DFS1(i);
				root.pb(i);
				if(Euler.size()==1){Euler.clear();continue;}
				for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]!=1)return 0;
				for(int i=0;i<(int)Euler.size();i++){
					int x=Euler[i];
					if(x!=i)ans[i][x]=ans[x][i]=1;
				}
				Euler.clear();
			}
		}
		if((int)root.size()==2)return 0;
		for(int i=1;i<(int)root.size();i++){
			int x=root[i],y=root[i-1];
			ans[x][y]=ans[y][x]=1;
		}
		if((int)root.size()>2){
			int x=root[0],y=root.back();
			ans[x][y]=ans[y][x]=1;
		}
		build(ans);
		return 1;
	}
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:95:1: warning: control reaches end of non-void function [-Wreturn-type]
   95 | }
      | ^

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 290 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 290 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 12 ms 5228 KB Output is correct
13 Correct 249 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 9 ms 5228 KB Output is correct
17 Correct 136 ms 19308 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 66 ms 8176 KB Output is correct
21 Correct 247 ms 26872 KB Output is correct
22 Correct 247 ms 26348 KB Output is correct
23 Correct 277 ms 28396 KB Output is correct
24 Correct 247 ms 26220 KB Output is correct
25 Correct 132 ms 17016 KB Output is correct
26 Correct 108 ms 16492 KB Output is correct
27 Correct 256 ms 29676 KB Output is correct
28 Correct 246 ms 26220 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4748 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 4 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 5228 KB Output is correct
9 Correct 246 ms 26220 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 255 ms 30316 KB Output is correct
14 Incorrect 3 ms 4716 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

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 4 ms 4716 KB Output is correct
4 Correct 78 ms 8312 KB Output is correct
5 Correct 250 ms 26988 KB Output is correct
6 Correct 247 ms 26732 KB Output is correct
7 Correct 254 ms 28524 KB Output is correct
8 Incorrect 3 ms 4716 KB Too many ways to get from 0 to 4, should be 0 found no less than 1
9 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 290 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 12 ms 5228 KB Output is correct
13 Correct 249 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 9 ms 5228 KB Output is correct
17 Correct 136 ms 19308 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 66 ms 8176 KB Output is correct
21 Correct 247 ms 26872 KB Output is correct
22 Correct 247 ms 26348 KB Output is correct
23 Correct 277 ms 28396 KB Output is correct
24 Correct 247 ms 26220 KB Output is correct
25 Correct 132 ms 17016 KB Output is correct
26 Correct 108 ms 16492 KB Output is correct
27 Correct 256 ms 29676 KB Output is correct
28 Correct 246 ms 26220 KB Output is correct
29 Correct 3 ms 4748 KB Output is correct
30 Correct 3 ms 4716 KB Output is correct
31 Correct 3 ms 4716 KB Output is correct
32 Correct 3 ms 4716 KB Output is correct
33 Correct 4 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 5228 KB Output is correct
37 Correct 246 ms 26220 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 5228 KB Output is correct
41 Correct 255 ms 30316 KB Output is correct
42 Incorrect 3 ms 4716 KB Answer gives possible 1 while actual possible 0
43 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 290 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 12 ms 5228 KB Output is correct
13 Correct 249 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 9 ms 5228 KB Output is correct
17 Correct 136 ms 19308 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 66 ms 8176 KB Output is correct
21 Correct 247 ms 26872 KB Output is correct
22 Correct 247 ms 26348 KB Output is correct
23 Correct 277 ms 28396 KB Output is correct
24 Correct 247 ms 26220 KB Output is correct
25 Correct 132 ms 17016 KB Output is correct
26 Correct 108 ms 16492 KB Output is correct
27 Correct 256 ms 29676 KB Output is correct
28 Correct 246 ms 26220 KB Output is correct
29 Correct 3 ms 4748 KB Output is correct
30 Correct 3 ms 4716 KB Output is correct
31 Correct 3 ms 4716 KB Output is correct
32 Correct 3 ms 4716 KB Output is correct
33 Correct 4 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 5228 KB Output is correct
37 Correct 246 ms 26220 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 5228 KB Output is correct
41 Correct 255 ms 30316 KB Output is correct
42 Incorrect 3 ms 4716 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -