제출 #1034216

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

supertrees

#include "supertrees.h"
#include <map>
#include <vector>
 
using namespace std;
 
#define ll long long
#define ff first
#define ss second
#define ln "\n"
#define pll pair<ll, ll>
 
struct DSU{
	vector<ll> p;
	ll n;
	DSU(ll N){
		n=N;
		p.resize(n, -1);
	}
	ll get(ll x){
		return p[x]==-1?x:p[x]=get(p[x]);
	}
	bool unite(ll a, ll b){
		a=get(a);
		b=get(b);
		if (a==b) return 0;
		p[a]=b;
		return 1;
	}
};
 
int construct(std::vector<std::vector<int>> p) {
	int n = (int)p.size();
	DSU tr(n);
	vector<vector<int>> A(n);
	for (int i=0; i<n; i++){
		for (int j=0; j<n; j++){
			if (i!=j and p[i][j]==2){
				tr.unite(i, j);
			}
		}
	}
	for (int i=0; i<n; i++){
		for (int j=0; j<n; j++){
			if (i!=j and p[i][j]==0 and tr.get(i)==tr.get(j)){
				return 0;
			}
		}
	}
	map<ll, vector<ll>> cc;
	for (ll i=0; i<n; i++){
		cc[tr.get(i)].push_back(i);
	}
	vector<vector<int>> ans(n, vector<int>(n, 0));
	for (auto &[comp, mem]:cc){
		if (mem.size()==2){
			return 0;
		}
		if (mem.size()==1) continue;
		for (ll i=0; i<(ll)mem.size(); i++){
			ll nxt=(i+1)%(ll)(mem.size()), nxt2=(i+2)%(ll)(mem.size());
			ans[mem[i]][mem[nxt]]=ans[mem[i]][mem[nxt2]]=ans[mem[nxt]][mem[i]]=ans[mem[nxt2]][mem[i]]=1;
		}
	}
	build(ans);
	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