Submission #247157

#	Time	Username	Problem	Language	Result	Execution time	Memory
247157		oolimry	로카히아 유적 (FXCUP4_lokahia)	C++17	0 / 100	6 ms	640 KiB

lokahia

#include "lokahia.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;

int p[205];
int sz[205];

int findSet(int u){
	if(u == p[u]) return u;
	else return findSet(p[u]);
}

int SZ(int u){ return sz[findSet(u)]; }

void unionSet(int u, int P){
	u = findSet(u), P = findSet(P);
	p[u] = P;
	sz[P] += sz[u];
}

int FindBase(int N){
	srand(time(NULL));
	vector<int> v;
	
	if(N == 1){
		return 0;
	}
	
	for(int i = 0;i < N;i++) v.push_back(i);
	
	for(int i = 0;i < N;i++){
		p[i] = i;
		sz[i] = 1;
	}
	
	int cnt = 0;
	map<int,int> occur;
	
	while(cnt < 300){
		int a = rand() % N, b = rand() % N;
		if(a == b) continue;
		
		cnt++;
		int x = CollectRelics(a,b);
		occur[x]++;
	}
	
	int best = 0;
	for(int i = 0;i < N;i++){
		if(occur[best] < occur[i]){
			best = i;
		}
	}
	
	int total = 0;
	for(int i = 0;i < N;i++){
		if(i == best){
			total++;
			continue;
		}
		
		if(CollectRelics(i,best) != -1) total++;
	}
	
	//cout << best;
	if(total > (N/2)) return best;
	//assert(false);
	//cout << best;
	return -1;
}

• Subtask 1: 0 / 100