# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18717 | ggoh | Dancing Elephants (IOI11_elephants) | C++98 | 4915 ms | 22044 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<cstdio>
#include<vector>
#include<algorithm>
int a,b,sq,t,how,dpsz,z[150002],x[150002],yy[150002],D[391][781],len[391][781],LEN[391][781],sz[391];
void madp(int num)
{
if(sz[num]==0)return ;
len[num][sz[num]]=2000000001;
int q=0;
for(int j=0;j<sz[num];j++)
{
while(len[num][q]<=len[num][j]+b)q++;
z[j]=q;
}
for(int j=sz[num]-1;j>=0;j--)
{
if(z[j]==sz[num])
{
D[num][j]=1;
LEN[num][j]=len[num][j]+b;
}
else
{
D[num][j]=1+D[num][z[j]];
LEN[num][j]=LEN[num][z[j]];
}
}
}
void makedp()
{
# | 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... |