# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
16228 |
2015-08-18T10:22:37 Z |
ggoh |
Rice Hub (IOI11_ricehub) |
C++ |
|
0 ms |
4988 KB |
#include "ricehub.h"
#include<cstdio>
int besthub(int R,int L,int *X,long long B)
{
int ch,p,q,h,i;
long long s;
p=0;q=R+1;
while(p!=q-1)
{
h=(p+q)/2;
s=0;
ch=0;
for(i=h/2;i<h;i++)
{
s+=(long long)(X[i]-X[h-1-i]);
}
if(s<=B)ch=1;
for(i=h;i<R&&ch==0;i++)
{
s+=(long long)(X[i]-X[i-h/2]);
s-=(long long)(X[i-h/2]-X[i-h]);
if(s<=B)ch=1;
}
if(ch)p=h;
else q=h;
}
return p;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
4988 KB |
Output is correct |
2 |
Incorrect |
0 ms |
4988 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
4988 KB |
Output is correct |
2 |
Correct |
0 ms |
4988 KB |
Output is correct |
3 |
Correct |
0 ms |
4988 KB |
Output is correct |
4 |
Correct |
0 ms |
4988 KB |
Output is correct |
5 |
Incorrect |
0 ms |
4988 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
4988 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
4988 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |