답안 #16697

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
16697 2015-09-07T11:20:26 Z CodingBug 쌀 창고 (IOI11_ricehub) C++
49 / 100
25 ms 4988 KB
#include "ricehub.h"

int besthub(int R, int L, int X[], long long B)
{
    int s,e,m,mx;
    long long su;
    for(s=0,e=0,su=0,mx=0;e<R;){
        if(su<B){
            if(mx<e-s+1) mx=e-s+1;
            e++;
            m=(s+e)/2;
            su+=X[e]-X[m];
        }else{
            s++;
            m=(s+e)/2;
            su-=X[m]-X[s-1];
        }
    }
    return mx;
}
# 결과 실행 시간 메모리 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 Correct 0 ms 4988 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4988 KB Output is correct
2 Runtime error 3 ms 4984 KB SIGSEGV Segmentation fault
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 -
# 결과 실행 시간 메모리 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 15 ms 4988 KB Output is correct
5 Correct 5 ms 4988 KB Output is correct
6 Correct 4 ms 4988 KB Output is correct
7 Correct 0 ms 4988 KB Output is correct
8 Correct 0 ms 4988 KB Output is correct
9 Correct 4 ms 4988 KB Output is correct
10 Correct 0 ms 4988 KB Output is correct
11 Correct 25 ms 4988 KB Output is correct
12 Correct 0 ms 4988 KB Output is correct
13 Correct 0 ms 4988 KB Output is correct
14 Correct 0 ms 4988 KB Output is correct
15 Correct 11 ms 4988 KB Output is correct
16 Correct 12 ms 4988 KB Output is correct
17 Correct 18 ms 4988 KB Output is correct
18 Correct 0 ms 4988 KB Output is correct
19 Correct 0 ms 4988 KB Output is correct
20 Correct 0 ms 4988 KB Output is correct