제출 #313256

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

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int pa[1010];
void init(int n){
  for(int i=0;i<n;i++) pa[i]=i;
}
int findset(int x){
  if(pa[x]==x) return x;
  return pa[x]=findset(pa[x]);
 }
bool issameset(int i,int j){
  return findset(i)==findset(j);
}
void unionset(int i,int j){
  if(!issameset(i,j)){
    int x=findset(i),y=findset(j);
    pa[x]=y;
  }
}
int construct(std::vector<std::vector<int>> p) {
  vector<vi> bu;
  vector<vi> dt;
  int n=p.size();
  bu.resize(n);
  dt.resize(n);
  init(n);
  for(int i=0;i<n;i++) for(int j=0;j<n;j++) bu[i].push_back(0);
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      if(i==j){
	if(p[i][j]==0) return 0;
	continue;
      }
      if(p[i][j]==1){
	unionset(i,j);
      }
      else{
	dt[i].push_back(j);
	dt[j].push_back(i);
      }
    }
  }
  for(int i=0;i<dt.size();i++){
    for(int j=0;j<dt[i].size();j++){
      if(issameset(i,dt[i][j])){
	return 0;
      }
    }
  }
  vi ant;
  ant.assign(n,-1);
  for(int i=0;i<n;i++){
    if(ant[findset(i)]==-1){
      ant[findset(i)]=i;
    }
    else{
      int a=ant[findset(i)];
      bu[a][i]=bu[i][a]=1;
      ant[findset(i)]=i;
    }
  }
  build(bu);
  return 1;
}

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

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:45:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |   for(int i=0;i<dt.size();i++){
      |               ~^~~~~~~~~~
supertrees.cpp:46:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int j=0;j<dt[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