# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
887359 | abcvuitunggio | Dancing Elephants (IOI11_elephants) | C++17 | 3340 ms | 18452 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 "elephants.h"
#include <bits/stdc++.h>
using namespace std;
const int sz=400,sz2=399,maxN=150000;
int n,l,x[maxN+1],idx[maxN+1],q,pos[maxN+1];
pair <int, int> nxt[maxN/sz+1][sz+sz2+1];
vector <int> v[maxN/sz+1];
void calc(int k){
if (v[k].empty())
return;
int j=v[k].size()-1;
for (int i=j;i>=0;i--){
while (x[v[k][i]]+l<x[v[k][j]])
j--;
if (j==v[k].size()-1)
nxt[k][i]={i,0};
else{
j++;
nxt[k][i]={nxt[k][j].first,nxt[k][j].second+1};
}
}
}
void init(int N, int L, int X[]){
n=N,l=L;
for (int i=0;i<n;i++){
x[i]=X[i];
idx[i]=i;
}
sort(idx,idx+n,[](int i, int j){return x[i]<x[j];});
for (int i=0;i*sz<n;i++){
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... |