# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402754 | Jasiekstrz | Dancing Elephants (IOI11_elephants) | C++17 | 6745 ms | 12636 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>
#define fi first
#define se second
using namespace std;
const int NN=15e4;
const int S=400; // how many in one block
//const int S=4;
int l;
struct Block
{
int d;
int t[2*S+10];
pair<int,int> dp[2*S+10];
Block()
{
d=0;
}
void clear()
{
d=0;
return;
}
void recount()
{
dp[d]={0,0};
for(int i=d-1,j=d;i>=0;i--)
{
while(t[i]+l<t[j-1])
j--;
# | 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... |