oj.uz

Submission #115269

# Submission time Handle Problem Language Result Execution time Memory
115269 2019-06-06T12:47:22 Z oolimry Rice Hub (IOI11_ricehub) C++14
26 / 100
 1000 ms 1536 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(int i = 1;i < R;i++){
        pre[i] = pre[i-1] + X[i];
    }
    long long ans = 0;
    for(int pos = 1;pos <= L;pos++){
        int lr = lower_bound(X,X+R,pos) - X;
        int rl = upper_bound(X,X+R,pos) - X;
        int low = 0;
        int high = 1000000;
        //cout << pos << " " << lr << " " << rl << " ";
        while(true){
            if(low == high - 1) break;
            int s = (low + high) / 2;
            int ll = lr - s;
            int rr = rl + s;
            if(ll < 0 || rr > R){
                high = s;
                continue;
            }

            long long sum = 0ll;
            sum += pre[lr-1];
            if(ll > 0) sum -= pre[ll-1];
            sum = s * pos - sum;
            sum += pre[rr-1];
            sum -= pre[rl-1];
            sum -= s * pos;
            //cout << "\n" << pos << " " << sum << " " << s << "wow\n";
            if(sum > B){
                high = s;
            }
            else{
                low = s;
            }
        }
        int ll = lr - low;
        int rr = rl + low;
        long long sum = 0ll;
        sum += pre[lr-1];
        if(ll > 0) sum -= pre[ll-1];
        sum = low * pos - sum;
        sum += pre[rr-1];
        sum -= pre[rl-1];
        sum -= low * pos;
        long long nos = rr - ll;
        ans = max(nos, ans);
        if(ll > 0 && sum + abs(pos - X[ll-1]) <= B){
            ans = max(nos+1,ans);
        }
        if(rr < R && sum + abs(pos - X[rr]) <= B){
            ans = max(nos+1,ans);
        }
        //cout << low << "\n";
    }
    return ans;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 96 ms 400 KB Output is correct
4 Correct 99 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 3 ms 256 KB Output is correct
18 Correct 3 ms 256 KB Output is correct
19 Correct 87 ms 256 KB Output is correct
20 Correct 88 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 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 97 ms 384 KB Output is correct
26 Correct 96 ms 416 KB Output is correct
27 Correct 99 ms 504 KB Output is correct
28 Correct 100 ms 416 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 512 KB Output is correct
2 Correct 22 ms 628 KB Output is correct
3 Execution timed out 1067 ms 1536 KB Time limit exceeded
4 Halted 0 ms 0 KB -