Submission #1221141

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221141		hmms127	슈퍼트리 잇기 (IOI20_supertrees)	C++20	0 / 100	0 ms	328 KiB

supertrees

#include "supertrees.h"
#include <vector>
using namespace std;
int frq[1005];
struct DSU{
  vector<int>par,sz;
  void init(int n){
      par.resize(n+1);sz.resize(n+1);
      for(int i=0;i<n;i++)par[i]=i,sz[i]=1;
  }  
  int root(int u){
      return par[u]==u ? u:par[u]=root(par[u]);
  }
  bool merge(int u,int v){
      int ru=root(u),rv=root(v);
      frq[u]++;
      frq[v]++;
      if(ru==rv)return 0;
      if(sz[ru]>sz[rv])swap(sz[ru],sz[rv]);
      par[ru]=rv;sz[rv]+=sz[ru];
      return 1;
  }
};
int construct(std::vector<std::vector<int>> p) {
	int n=p[0].size();
    vector<vector<int>>v(n,vector<int>(n,0));
    DSU d,d1;d.init(n);d1.init(n);
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
        if(i==j)continue;
        if(p[i][j]){
            if(d.root(i)==d.root(j)){d1.merge(i,j);}
            else d.merge(i,j);
            v[i][j]=1;
            v[j][i]=1;
        }
        }
    }
     for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
         if(p[i][j]==0&&d.root(i)==d.root(j))return 0;
         if(p[i][j]==2&&((d.root(i)!=d.root(j))||(d1.root(i)!=d1.root(j))))return 0;
        }
    }
	build(v);
	return 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