oj.uz

Submission #716594

# Submission time Handle Problem Language Result Execution time Memory
716594 2023-03-30T13:29:59 Z Jarif_Rahman Rice Hub (IOI11_ricehub) C++17
100 / 100
 18 ms 2336 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

int besthub(int n, int L, int X[], long long B){
    vector<ll> pref(n, 0);
    for(int i = 0; i < n; i++){
        if(i) pref[i] = pref[i-1];
        pref[i]+=X[i];
    }

    auto sum = [&](int l, int r){
        return pref[r]-(l?pref[l-1]:0);
    };

    int ans = 1;
    for(int i = 0; i < n; i++){
        int c = min(i, n-i-1);
        int a = 1, b = c;
        if(c == 0){
            if(i+1 < n && X[i+1]-X[i] <= B) ans = max(ans, 2);
            continue;
        }
        while(a < b){
            int md = (a+b+1)/2;
            if(sum(i+1, i+md)-sum(i-md, i-1) <= B) a = md;
            else b = md-1;
        }

        if(sum(i+1, i+a)-sum(i-a, i-1) <= B) ans = max(ans, 2*a+1);
        else a = 0;
        if(i+a+1 < n && sum(i+1, i+a+1)-sum(i-a, i-1)-X[i] <= B) ans = max(ans, 2*a+2);
    }

    return ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 312 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 4 ms 484 KB Output is correct
3 Correct 13 ms 1492 KB Output is correct
4 Correct 13 ms 1492 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 6 ms 852 KB Output is correct
7 Correct 13 ms 1492 KB Output is correct
8 Correct 18 ms 1492 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 7 ms 852 KB Output is correct
11 Correct 14 ms 1492 KB Output is correct
12 Correct 13 ms 1440 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 8 ms 1244 KB Output is correct
15 Correct 10 ms 1864 KB Output is correct
16 Correct 10 ms 1968 KB Output is correct
17 Correct 13 ms 2192 KB Output is correct
18 Correct 12 ms 2308 KB Output is correct
19 Correct 14 ms 2312 KB Output is correct
20 Correct 13 ms 2336 KB Output is correct