# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287356 | Namnamseo | Dancing Elephants (IOI11_elephants) | C++17 | 7713 ms | 13916 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 <algorithm>
#include <vector>
#include <cstdlib>
#include <cstring>
#define BS 400
using namespace std;
int n;
int l;
struct buck {
int pos[1010];
int dp [1010];
int ep [1010];
int sz;
buck(){ sz=0; }
void recalcDP(int until){
for(int i=until; 0<=i; --i){
auto it=upper_bound(pos, pos+sz, pos[i]+l);
if(it == pos+sz){
dp[i] = 0;
ep[i] = pos[i];
} else {
dp[i] = 1+dp[it-pos];
ep[i] = ep[it-pos];
}
}
}
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... |