Submission #313363

#	Time	Username	Problem	Language	Result	Execution time	Memory
313363		DanerZein	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	319 ms	30428 KiB

supertrees

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

typedef vector<int> vi;
typedef unordered_set<int> us;
int p1[1010],tam[1010],cc[1010],vis[1010];
void init(int n){
  for(int i=0;i<n;i++){
    p1[i]=i;
    cc[i]=i;
    tam[i]=1;
  }
}
int findset(int x,int sw){
  if(sw==1){
    if(p1[x]==x) return x;
    return p1[x]=findset(p1[x],sw);
  }
  if(sw==2){
    if(cc[x]==x) return x;
    return cc[x]=findset(cc[x],sw);
  }
 }
bool issameset(int i,int j,int sw){
  return findset(i,sw)==findset(j,sw);
}
void unionset(int i,int j,int sw){
  if(!issameset(i,j,sw)){
    int x=findset(i,sw),y=findset(j,sw);
    if(sw==1){
      p1[x]=y;
      tam[y]+=tam[x];
    }
    if(sw==2){
      cc[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(p[i][j]!=p[j][i]) return 0;
      if(i==j){
	if(p[i][j]==0 or p[i][j]==2) return 0;
	continue;
      }
      if(p[i][j]==2 or p[i][j]==1){
	if(p[i][j]==1)unionset(i,j,1);
	unionset(i,j,2);
      }
      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],1) or issameset(i,dt[i][j],2)){
	return 0;
      }
    }
  }
  for(int i=0;i<n;i++){
    if(tam[findset(i,2)]==2){
      return 0;
    }
  }
  
  vector<us> c1,c2;
  c1.resize(n); c2.resize(n);
  vi in;
  in.assign(n,-1);
  for(int i=0;i<n;i++){
    if(in[findset(i,1)]==-1){
      in[findset(i,1)]=i;
    }
    else{
      int a=in[findset(i,1)];
      bu[a][i]=bu[i][a]=1;
    }
    if(tam[findset(i,1)]==1){
      c2[findset(i,2)].insert(findset(i,1));
    }
    else{
      c1[findset(i,2)].insert(findset(i,1));
    }
  }
  /* for(int i=0;i<n;i++){
    cout<<i<<": ";
    for(auto &v:c1[i]) cout<<v<<" ";
    cout<<endl;
    for(auto &v:c2[i]) cout<<v<<" ";
    cout<<endl;
  }*/
  for(int i=0;i<n;i++){
    if(c2[i].empty()) continue;
    int ant=-1,ini;
    for(auto &v:c2[i]){
      if(ant==-1) {
	ini=(v);
	ant=(v);}
      else{
	bu[ant][v]=bu[v][ant]=1;
	ant=v;
      }
    }
    int t=c1[i].size();
    if(t==0){
      if(ant!=ini)
      bu[ant][ini]=bu[ini][ant]=1;
    }
    if(t==1){
      auto it=c1[i].begin();
      int a=findset((*it),1);
      bu[a][ant]=bu[ant][a]=1;
      bu[a][ini]=bu[ini][a]=1;
    }
    if(t==2){
      auto it=c1[i].begin();
      int a=findset((*it),1);
      it++;
      int b=findset((*it),1);
      bu[a][b]=bu[b][a]=1;
      bu[a][ini]=bu[ini][a]=1;
      bu[ant][b]=bu[b][ant]=1;
    }
  }
  
  /*for(int i=0;i<n;i++) cout<<in[findset(i,1)]<<" ";
  cout<<endl;
  for(int i=0;i<n;i++) cout<<ul[findset(i,1)]<<" ";
  cout<<endl;*/
  
  build(bu);
  return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:65:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |    for(int i=0;i<dt.size();i++){
      |                ~^~~~~~~~~~
supertrees.cpp:66:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(int j=0;j<dt[i].size();j++){
      |                 ~^~~~~~~~~~~~~
supertrees.cpp: In function 'int findset(int, int)':
supertrees.cpp:24:2: warning: control reaches end of non-void function [-Wreturn-type]
   24 |  }
      |  ^
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:119:26: warning: 'ini' may be used uninitialized in this function [-Wmaybe-uninitialized]
  119 |       bu[ant][ini]=bu[ini][ant]=1;
      |                          ^

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