Submission #314053

#	Time	Username	Problem	Language	Result	Execution time	Memory
314053		linear00000	Connecting Supertrees (IOI20_supertrees)	C++14	40 / 100	267 ms	22268 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);

	// checking
	int type = 0;

	for (int i=0; i<n; i++) {
		for (int j=0; j<n; j++) {
			if (v[i][j] == 2) {
			    type = 2; break;
			}
			if (v[i][j] == 1) type = 1;
		}
		if (type == 2) break;
	}
	if (type == 2) {
        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++) {
            int cnt = 0;
            if (C[i].size() == 2) return 0;
            else if (C[i].size() >= 3) {
                for (int j=0; j<C[i].size() - 1; j++) {
                    d[C[i][j]][C[i][j + 1]] = 1, d[C[i][j + 1]][C[i][j]] = 1;
                }
                d[C[i][C[i].size() - 1]][C[i][0]] = 1, d[C[i][0]][C[i][C[i].size() - 1]] = 1;
            }
        }
	}
    else {
        for (int i=0; i<n; i++) {
            for (int j=i + 1; j < n; j++) {
                if (v[i][j] == 1 && 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++) {
            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;
            }
        }
    }
	build(d);
	return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:58:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |                 for (int j=0; j<C[i].size() - 1; j++) {
      |                               ~^~~~~~~~~~~~~~~~
supertrees.cpp:55:17: warning: unused variable 'cnt' [-Wunused-variable]
   55 |             int cnt = 0;
      |                 ^~~
supertrees.cpp:81:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |             for (int j=0; j<C[i].size(); j++) {
      |                           ~^~~~~~~~~~~~

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