제출 #1034187

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1034187		Gray	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	0 ms	348 KiB

supertrees

#include "supertrees.h"
#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();
	bool pos=1;
	DSU tr(n);
	vector<vector<int>> ans(n, vector<int>(n, 0));
	vector<vector<int>> A(n);
	for (int i=0; i<n; i++){
		for (int j=0; j<n; j++){
			if (p[i][j]){
				A[i].push_back(j);
				A[j].push_back(i);
				ans[i][j]=ans[j][i]=1;
			}
		}
	}
	for (ll i=0; i<n; i++){
		if (A[i].size()!=2 and A[i].size()!=0) pos=0;
	}
	if (!pos) return 0;
	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