Submission #31238

# Submission time Handle Problem Language Result Execution time Memory
31238 2017-08-15T11:08:44 Z 14kg Rice Hub (IOI11_ricehub) C++11
0 / 100
3 ms 5020 KB
#include "ricehub.h"
#define LL long long

long long f(int x, int y, int *r){
    return (LL)(r[y]-r[x])*(LL)(y-x+1)/(LL)2;
}
int besthub(int n, int max_L, int in[], long long B){
    int x=0, y=0, out=0;
    while(x<n){
        while(y+1<n && f(x,y+1,in)<=B) y++;
        out=out>y-x+1?out:y-x+1, x++;
    } return out;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5020 KB Output is correct
2 Incorrect 0 ms 5020 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5020 KB Output is correct
2 Correct 0 ms 5020 KB Output is correct
3 Correct 0 ms 5020 KB Output is correct
4 Incorrect 0 ms 5020 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5020 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 5020 KB Output isn't correct
2 Halted 0 ms 0 KB -