oj.uz

Submission #115284

# Submission time Handle Problem Language Result Execution time Memory
115284 2019-06-06T13:55:23 Z oolimry Rice Hub (IOI11_ricehub) C++14
100 / 100
 24 ms 2432 KB 
#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;

int besthub(int R, int L, int X[], long long B)
{
    long long pre[R];
    pre[0] = X[0];
    for(long long i = 1;i < R;i++){
        pre[i] = pre[i-1] + X[i];
    }
    long long ans = 0;


    for(long long i = 0;i < R;i++){
        long long pos = X[i];
        long long low = 0;
        long long high = R;
        while(true){
            if(low == high - 1) break;
            long long s = (low + high) / 2;

            long long l  = i - s;
            long long u = i + s;
            if(l < 0 || u >= R){
                high = s;
                continue;
            }

            long long sum = 0ll;
            sum += pre[i];
            if(l > 0) sum -= pre[l-1];
            sum = (s + 1) * pos - sum;
            sum += pre[u];
            sum -= pre[i];
            sum -= pos * s;
            if(sum > B){
                high = s;
            }
            else{
                low = s;
            }
        }
        ans = max(ans, 2 * low + 1);
        long long l = i - low;
        long long u = i + low;
        long long sum = 0ll;
        sum += pre[i];
        if(l > 0) sum -= pre[l-1];
        sum = (low + 1) * pos - sum;
        sum += pre[u];
        sum -= pre[i];
        sum -= pos * low;
        
        if(l > 0 && sum + abs(pos - X[l-1]) <= B){
            ans = max(ans, 2 * low + 2);
        }
        if(u + 1 < R && sum + abs(pos - X[u+1]) <= B){
            ans = max(ans, 2 * low + 2);
        }
    }
    return ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 384 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 3 ms 412 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 3 ms 384 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 23 ms 1536 KB Output is correct
4 Correct 23 ms 1536 KB Output is correct
5 Correct 12 ms 896 KB Output is correct
6 Correct 9 ms 896 KB Output is correct
7 Correct 20 ms 1536 KB Output is correct
8 Correct 22 ms 1656 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 23 ms 1536 KB Output is correct
12 Correct 24 ms 1536 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 11 ms 1280 KB Output is correct
15 Correct 18 ms 2048 KB Output is correct
16 Correct 18 ms 2048 KB Output is correct
17 Correct 22 ms 2304 KB Output is correct
18 Correct 21 ms 2304 KB Output is correct
19 Correct 23 ms 2432 KB Output is correct
20 Correct 22 ms 2432 KB Output is correct