Submission #149605

#	Time	Username	Problem	Language	Result	Execution time	Memory
149605		서울대학교 연구공원 944동 삼성전자서울대연구소 (#200)	Lokahian Relics (FXCUP4_lokahia)	C++17	0 / 100	7 ms	640 KiB

lokahia

#include "lokahia.h"

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

mt19937_64 rng(94949);
int R(int a, int b)
{
	return uniform_int_distribution<int>(a, b)(rng);
}

int FindBase(int N){
	if(N==1) return 0;
	
	vector<int> x;
	for(int i=0; i<N; ++i) x.push_back(i);

	shuffle(x.begin(), x.end(), rng);

	vector<int> cnt(N);

	for(int i=0; i<N/2; ++i)
	{
		int v1 = x[2*i];
		int v2 = x[2*i+1];
		int y = CollectRelics(v1, v2);
		//printf("%d %d %d\n", v1, v2, y);
		if(y != -1) cnt[y] ++;
	}
	if(N%2==1) cnt[x[N-1]]++;
	int maxi = max_element(cnt.begin(), cnt.end()) - cnt.begin();

	if(cnt[maxi] == 0) return -1;

	int cc = 1;
	for(int i=0; i<N; ++i)
		if(i != maxi && -1 != CollectRelics(maxi, i))
			++cc;
	if(cc > N/2) return maxi;
	return -1;
}

• Subtask 1: 0 / 100