oj.uz

Submission #300389

# Submission time Handle Problem Language Result Execution time Memory
300389 2020-09-17T06:33:28 Z kshitij_sodani Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 282 ms 26252 KB 
#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back

typedef long long llo;

#include "supertrees.h"
#include <vector>
vector<vector<int>> adj;
int vis[1001];
vector<int> comp;
int n;
void dfs(int no){
	comp.pb(no);
	vis[no]=1;
	for(int i=0;i<n;i++){
		if(adj[no][i]==1 and vis[i]==0){
			dfs(i);
		}
	}
}
int par[1001];
void dfs2(int no){
	comp.pb(no);
	vis[no]=1;
	for(int i=0;i<n;i++){
		if(adj[no][par[i]]==2 and vis[par[i]]==0){
			dfs2(par[i]);
		}
	}
}
int par2[1001];
void dfs3(int no){
	comp.pb(no);
	vis[no]=1;
	for(int i=0;i<n;i++){
		if(adj[no][par2[i]]==3 and vis[par2[i]]==0){
			dfs3(par2[i]);
		}
	}
}
vector<int> comp2[1001];
vector<int> comp3[1001];

int construct(vector<vector<int>> p) {
	n = p.size();
	adj=p;
	vector<vector<int>> ans;
	for(int i=0;i<n;i++){
		vector<int> pp;
		for(int j=0;j<n;j++){
			pp.pb(0);
		}
		ans.pb(pp);
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(adj[i][j]==3){
				return 0;
			}
		}
	}
	for(int i=0;i<n;i++){
		if(vis[i]==0){
			comp.clear();
			dfs(i);
			for(auto j:comp){
				for(auto k:comp){
					if(j!=k){
						if(adj[j][k]!=1){
							return 0;
						}
					}
				}
			}
			for(auto j:comp){
				par[j]=comp[0];
			}
			comp2[comp[0]]=comp;
			for(int j=0;j<comp.size()-1;j++){
				ans[comp[j]][comp[j+1]]=1;
				ans[comp[j+1]][comp[j]]=1;
			}
		}
	}
	for(int i=0;i<n;i++){
		vis[i]=0;
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(i==j){
				continue;
			}
			if(par[i]!=i or par[j]!=j){
				continue;
			}
			int x=adj[i][j];
			for(auto jj:comp2[i]){
				for(auto kk:comp2[j]){
					if(adj[jj][kk]!=x){
						return 0;
					}
				}
			}
			/*if(adj[i][j]!=adj[par[i]][par[j]]){
			//	cout<<i<<":"<<j<<endl;
				return 0;
			}*/
		}
	}
	for(int i=0;i<n;i++){
		if(vis[par[i]]==0){
			comp.clear();
			dfs2(par[i]);
			for(auto j:comp){
				for(auto jj:comp2[j]){
					par2[jj]=comp[0];
					comp3[comp[0]].pb(jj);
				}
			}
			if(comp.size()==2){
				return 0;
			}
			for(auto j:comp){
				for(auto k:comp){
					if(j!=k){
						if(adj[j][k]!=2){
							return 0;
						}
					}
				}
			}

			for(int j=0;j<comp.size()-1;j++){
				ans[comp[j]][comp[j+1]]=1;
				ans[comp[j+1]][comp[j]]=1;
			}
			if(comp.size()>1){
				ans[comp[0]][comp.back()]=1;
				ans[comp.back()][comp[0]]=1;
			}
		}
	}
	for(int i=0;i<n;i++){
		vis[i]=0;
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(i==j){
				continue;
			}
			if(par2[i]!=i or par2[j]!=j){
				continue;
			}
			int x=adj[i][j];
			for(auto jj:comp3[i]){
				for(auto kk:comp3[j]){
					if(adj[jj][kk]!=x){
						return 0;
					}
				}
			}
			/*if(adj[i][j]!=adj[par[i]][par[j]]){
			//	cout<<i<<":"<<j<<endl;
				return 0;
			}*/
		}
	}

	for(int i=0;i<n;i++){
		if(vis[par2[i]]==0){
			comp.clear();
			dfs3(par[i]);
			if(comp.size()==2 or comp.size()==3){
				return 0;
			}
			for(auto j:comp){
				for(auto k:comp){
					if(j!=k){
						if(adj[j][k]!=3){
							return 0;
						}
					}
				}
			}

			for(int j=0;j<comp.size()-1;j++){
				ans[comp[j]][comp[j+1]]=1;
				ans[comp[j+1]][comp[j]]=1;
			}
			if(comp.size()>1){
				ans[comp[0]][comp.back()]=1;
				ans[comp.back()][comp[0]]=1;
				ans[comp[0]][comp[2]]=1;
				ans[comp[2]][comp[0]]=1;
			}
		}
	}

	build(ans);






	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:82:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |    for(int j=0;j<comp.size()-1;j++){
      |                ~^~~~~~~~~~~~~~
supertrees.cpp:136:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |    for(int j=0;j<comp.size()-1;j++){
      |                ~^~~~~~~~~~~~~~
supertrees.cpp:189:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  189 |    for(int j=0;j<comp.size()-1;j++){
      |                ~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 247 ms 26104 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 247 ms 26104 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1408 KB Output is correct
13 Correct 252 ms 26232 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 123 ms 16376 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 63 ms 6904 KB Output is correct
21 Correct 251 ms 26104 KB Output is correct
22 Correct 260 ms 26232 KB Output is correct
23 Correct 253 ms 26104 KB Output is correct
24 Correct 263 ms 26136 KB Output is correct
25 Correct 115 ms 16120 KB Output is correct
26 Correct 112 ms 16120 KB Output is correct
27 Correct 257 ms 26104 KB Output is correct
28 Correct 282 ms 26104 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 360 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 11 ms 1408 KB Output is correct
9 Correct 271 ms 26104 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 270 ms 26232 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 130 ms 16248 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 66 ms 6904 KB Output is correct
22 Correct 266 ms 26104 KB Output is correct
23 Correct 267 ms 26104 KB Output is correct
24 Correct 277 ms 26224 KB Output is correct
25 Correct 118 ms 16376 KB Output is correct
26 Correct 120 ms 16376 KB Output is correct
27 Correct 255 ms 26232 KB Output is correct
28 Correct 274 ms 26232 KB Output is correct
29 Correct 116 ms 16248 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 64 ms 6904 KB Output is correct
5 Correct 272 ms 26252 KB Output is correct
6 Correct 257 ms 26212 KB Output is correct
7 Correct 267 ms 26232 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 66 ms 6904 KB Output is correct
10 Correct 268 ms 26232 KB Output is correct
11 Correct 252 ms 26104 KB Output is correct
12 Correct 269 ms 26104 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 69 ms 6904 KB Output is correct
17 Correct 256 ms 26104 KB Output is correct
18 Correct 252 ms 26104 KB Output is correct
19 Correct 251 ms 26104 KB Output is correct
20 Correct 260 ms 26232 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 247 ms 26104 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1408 KB Output is correct
13 Correct 252 ms 26232 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 123 ms 16376 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 63 ms 6904 KB Output is correct
21 Correct 251 ms 26104 KB Output is correct
22 Correct 260 ms 26232 KB Output is correct
23 Correct 253 ms 26104 KB Output is correct
24 Correct 263 ms 26136 KB Output is correct
25 Correct 115 ms 16120 KB Output is correct
26 Correct 112 ms 16120 KB Output is correct
27 Correct 257 ms 26104 KB Output is correct
28 Correct 282 ms 26104 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 360 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 1408 KB Output is correct
37 Correct 271 ms 26104 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 270 ms 26232 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 6 ms 1024 KB Output is correct
45 Correct 130 ms 16248 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 66 ms 6904 KB Output is correct
50 Correct 266 ms 26104 KB Output is correct
51 Correct 267 ms 26104 KB Output is correct
52 Correct 277 ms 26224 KB Output is correct
53 Correct 118 ms 16376 KB Output is correct
54 Correct 120 ms 16376 KB Output is correct
55 Correct 255 ms 26232 KB Output is correct
56 Correct 274 ms 26232 KB Output is correct
57 Correct 116 ms 16248 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 13 ms 1152 KB Output is correct
61 Correct 123 ms 16248 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 78 ms 6928 KB Output is correct
66 Correct 112 ms 16224 KB Output is correct
67 Correct 109 ms 16120 KB Output is correct
68 Correct 111 ms 16120 KB Output is correct
69 Correct 112 ms 16248 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1408 KB Output is correct
7 Correct 247 ms 26104 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1408 KB Output is correct
13 Correct 252 ms 26232 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 1024 KB Output is correct
17 Correct 123 ms 16376 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 63 ms 6904 KB Output is correct
21 Correct 251 ms 26104 KB Output is correct
22 Correct 260 ms 26232 KB Output is correct
23 Correct 253 ms 26104 KB Output is correct
24 Correct 263 ms 26136 KB Output is correct
25 Correct 115 ms 16120 KB Output is correct
26 Correct 112 ms 16120 KB Output is correct
27 Correct 257 ms 26104 KB Output is correct
28 Correct 282 ms 26104 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 360 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 1408 KB Output is correct
37 Correct 271 ms 26104 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 270 ms 26232 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 6 ms 1024 KB Output is correct
45 Correct 130 ms 16248 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 66 ms 6904 KB Output is correct
50 Correct 266 ms 26104 KB Output is correct
51 Correct 267 ms 26104 KB Output is correct
52 Correct 277 ms 26224 KB Output is correct
53 Correct 118 ms 16376 KB Output is correct
54 Correct 120 ms 16376 KB Output is correct
55 Correct 255 ms 26232 KB Output is correct
56 Correct 274 ms 26232 KB Output is correct
57 Correct 116 ms 16248 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 64 ms 6904 KB Output is correct
62 Correct 272 ms 26252 KB Output is correct
63 Correct 257 ms 26212 KB Output is correct
64 Correct 267 ms 26232 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 66 ms 6904 KB Output is correct
67 Correct 268 ms 26232 KB Output is correct
68 Correct 252 ms 26104 KB Output is correct
69 Correct 269 ms 26104 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 69 ms 6904 KB Output is correct
74 Correct 256 ms 26104 KB Output is correct
75 Correct 252 ms 26104 KB Output is correct
76 Correct 251 ms 26104 KB Output is correct
77 Correct 260 ms 26232 KB Output is correct
78 Correct 1 ms 384 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 13 ms 1152 KB Output is correct
81 Correct 123 ms 16248 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 1 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 78 ms 6928 KB Output is correct
86 Correct 112 ms 16224 KB Output is correct
87 Correct 109 ms 16120 KB Output is correct
88 Correct 111 ms 16120 KB Output is correct
89 Correct 112 ms 16248 KB Output is correct
90 Correct 1 ms 384 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 12 ms 1024 KB Output is correct
93 Correct 110 ms 16120 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 1 ms 384 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 30 ms 4344 KB Output is correct
98 Correct 109 ms 16120 KB Output is correct
99 Correct 108 ms 16248 KB Output is correct
100 Correct 112 ms 16120 KB Output is correct
101 Correct 112 ms 16120 KB Output is correct
102 Correct 116 ms 16120 KB Output is correct
103 Correct 119 ms 16120 KB Output is correct
104 Correct 110 ms 16248 KB Output is correct
105 Correct 113 ms 16228 KB Output is correct