제출 #983076

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
983076		tamir1	Connecting Supertrees (IOI20_supertrees)	C++17	100 / 100	184 ms	32664 KiB

supertrees

#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int sz[1001],par[1001],vis[1001];
int find(int a){
	if(a==par[a]) return a;
	int x=find(par[a]);
	par[a]=x;
	return x;
}
void join(int x,int y){
	x=find(x);
	y=find(y);
	if(x==y) return;
	if(sz[x]<sz[y]) swap(x,y);
	else if(sz[x]==sz[y] && x>y) swap(x,y);
	sz[x]+=sz[y];
	par[y]=x;
}
vector<pair<int,int>> node[4];
vector<int> v[1001],x,y;
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	for(int i=0;i<n;i++){
		sz[i]=1;
		par[i]=i;
		for(int j=0;j<n;j++){
			node[p[i][j]].push_back({i,j});
		}
	}
	std::vector<std::vector<int>> answer(n,vector<int> (n,0));
	for(auto [x,y]:node[1]) join(x,y);
	for(int i=0;i<n;i++){
		v[find(i)].push_back(i);
	}
	for(int i=0;i<n;i++){
		if(v[i].size()==0) continue;
		for(int j=1;j<v[i].size();j++){
			vis[v[i][j]]=1;
			answer[v[i][0]][v[i][j]]=answer[v[i][j]][v[i][0]]=1;
		}
		v[i].clear();
	}
	for(auto [x,y]:node[2]) join(x,y);
	for(int i=0;i<n;i++){
		if(!vis[i]) v[find(i)].push_back(i);
	}
	for(int i=0;i<n;i++){
		if(v[i].size()<2) continue;
		if(v[i].size()==2) return 0;
		answer[v[i][0]][v[i].back()]=answer[v[i].back()][v[i][0]]=1;
		for(int j=1;j<v[i].size();j++){
			answer[v[i][j-1]][v[i][j]]=answer[v[i][j]][v[i][j-1]]=1;
		}
	}
	if(node[3].size()!=0) return 0;
	for(auto [x,y]:node[0]){
		if(find(x)==find(y)) return 0;
	}
	build(answer);
	return 1;
}

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

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

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