제출 #303853

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
303853		dolphingarlic	Connecting Supertrees (IOI20_supertrees)	C++14	21 / 100	257 ms	26108 KiB

supertrees

#include "supertrees.h"

#include <bits/stdc++.h>
using namespace std;

int cmp[1000];
vector<pair<int, int>> has[4];
vector<int> cn[1000];

int find(int A) {
	while (A != cmp[A]) A = cmp[A], cmp[A] = cmp[cmp[A]];
	return A;
}

void onion(int A, int B) { cmp[find(A)] = find(B); }

int construct(vector<vector<int>> p) {
	int n = p.size();

	for (int i = 0; i < n; i++) for (int j = 0; j < i; j++) {
		has[p[i][j]].push_back({i, j});
	}

	vector<vector<int>> ans(n, vector<int>(n, 0));

	iota(cmp, cmp + n, 0);
	for (pair<int, int> i : has[1]) onion(i.first, i.second);
	for (int i = 0; i < n; i++) cn[find(i)].push_back(i);
	for (int i = 0; i < n; i++) {
		if (!cn[i].size()) continue;
		for (int j = 1; j < cn[i].size(); j++)
			ans[cn[i][j]][cn[i][0]] = ans[cn[i][0]][cn[i][j]] = 1;
		cn[i].clear();
	}

	for (pair<int, int> i : has[0]) if (find(i.first) == find(i.second)) return 0;
	build(ans);
	return 1;
}

컴파일 시 표준 에러 (stderr) 메시지

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

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