# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
312489 | knon0501 | Dancing Elephants (IOI11_elephants) | C++14 | 3613 ms | 14200 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>
using namespace std;
int t=350;
int n,L,m;
int b[150000];
int c[150000];
struct A{
int x,cnt,nxt,idx;
};
vector<A> a[400];
int C;
void init(){
int i,j;
for(i=0 ; i<n ; i++)c[i]=b[i];
sort(c,c+n);
for(i=0 ; i<=(n-1)/t ; i++)a[i].clear();
for(i=0 ; i<n ;i++)
a[i/t].push_back({c[i],0,0});
for(i=(n-1)/t ; i>=0 ; i--){
for(j=(int)a[i].size()-1 ; j>=0 ; j--){
if(a[i][j].x+L>=a[i].rbegin()->x){
a[i][j].nxt=a[i][j].x+L;
a[i][j].cnt=1;
}
else{
auto k=upper_bound(a[i].begin(),a[i].end(),(A){a[i][j].x+L,0,0},[&](A q,A w){
return q.x<w.x;
});
a[i][j].cnt=k->cnt+1;
a[i][j].nxt=k->nxt;
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... |