Submission #394330

#	Time	Username	Problem	Language	Result	Execution time	Memory
394330		snasibov05	Connecting Supertrees (IOI20_supertrees)	C++14	19 / 100	278 ms	24036 KiB

supertrees

#include "supertrees.h"
#include <vector>

using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n, vector<int>(n));
	vector<int> cmp_n(n, -1);
	vector<vector<int>> cmp;

	int k = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            if (p[i][j] == 2){
                if (cmp_n[i] != -1 && cmp_n[i] != cmp_n[j]) return 0;
                else if (cmp_n[i] != -1) continue;
                cmp_n[i] = cmp_n[j];
                cmp[cmp_n[i]].push_back(i);
            }
        }
        if (cmp_n[i] == -1) cmp_n[i] = k++, cmp.push_back({i});
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (cmp_n[i] == cmp_n[j] && p[i][j] == 0) return 0;
        }
    }

    for (int i = 0; i < cmp.size(); ++i) {
        if (cmp[i].size() == 2) return 0;
        for (int j = 1; j < cmp[i].size(); ++j) {
            answer[cmp[i][j-1]][cmp[i][j]] = answer[cmp[i][j]][cmp[i][j-1]] = 1;
        }
        if (cmp[i].size() != 1) answer[cmp[i].back()][cmp[i][0]] = answer[cmp[i][0]][cmp[i].back()] = 1;
    }



	build(answer);
	return 1;
}

Compilation message (stderr)

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

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