oj.uz

Submission #483490

# Submission time Handle Problem Language Result Execution time Memory
483490 2021-10-29T23:05:14 Z rc_catunta Connecting Supertrees (IOI20_supertrees) C++14
19 / 100
 212 ms 24056 KB 
#include "supertrees.h"
#include <vector>
#include <iostream>
#include <unordered_map>
using namespace std;

vector<int> rep,rnk;

void init(int N){
	rep.assign(N,0);
	for(int i=0;i<N;i++){
		rep[i]=i;
	}
	rnk.assign(N,1);
}

int buscar(int a){
	if(rep[a]==a) return a;
	return rep[a]=buscar(rep[a]);
}

bool mismo_conjunto(int a,int b){
	return buscar(a)==buscar(b);
}

void unir(int a,int b){
	int ra=buscar(a);
	int rb=buscar(b);
	if(ra != rb){
		if(rnk[ra]>rnk[rb]){
			rep[rb]=ra;
		}
		else{
			rep[ra]=rb;
		}
	}
}

int construct(vector<vector<int> > p) {
	int n = p.size();
	vector<vector<int> > answer;
	answer.assign(n,vector<int>(n));
	// Creamos el Union Find
	init(n);
	// Recorremos p
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(p[i][j]==2){
				unir(i,j);
			}
		}
	}
	// Verificar si p es correcto, si existe un grafo que lo satisfaga
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(mismo_conjunto(i,j) and p[i][j]==0){
				return 0;
			}
		}
	}
	// Si p es valido
	unordered_map<int,vector<int> >conjuntos;
	for(int i=0;i<rep.size();i++){
		int ri = buscar(i);
		if(conjuntos.find(ri)!=conjuntos.end()){
			conjuntos[ri].push_back(i);
		}
		else{
			conjuntos[ri] = vector<int>();
			conjuntos[ri].push_back(i);
		}
	}
	for(auto elem: conjuntos){
		vector<int> cont = elem.second;
		if(cont.size()==1) continue;
		if(cont.size()==2) return 0;
		for(int i=0;i<cont.size();i++){
			int na = cont[i];
			int nb = cont[(i+1)%cont.size()];
			answer[na][nb]=1;
			answer[nb][na]=1;
		}
	}
	// Imprimiendo
	/* for(auto elem: conjuntos){
		int llave = elem.first;
		vector<int> cont = elem.second;
		cout<<llave<<": ";
		for(auto x: cont){
			cout<<x<<" ";
		}
		cout<<endl;
	}*/
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:63:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |  for(int i=0;i<rep.size();i++){
      |              ~^~~~~~~~~~~
supertrees.cpp:77:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |   for(int i=0;i<cont.size();i++){
      |               ~^~~~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #3
19.0 / 19.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 0 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 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 7 ms 1228 KB Output is correct
9 Correct 179 ms 24056 KB Output is correct
10 Correct 0 ms 288 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1228 KB Output is correct
13 Correct 193 ms 23916 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 103 ms 14056 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 58 ms 6252 KB Output is correct
22 Correct 176 ms 23928 KB Output is correct
23 Correct 175 ms 24048 KB Output is correct
24 Correct 212 ms 23952 KB Output is correct
25 Correct 72 ms 14056 KB Output is correct
26 Correct 73 ms 14020 KB Output is correct
27 Correct 178 ms 23932 KB Output is correct
28 Correct 190 ms 23956 KB Output is correct
29 Correct 75 ms 14200 KB Output is correct

Subtask #4
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 Incorrect 0 ms 204 KB Too few ways to get from 1 to 2, should be 1 found 0
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -