Submission #502171

# Submission time Handle Problem Language Result Execution time Memory
502171 2022-01-05T12:05:22 Z HappyPacMan Rice Hub (IOI11_ricehub) C++14
100 / 100
13 ms 1740 KB
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;

int besthub(int R, int L, int X[], long long B){
    int res = 0;
    long long baht = 0;
    for(int i=0,j=0;i<R;i++){
        while(j+1 < R && baht + X[j+1]-X[(i+j+1)/2] <= B){
            baht += X[j+1]-X[(i+j+1)/2];
            j++;
            res = max(res,j-i+1);
        }
        baht -= X[(i+j+1)/2]-X[i];
    }
    return res;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 300 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 304 KB Output is correct
16 Correct 0 ms 300 KB Output is correct
17 Correct 0 ms 280 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 304 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 312 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 444 KB Output is correct
2 Correct 2 ms 424 KB Output is correct
3 Correct 11 ms 1740 KB Output is correct
4 Correct 11 ms 1692 KB Output is correct
5 Correct 5 ms 756 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 13 ms 1448 KB Output is correct
8 Correct 9 ms 1424 KB Output is correct
9 Correct 5 ms 708 KB Output is correct
10 Correct 5 ms 672 KB Output is correct
11 Correct 11 ms 1648 KB Output is correct
12 Correct 13 ms 1724 KB Output is correct
13 Correct 8 ms 840 KB Output is correct
14 Correct 6 ms 844 KB Output is correct
15 Correct 8 ms 1360 KB Output is correct
16 Correct 11 ms 1368 KB Output is correct
17 Correct 10 ms 1520 KB Output is correct
18 Correct 9 ms 1456 KB Output is correct
19 Correct 10 ms 1612 KB Output is correct
20 Correct 10 ms 1660 KB Output is correct