# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132578 | tmwilliamlin168 | Dancing Elephants (IOI11_elephants) | C++14 | 6159 ms | 12280 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 mxN=1.5e5, B=400, mxBC=(mxN-1)/B+1;
int n, l, *x, uc, bc, r[mxBC];
map<int, int> mp;
vector<int> v[mxBC];
vector<array<int, 2>> w[mxBC];
void init(int N, int L, int X[]) {
n=N;
l=L;
x=X;
for(int i=0; i<n; ++i)
++mp[x[i]];
}
void bb(int i) {
w[i]=vector<array<int, 2>>(v[i].size());
for(int j1=(int)v[i].size()-1, j2=v[i].size(); ~j1; --j1) {
while(v[i][j2-1]>v[i][j1]+l)
--j2;
w[i][j1]=j2<v[i].size()?array<int, 2>{w[i][j2][0]+1, w[i][j2][1]}:array<int, 2>{1, v[i][j1]+l};
}
}
void bld() {
bc=0;
for(pair<int, int> p : mp) {
if(!bc||v[bc-1].size()>=B)
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... |