# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
247251 | oolimry | Lokahian Relics (FXCUP4_lokahia) | C++17 | 7 ms | 1152 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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] >= 100){
best = i;
}
}
if(best == -1) assert(false);
return best;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |