제출 #247247

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
247247		oolimry	Lokahian Relics (FXCUP4_lokahia)	C++17	0 / 100	7 ms	768 KiB

lokahia

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

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);

	
	int cnt = 0;
	map<int,int> occur;
	
	int can = 0;
	while(cnt < 600){
		int a = rand() % N, b = rand() % N;
		if(a == b) continue;
		
		cnt++;
		int x = CollectRelics(a,b);
		if(x == -1) continue;
		
		occur[x]++;
		can++;
	}
	
	int best = -1;
	for(int i = 0;i < N;i++){
		//cout << occur[i] << "\n";
		if(occur[i] >= 120){
			best = i;
		}
		
	}
	
	//cout << best << " ";
	return best;
}

• Subtask 1: 0 / 100