Submission #314040

#	Time	Username	Problem	Language	Result	Execution time	Memory
314040		linear00000	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	1 ms	640 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

vector<vector<int> > d;
vector<int> C[1004];

int par[1004], num = 0;

int findpar(int N) {
	if (N == par[N]) return N;
	else return par[N] = findpar(par[N]);
}

void merge(int a, int b) {
	int aa = findpar(a), bb = findpar(b);
	par[aa] = bb;
}

int construct(vector<vector<int> > v) {
	int n = v.size();
	for (int i=0; i<n; i++) par[i] = i;
	d.resize(n);
	for (int i=0; i<n; i++) d[i].resize(n);
	for (int i=0; i<n; i++) {
		for (int j=i + 1; j < n; j++) {
			if (v[i][j] == 2 && i != j) merge(i, j);
		}
	}
	for (int i=0; i<n; i++) {
		for (int j=i + 1; j < n; j++) {
			if (v[i][j] == 0) {
				if (findpar(i) == findpar(j)) return 0;
			}
		}
	}
	for (int i=0; i<n; i++) par[i] = findpar(i);
	for (int i=0; i<n; i++) C[par[i]].push_back(i);
	for (int i=0; i<n; i++) {
		vector<int> tmp;
		for (int j=0; j<C[i].size(); j++) {
			if (C[i][j] != i) {
				d[i][C[i][j]] = 1, d[C[i][j]][i] = 1;
				tmp.push_back(C[i][j]);
			}
			if (tmp.size() <= 2 && tmp.size() >= 1) return 0;
			else d[tmp[0]][tmp[2]] = 1, d[tmp[2]][tmp[0]] = 1;
		}
	}
	
	build(d);
	return 1;
}

Compilation message (stderr)

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

• Subtask 1: 0 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4