# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363542 | soroush | Dancing Elephants (IOI11_elephants) | C++14 | 3551 ms | 12720 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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 3e6 + 100;
const int sq = 400;
int n , l , SZ , cnt , ucnt;
int x[maxn];
int a[maxn] , b[maxn];
struct comp{
int a[sq * 2] , cnt[sq * 2] , lst[sq * 2] , sz;
void init(){
int k = sz;
for(int i = sz ; i ; i --){
while(k > i and a[k - 1] - a[i] > l)k --;
if(a[sz] - a[i] <= l) cnt[i] = 1 , lst[i] = a[i] + l;
else cnt[i] = cnt[k] + 1 , lst[i] = lst[k];
}
}
}comps[sq];
void init(int N , int L , int X[]){
n = N , l = L;
SZ = 380 , cnt = 1;
for(int i = 0 ; i < n ; i ++){
x[i] = X[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... |