oj.uz

Submission #434675

# Submission time Handle Problem Language Result Execution time Memory
434675 2021-06-21T14:28:47 Z pere_gil Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 318 ms 22156 KB 
#include "supertrees.h"
#include "bits/stdc++.h"
using namespace std;

#define vvi vector<vector<int> >

void pri_graph(vvi &v){
	for(int i=0;i<v.size();i++)
		for(int j=i;j<v.size();j++)
			if(v[i][j]) printf("%d <-> %d\n",i,j);
	printf("\n");
}

void init(int n, vector<int> &p){
	for(int i=0;i<n;i++) p[i]=i;
}

int find_set(int n, vector<int> &p){
	return (n==p[n]) ? n : p[n]=find_set(p[n],p);
}

bool same_set(int a, int b, vector<int> &p){
	return find_set(a,p)==find_set(b,p);
}

void union_set(int a, int b, vector<int> &p){
	if(!same_set(a,b,p)) p[find_set(a,p)]=find_set(b,p);
}

vector<int> to_vector(unordered_set<int> &s){
	unordered_set<int> :: iterator it;
	vector<int> v;
	for(it=s.begin();it!=s.end();it++)
		v.push_back(*it);
	return v;
}

void join_1(vector<int> &g, vvi &res){
	for(int i=1;i<g.size();i++)
		res[g[i-1]][g[i]]=res[g[i]][g[i-1]]=1;
}

bool join_2(vector<int> &g, vvi &res){
	if(g.size()==1) return true;
	if(g.size()<3) return false;
	for(int i=0;i<g.size();i++){
		int j=(i+1)%g.size();
		res[g[i]][g[j]]=res[g[j]][g[i]]=1;
	}
	return true;
}

bool make_group(int n, vector<int> &g, vvi &v, vvi &res){
	vector<int> p(n);
	init(n,p);

	unordered_set<int> mid;
	for(int i=0;i<g.size();i++){
		int aux=0;
		for(int j=0;j<g.size();j++)
			if(v[g[i]][g[j]]==1) union_set(g[i],g[j],p);
			else aux++;
		if(aux==g.size()-1) mid.insert(g[i]);
	}
	vvi one(n);
	for(int i=0;i<g.size();i++){
		if(mid.find(g[i])==mid.end())
			one[find_set(g[i],p)].push_back(g[i]);
		if(g[i]==find_set(g[i],p)) mid.insert(g[i]);
	}
	vector<int> v_mid=to_vector(mid);

	/*
	printf("The middle: ");
	for(int i=0;i<v_mid.size();i++) printf("%d ",v_mid[i]);
	printf("\nGroup of one\n");
	for(int i=0;i<n;i++){
		if(!one[i].size()) continue;
		for(int j=0;j<one[i].size();j++) printf("%d ",one[i][j]);
		printf("\n");
	}
	*/

	for(int i=0;i<n;i++)
		if(one[i].size()) join_1(one[i],res);
	return join_2(v_mid,res);
}

int construct(vvi v){
	int n=v.size();

	vector<int> p(n);
	init(n,p);
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(v[i][j]) union_set(i,j,p);

    vvi g(n);
	for(int i=0;i<n;i++)
		g[find_set(i,p)].push_back(i);

	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if((same_set(i,j,p) && v[i][j]==0) || v[i][j]==3) return 0;

	vvi res(n,vector<int> (n,0));
	for(int i=0;i<n;i++)
		if(g[i].size()>0)
			if(!make_group(n,g[i],v,res)) return 0;
	
	//pri_graph(res);
	
	build(res);
	return 1;
}

Compilation message

supertrees.cpp: In function 'void pri_graph(std::vector<std::vector<int> >&)':
supertrees.cpp:8:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |  for(int i=0;i<v.size();i++)
      |              ~^~~~~~~~~
supertrees.cpp:9:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |   for(int j=i;j<v.size();j++)
      |               ~^~~~~~~~~
