# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1085761 | alexander707070 | Game (APIO22_game) | C++17 | 4061 ms | 50432 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>
#define MAXN 300007
using namespace std;
const int bucket_sz=500;
int n,k,bucket[MAXN];
int from[MAXN],to[MAXN];
int mins[MAXN],maxs[MAXN];
int li[MAXN],tim,cnt[MAXN];
vector<int> v[MAXN],r[MAXN],news;
void init(int N,int K){
n=N; k=K;
for(int i=1;i<=k;i++){
bucket[i]=i/bucket_sz+1;
}
for(int i=1;i<=k;i++){
mins[i]=maxs[i]=bucket[i];
from[i]=to[i]=i;
}
for(int i=k+1;i<=n;i++){
from[i]=n+1; to[i]=0;
mins[i]=800; maxs[i]=0;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |