oj.uz

Submission #367139

# Submission time Handle Problem Language Result Execution time Memory
367139 2021-02-16T10:50:33 Z MilosMilutinovic Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 265 ms 30456 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=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]=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:94:1: warning: control reaches end of non-void function [-Wreturn-type]
   94 | }
      | ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 4 ms 4700 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 4860 KB Output is correct
6 Correct 14 ms 5228 KB Output is correct
7 Correct 260 ms 30456 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 4 ms 4700 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 4860 KB Output is correct
6 Correct 14 ms 5228 KB Output is correct
7 Correct 260 ms 30456 KB Output is correct
8 Correct 4 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 252 ms 26224 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 122 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 77 ms 8236 KB Output is correct
21 Correct 260 ms 26988 KB Output is correct
22 Correct 250 ms 26320 KB Output is correct
23 Correct 265 ms 28396 KB Output is correct
24 Correct 256 ms 26348 KB Output is correct
25 Correct 116 ms 16876 KB Output is correct
26 Correct 104 ms 16620 KB Output is correct
27 Correct 260 ms 29420 KB Output is correct
28 Correct 249 ms 26336 KB Output is correct

Subtask #3
0 / 19.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 Incorrect 3 ms 4716 KB b is not symmetric: b[0][1] (0) != b[1][0] (1)
6 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 Incorrect 4 ms 4716 KB b is not symmetric: b[0][1] (0) != b[1][0] (1)
3 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 4 ms 4700 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 4860 KB Output is correct
6 Correct 14 ms 5228 KB Output is correct
7 Correct 260 ms 30456 KB Output is correct
8 Correct 4 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 252 ms 26224 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 122 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 77 ms 8236 KB Output is correct
21 Correct 260 ms 26988 KB Output is correct
22 Correct 250 ms 26320 KB Output is correct
23 Correct 265 ms 28396 KB Output is correct
24 Correct 256 ms 26348 KB Output is correct
25 Correct 116 ms 16876 KB Output is correct
26 Correct 104 ms 16620 KB Output is correct
27 Correct 260 ms 29420 KB Output is correct
28 Correct 249 ms 26336 KB Output is correct
29 Correct 3 ms 4716 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 Incorrect 3 ms 4716 KB b is not symmetric: b[0][1] (0) != b[1][0] (1)
34 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 4 ms 4700 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 4860 KB Output is correct
6 Correct 14 ms 5228 KB Output is correct
7 Correct 260 ms 30456 KB Output is correct
8 Correct 4 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 252 ms 26224 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 122 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 77 ms 8236 KB Output is correct
21 Correct 260 ms 26988 KB Output is correct
22 Correct 250 ms 26320 KB Output is correct
23 Correct 265 ms 28396 KB Output is correct
24 Correct 256 ms 26348 KB Output is correct
25 Correct 116 ms 16876 KB Output is correct
26 Correct 104 ms 16620 KB Output is correct
27 Correct 260 ms 29420 KB Output is correct
28 Correct 249 ms 26336 KB Output is correct
29 Correct 3 ms 4716 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 Incorrect 3 ms 4716 KB b is not symmetric: b[0][1] (0) != b[1][0] (1)
34 Halted 0 ms 0 KB -