supertrees.cpp: In function 'void join_1(std::vector<int>&, std::vector<std::vector<int> >&)':
supertrees.cpp:39:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  for(int i=1;i<g.size();i++)
      |              ~^~~~~~~~~
supertrees.cpp: In function 'bool join_2(std::vector<int>&, std::vector<std::vector<int> >&)':
supertrees.cpp:46:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |  for(int i=0;i<g.size();i++){
      |              ~^~~~~~~~~
supertrees.cpp: In function 'bool make_group(int, std::vector<int>&, std::vector<std::vector<int> >&, std::vector<std::vector<int> >&)':
supertrees.cpp:58:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |  for(int i=0;i<g.size();i++){
      |              ~^~~~~~~~~
supertrees.cpp:60:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |   for(int j=0;j<g.size();j++)
      |               ~^~~~~~~~~
supertrees.cpp:63:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   if(aux==g.size()-1) mid.insert(g[i]);
      |      ~~~^~~~~~~~~~~~
supertrees.cpp:66:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |  for(int i=0;i<g.size();i++){
      |              ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 14 ms 1092 KB Output is correct
7 Correct 249 ms 22020 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 14 ms 1092 KB Output is correct
7 Correct 249 ms 22020 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1132 KB Output is correct
13 Correct 234 ms 22076 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 113 ms 8192 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 74 ms 5656 KB Output is correct
21 Correct 257 ms 22020 KB Output is correct
22 Correct 245 ms 21976 KB Output is correct
23 Correct 258 ms 21980 KB Output is correct
24 Correct 232 ms 22072 KB Output is correct
25 Correct 100 ms 8196 KB Output is correct
26 Correct 94 ms 8184 KB Output is correct
27 Correct 315 ms 22012 KB Output is correct
28 Correct 254 ms 22084 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 10 ms 1100 KB Output is correct
9 Correct 236 ms 22020 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 242 ms 21988 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 109 ms 8200 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 67 ms 5708 KB Output is correct
22 Correct 257 ms 22084 KB Output is correct
23 Correct 278 ms 22132 KB Output is correct
24 Correct 289 ms 22136 KB Output is correct
25 Correct 104 ms 12104 KB Output is correct
26 Correct 96 ms 8196 KB Output is correct
27 Correct 247 ms 22036 KB Output is correct
28 Correct 250 ms 22084 KB Output is correct
29 Correct 105 ms 12228 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 65 ms 5684 KB Output is correct
5 Correct 257 ms 22020 KB Output is correct
6 Correct 234 ms 22072 KB Output is correct
7 Correct 318 ms 21956 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 73 ms 5696 KB Output is correct
10 Correct 244 ms 22012 KB Output is correct
11 Correct 238 ms 22028 KB Output is correct
12 Correct 251 ms 22156 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 59 ms 5752 KB Output is correct
17 Correct 249 ms 22076 KB Output is correct
18 Correct 240 ms 22028 KB Output is correct
19 Correct 275 ms 22028 KB Output is correct
20 Correct 236 ms 22152 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 14 ms 1092 KB Output is correct
7 Correct 249 ms 22020 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1132 KB Output is correct
13 Correct 234 ms 22076 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 113 ms 8192 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 74 ms 5656 KB Output is correct
21 Correct 257 ms 22020 KB Output is correct
22 Correct 245 ms 21976 KB Output is correct
23 Correct 258 ms 21980 KB Output is correct
24 Correct 232 ms 22072 KB Output is correct
25 Correct 100 ms 8196 KB Output is correct
26 Correct 94 ms 8184 KB Output is correct
27 Correct 315 ms 22012 KB Output is correct
28 Correct 254 ms 22084 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 10 ms 1100 KB Output is correct
37 Correct 236 ms 22020 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 242 ms 21988 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 109 ms 8200 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 67 ms 5708 KB Output is correct
50 Correct 257 ms 22084 KB Output is correct
51 Correct 278 ms 22132 KB Output is correct
52 Correct 289 ms 22136 KB Output is correct
53 Correct 104 ms 12104 KB Output is correct
54 Correct 96 ms 8196 KB Output is correct
55 Correct 247 ms 22036 KB Output is correct
56 Correct 250 ms 22084 KB Output is correct
57 Correct 105 ms 12228 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 5 ms 576 KB Output is correct
61 Correct 107 ms 8200 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 64 ms 5700 KB Output is correct
66 Correct 97 ms 8188 KB Output is correct
67 Correct 94 ms 8200 KB Output is correct
68 Correct 92 ms 8132 KB Output is correct
69 Correct 111 ms 12152 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 14 ms 1092 KB Output is correct
7 Correct 249 ms 22020 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1132 KB Output is correct
13 Correct 234 ms 22076 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 113 ms 8192 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 74 ms 5656 KB Output is correct
21 Correct 257 ms 22020 KB Output is correct
22 Correct 245 ms 21976 KB Output is correct
23 Correct 258 ms 21980 KB Output is correct
24 Correct 232 ms 22072 KB Output is correct
25 Correct 100 ms 8196 KB Output is correct
26 Correct 94 ms 8184 KB Output is correct
27 Correct 315 ms 22012 KB Output is correct
28 Correct 254 ms 22084 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 10 ms 1100 KB Output is correct
37 Correct 236 ms 22020 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 242 ms 21988 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 109 ms 8200 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 67 ms 5708 KB Output is correct
50 Correct 257 ms 22084 KB Output is correct
51 Correct 278 ms 22132 KB Output is correct
52 Correct 289 ms 22136 KB Output is correct
53 Correct 104 ms 12104 KB Output is correct
54 Correct 96 ms 8196 KB Output is correct
55 Correct 247 ms 22036 KB Output is correct
56 Correct 250 ms 22084 KB Output is correct
57 Correct 105 ms 12228 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 65 ms 5684 KB Output is correct
62 Correct 257 ms 22020 KB Output is correct
63 Correct 234 ms 22072 KB Output is correct
64 Correct 318 ms 21956 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 73 ms 5696 KB Output is correct
67 Correct 244 ms 22012 KB Output is correct
68 Correct 238 ms 22028 KB Output is correct
69 Correct 251 ms 22156 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 0 ms 204 KB Output is correct
73 Correct 59 ms 5752 KB Output is correct
74 Correct 249 ms 22076 KB Output is correct
75 Correct 240 ms 22028 KB Output is correct
76 Correct 275 ms 22028 KB Output is correct
77 Correct 236 ms 22152 KB Output is correct
78 Correct 0 ms 204 KB Output is correct
79 Correct 1 ms 204 KB Output is correct
80 Correct 5 ms 576 KB Output is correct
81 Correct 107 ms 8200 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 0 ms 204 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 64 ms 5700 KB Output is correct
86 Correct 97 ms 8188 KB Output is correct
87 Correct 94 ms 8200 KB Output is correct
88 Correct 92 ms 8132 KB Output is correct
89 Correct 111 ms 12152 KB Output is correct
90 Correct 0 ms 204 KB Output is correct
91 Correct 1 ms 204 KB Output is correct
92 Correct 5 ms 588 KB Output is correct
93 Correct 117 ms 8188 KB Output is correct
94 Correct 1 ms 204 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 24 ms 2180 KB Output is correct
98 Correct 99 ms 8188 KB Output is correct
99 Correct 102 ms 8192 KB Output is correct
100 Correct 99 ms 8136 KB Output is correct
101 Correct 94 ms 8132 KB Output is correct
102 Correct 100 ms 8200 KB Output is correct
103 Correct 100 ms 8132 KB Output is correct
104 Correct 100 ms 8132 KB Output is correct
105 Correct 113 ms 8192 KB Output is correct