oj.uz

Submission #977711

# Submission time Handle Problem Language Result Execution time Memory
977711 2024-05-08T09:56:07 Z SmuggingSpun Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 226 ms 18260 KB 
#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>>p){
	int n = p.size();
	bool is_sub1 = true, is_sub2 = true, is_sub3 = true;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] != 1){
				is_sub1 = false;
			}
			if(p[i][j] > 1){
				is_sub2 = false;
			}
			if(p[i][j] != 0 && p[i][j] != 2){
				is_sub3 = false;
			}
			if(p[i][j] == 3){
				return 0;
			}
		}
	}
	if(is_sub1){
		p = vector<vector<int>>(n, vector<int>(n, 0));
		for(int i = 1; i < n; i++){
			p[i][i - 1] = p[i - 1][i] = 1;
		}
		build(p);
		return 1;
	}
	vector<int>par(n);
	iota(par.begin(), par.end(), 0);
	function<int(int)>find_set;
	find_set = [&] (int n){
		return n == par[n] ? n : par[n] = find_set(par[n]);	
	};
	function<void(int, int)>merge = [&] (int a, int b){
		par[find_set(a)] = find_set(b);
	};
	vector<bool>vis(n, false);
	vector<vector<int>>edge(n);
	if(is_sub2){
		for(int i = 0; i < n; i++){
			if(vis[i]){
				for(int j = 0; j < n; j++){
					if(i != j && int(find_set(i) == find_set(j)) != p[i][j]){
						return 0;
					}
				}
				continue;
			}
			for(int j = 0; j < n; j++){
				if(i != j && p[i][j] == 0 && find_set(i) == find_set(j)){
					return 0;
				}
				if(p[i][j] == 1){
					merge(i, j);
					vis[j] = true;
				}
			}
		}
		for(int i = 0; i < n; i++){
			edge[find_set(i)].emplace_back(i);
		}
		p = vector<vector<int>>(n, vector<int>(n, 0));
		for(int i = 0; i < n; i++){
			for(int j = 1; j < edge[i].size(); j++){
				p[edge[i][j]][edge[i][j - 1]] = p[edge[i][j - 1]][edge[i][j]] = 1;
			}
		}
		build(p);
		return 1;
	}
	if(is_sub3){
		for(int i = 0; i < n; i++){
			if(vis[i]){
				for(int j = 0; j < n; j++){
					if(i != j && (find_set(i) == find_set(j)) != (p[i][j] == 2)){
						return 0;
					}
				}
				continue;
			}
			for(int j = 0; j < n; j++){
				if(i != j && p[i][j] == 0 && find_set(i) == find_set(j)){
					return 0;
				}
				if(p[i][j] == 2){
					merge(i, j);
					vis[j] = true;
				}
			}
		}
		for(int i = 0; i < n; i++){
			edge[find_set(i)].emplace_back(i);
		}
		p = vector<vector<int>>(n, vector<int>(n, 0));
		for(int i = 0; i < n; i++){
			if(edge[i].size() == 2){
				return 0;
			}
			if(edge[i].size() > 2){
				edge[i].emplace_back(edge[i][0]);
				for(int j = 1; j < edge[i].size(); j++){
					p[edge[i][j]][edge[i][j - 1]] = p[edge[i][j - 1]][edge[i][j]] = 1;
				}
			}
		}
		build(p);
		return 1;
	}
	vector<bool>all_2(n, true);
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(p[i][j] == 1){
				all_2[i] = false;
				break;
			}
		}
	}
	for(int i = 0; i < n; i++){
		if(vis[i]){
			for(int j = 0; j < n; j++){
				if(i != j && (find_set(i) == find_set(j)) != (p[i][j] > 0)){
					return 0;
				}
			}
		}	
		if(!all_2[i]){
			for(int j = 0; j < n; j++){
				if(i != j && p[i][j] == 0 && find_set(i) == find_set(j)){
					return 0;
				}
				if(p[i][j] > 0){
					merge(i, j);
					vis[j] = true;
				}
			}
		}
	}
	for(int i = 0; i < n; i++){
		if(all_2[i]){
			if(!vis[i]){
				for(int j = 0; j < n; j++){
					if(p[i][j] > 0){
						if(vis[j]){
							return 0;
						}
						vis[j] = true;
						merge(i, j);
					}
				}
			}
			else{
				for(int j = 0; j < n; j++){
					if(i != j && (find_set(i) == find_set(j)) != (p[i][j] > 0)){
						return 0;
					}
				}
			}
		}
		edge[find_set(i)].emplace_back(i);
	}
	vector<vector<int>>ans(n, vector<int>(n, 0));
	for(int i = 0; i < n; i++){
		vector<vector<int>>part(2);
		for(int& j : edge[i]){
			part[all_2[j]].emplace_back(j);
		}
		if(part[0].empty()){
			if(part[1].size() == 2){
				return 0;
			} 
			if(part[1].size() > 2){
				part[1].emplace_back(part[1][0]);
				for(int j = 1; j < part[1].size(); j++){
					ans[part[1][j]][part[1][j - 1]] = ans[part[1][j - 1]][part[1][j]] = 1;
				}
			}
		}
		else{
			for(int& index : part[0]){
				if(p[index] != p[part[0][0]]){
					return 0;
				}
			}
			for(int j = 1; j < part[0].size(); j++){
				ans[part[0][j]][part[0][j - 1]] = ans[part[0][j - 1]][part[0][j]] = 1;
			}
			if(part[1].size() == 1){
				return 0;
			}			
			part[1].emplace_back(part[0].back());
			for(int j = 1; j < part[1].size(); j++){
				ans[part[1][j]][part[1][j - 1]] = ans[part[1][j - 1]][part[1][j]] = 1;
			}
		}
	}
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:67:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |    for(int j = 1; j < edge[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~
supertrees.cpp:104:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |     for(int j = 1; j < edge[i].size(); j++){
      |                    ~~^~~~~~~~~~~~~~~~
supertrees.cpp:176:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  176 |     for(int j = 1; j < part[1].size(); j++){
      |                    ~~^~~~~~~~~~~~~~~~
supertrees.cpp:187:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  187 |    for(int j = 1; j < part[0].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~
supertrees.cpp:194:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 |    for(int j = 1; j < part[1].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 187 ms 18000 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 187 ms 18000 KB Output is correct
8 Correct 1 ms 500 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 183 ms 18260 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 78 ms 8200 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 50 ms 4692 KB Output is correct
21 Correct 202 ms 18180 KB Output is correct
22 Correct 193 ms 18256 KB Output is correct
23 Correct 226 ms 18180 KB Output is correct
24 Correct 186 ms 18132 KB Output is correct
25 Correct 102 ms 8204 KB Output is correct
26 Correct 82 ms 8268 KB Output is correct
27 Correct 189 ms 18260 KB Output is correct
28 Correct 215 ms 18256 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 500 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 187 ms 18000 KB Output is correct
8 Correct 1 ms 500 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 183 ms 18260 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 78 ms 8200 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 50 ms 4692 KB Output is correct
21 Correct 202 ms 18180 KB Output is correct
22 Correct 193 ms 18256 KB Output is correct
23 Correct 226 ms 18180 KB Output is correct
24 Correct 186 ms 18132 KB Output is correct
25 Correct 102 ms 8204 KB Output is correct
26 Correct 82 ms 8268 KB Output is correct
27 Correct 189 ms 18260 KB Output is correct
28 Correct 215 ms 18256 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 500 KB Output is correct
33 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 187 ms 18000 KB Output is correct
8 Correct 1 ms 500 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 183 ms 18260 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 78 ms 8200 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 50 ms 4692 KB Output is correct
21 Correct 202 ms 18180 KB Output is correct
22 Correct 193 ms 18256 KB Output is correct
23 Correct 226 ms 18180 KB Output is correct
24 Correct 186 ms 18132 KB Output is correct
25 Correct 102 ms 8204 KB Output is correct
26 Correct 82 ms 8268 KB Output is correct
27 Correct 189 ms 18260 KB Output is correct
28 Correct 215 ms 18256 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 500 KB Output is correct
33 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -