oj.uz

Submission #367156

# Submission time Handle Problem Language Result Execution time Memory
367156 2021-02-16T11:07:48 Z MilosMilutinovic Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 288 ms 30572 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=i+1;j<n;j++)if(p[i][j]==1)one=true;
	for(int i=0;i<n;i++)for(int j=i+1;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;
		int par[n];
		for(int i=0;i<n;i++){
			if(!was[i]){
				DFS1(i);
				root.pb(i);
				for(int x:Euler)par[x]=i;
				if((int)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();
			}
		}
		for(int i=0;i<n;i++)was[i]=false;
		for(int j=0;j<n;j++){
			int i=par[j];
			if(!was[i]){
				DFS2(i);
				if((int)Euler.size()==1){Euler.clear();continue;}
				if((int)Euler.size()==2)return 0;
				for(int i=1;i<(int)Euler.size();i++){
					int x=par[Euler[i]],y=par[Euler[i-1]];
					ans[x][y]=ans[y][x]=1;
				}
				if((int)Euler.size()>2){
					int x=par[Euler[0]],y=par[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:106:1: warning: control reaches end of non-void function [-Wreturn-type]
  106 | }
      | ^

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 280 ms 30572 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 280 ms 30572 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 268 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 132 ms 19180 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 4 ms 4716 KB Output is correct
20 Correct 72 ms 8172 KB Output is correct
21 Correct 257 ms 26988 KB Output is correct
22 Correct 252 ms 26476 KB Output is correct
23 Correct 264 ms 28396 KB Output is correct
24 Correct 256 ms 26232 KB Output is correct
25 Correct 120 ms 16876 KB Output is correct
26 Correct 119 ms 16524 KB Output is correct
27 Correct 288 ms 29420 KB Output is correct
28 Correct 257 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 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 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 264 ms 26256 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 266 ms 30444 KB Output is correct
14 Correct 4 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 19192 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 77 ms 8172 KB Output is correct
22 Correct 256 ms 26860 KB Output is correct
23 Correct 261 ms 26348 KB Output is correct
24 Correct 267 ms 29676 KB Output is correct
25 Correct 118 ms 16492 KB Output is correct
26 Correct 120 ms 16876 KB Output is correct
27 Correct 256 ms 26348 KB Output is correct
28 Correct 273 ms 28524 KB Output is correct
29 Correct 118 ms 16620 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 63 ms 8172 KB Output is correct
5 Correct 266 ms 26860 KB Output is correct
6 Correct 263 ms 26348 KB Output is correct
7 Correct 263 ms 28408 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 62 ms 8172 KB Output is correct
10 Correct 262 ms 26756 KB Output is correct
11 Correct 266 ms 26348 KB Output is correct
12 Correct 265 ms 29420 KB Output is correct
13 Correct 3 ms 4716 KB Output is correct
14 Incorrect 3 ms 4716 KB Too many ways to get from 0 to 8, should be 0 found no less than 1
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 280 ms 30572 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 268 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 132 ms 19180 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 4 ms 4716 KB Output is correct
20 Correct 72 ms 8172 KB Output is correct
21 Correct 257 ms 26988 KB Output is correct
22 Correct 252 ms 26476 KB Output is correct
23 Correct 264 ms 28396 KB Output is correct
24 Correct 256 ms 26232 KB Output is correct
25 Correct 120 ms 16876 KB Output is correct
26 Correct 119 ms 16524 KB Output is correct
27 Correct 288 ms 29420 KB Output is correct
28 Correct 257 ms 26348 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 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 5228 KB Output is correct
37 Correct 264 ms 26256 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 266 ms 30444 KB Output is correct
42 Correct 4 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 19192 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 77 ms 8172 KB Output is correct
50 Correct 256 ms 26860 KB Output is correct
51 Correct 261 ms 26348 KB Output is correct
52 Correct 267 ms 29676 KB Output is correct
53 Correct 118 ms 16492 KB Output is correct
54 Correct 120 ms 16876 KB Output is correct
55 Correct 256 ms 26348 KB Output is correct
56 Correct 273 ms 28524 KB Output is correct
57 Correct 118 ms 16620 KB Output is correct
58 Incorrect 3 ms 4716 KB Answer gives possible 1 while actual possible 0
59 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 280 ms 30572 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 268 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 132 ms 19180 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 4 ms 4716 KB Output is correct
20 Correct 72 ms 8172 KB Output is correct
21 Correct 257 ms 26988 KB Output is correct
22 Correct 252 ms 26476 KB Output is correct
23 Correct 264 ms 28396 KB Output is correct
24 Correct 256 ms 26232 KB Output is correct
25 Correct 120 ms 16876 KB Output is correct
26 Correct 119 ms 16524 KB Output is correct
27 Correct 288 ms 29420 KB Output is correct
28 Correct 257 ms 26348 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 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 5228 KB Output is correct
37 Correct 264 ms 26256 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 266 ms 30444 KB Output is correct
42 Correct 4 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 19192 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 77 ms 8172 KB Output is correct
50 Correct 256 ms 26860 KB Output is correct
51 Correct 261 ms 26348 KB Output is correct
52 Correct 267 ms 29676 KB Output is correct
53 Correct 118 ms 16492 KB Output is correct
54 Correct 120 ms 16876 KB Output is correct
55 Correct 256 ms 26348 KB Output is correct
56 Correct 273 ms 28524 KB Output is correct
57 Correct 118 ms 16620 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 63 ms 8172 KB Output is correct
62 Correct 266 ms 26860 KB Output is correct
63 Correct 263 ms 26348 KB Output is correct
64 Correct 263 ms 28408 KB Output is correct
65 Correct 3 ms 4716 KB Output is correct
66 Correct 62 ms 8172 KB Output is correct
67 Correct 262 ms 26756 KB Output is correct
68 Correct 266 ms 26348 KB Output is correct
69 Correct 265 ms 29420 KB Output is correct
70 Correct 3 ms 4716 KB Output is correct
71 Incorrect 3 ms 4716 KB Too many ways to get from 0 to 8, should be 0 found no less than 1
72 Halted 0 ms 0 KB -