| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 247105 | errorgorn | Lokahian Relics (FXCUP4_lokahia) | C++17 | 5 ms | 768 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 <bits/stdc++.h>
#include "lokahia.h"
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);(s<e?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
mt19937 rng (chrono::system_clock::now().time_since_epoch().count());
const int trial=20; //test different startings
const int samples=12; //test different random places
vector<int> shuf(vector<int> v){
rep(x,0,sz(v)){
swap(v[x],v[rng()%(x+1)]);
}
return v;
}
int FindBase(int n){
if (n==1) return 1;
int best=-1;
int root;
vector<int> v;
rep(x,0,n) v.push_back(x);
shuf(v);
rep(x,0,min(trial,sz(v))){
int node=v[x];
int curr=0;
rep(zzz,0,samples){
int temp;
do{
temp=rng()%n;
} while (temp==node);
//cout<<"debug: "<<node<<" "<<temp<<endl;
if (CollectRelics(node,temp)!=-1) curr++;
}
if (curr>best){
best=curr;
root=node;
}
}
int ans=-1;
int cnt=1;
rep(x,0,n) if (x!=root){
int temp=CollectRelics(root,x);
if (temp!=-1) cnt++,ans=max(ans,temp);
}
//cout<<ans<<" "<<cnt<<endl;
if (cnt>n/2) return ans;
else return -1;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
