제출 #576135

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
576135		Vanilla	슈퍼트리 잇기 (IOI20_supertrees)	C++17	0 / 100	1 ms	340 KiB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
const int maxn = 1002;
int dsu[maxn];
set <int> comp [maxn];

int get_dad (int x) {
	return dsu[x] = (x == dsu[x] ? x: get_dad(dsu[x]));
}

void merge (int a, int b){
	a = get_dad(a);
	b = get_dad(b);
	dsu[b] = a;
}


int construct(vector<vector<int>> p) {
	int n = p.size();
	vector <vector <int> > b (n, vector <int> (n));
	for (int i = 0; i < n; i++){
		dsu[i] = i;
		comp[i].insert(i);
	}
	for (int i = 0; i < n; i++){
		for (int j = 0; j < i; j++){
			if (p[i][j] != 0) merge(i,j);
		}
	}
	for (int i = 0; i < n; i++){
		for (int j = 0; j < i; j++){
			if (p[i][j] == 0 && get_dad(i) == get_dad(j)) return 0;
			if (get_dad(i) == get_dad(j)) comp[get_dad(i)].insert(j);
		}
	}
	for (int i = 0; i < n; i++){
		vector <int> v;
		for (int j: comp[i]) {
			v.push_back(j);
		}
		for (int j = 0; j < v.size(); j++){
			// cout << v[j] << " " << v[(j + 1) % v.size()] << "\n";
			b[v[j]][v[(j + 1) % v.size()]] = b[v[(j + 1) % v.size()]][v[j]] = 1;
		}
	}
	build(b);
	return 1;
}

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

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:42:21: 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 < v.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