oj.uz

Submission #996367

# Submission time Handle Problem Language Result Execution time Memory
996367 2024-06-10T13:57:24 Z hasan2006 Rice Hub (IOI11_ricehub) C++17
100 / 100
 17 ms 3740 KB 
#include <bits/stdc++.h>

using namespace std;
#define ll long long

const int N = 1e5 + 9 , mod = 1e9 + 7;
ll a[N] ;


int besthub(int R, int L, int *X, ll B) {
    ll i , l , r , m , x , s , ans = 0;
    for(i = 1; i <= R; i++)
        a[i] = X[i - 1] + a[i - 1];
    for(i = 1; i <= R; i++){
        l = i , r = R;
        while(l != r){
            m = (l + r + 1) / 2;
            x = (m + i) / 2;
            s = (X[x - 1] * (x - i) - (a[x - 1] - a[i - 1])) + (a[m] - a[x] - X[x - 1] * (m - x));
            if(s <= B)  l = m;
            else  r =  m - 1;
        }
        ans = max(ans , r - i + 1);
    }
    return ans;
}
// Author : حسن

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2652 KB Output is correct
2 Correct 3 ms 2652 KB Output is correct
3 Correct 14 ms 3676 KB Output is correct
4 Correct 14 ms 3740 KB Output is correct
5 Correct 6 ms 3012 KB Output is correct
6 Correct 6 ms 2856 KB Output is correct
7 Correct 12 ms 3420 KB Output is correct
8 Correct 12 ms 3416 KB Output is correct
9 Correct 6 ms 2908 KB Output is correct
10 Correct 6 ms 2960 KB Output is correct
11 Correct 14 ms 3676 KB Output is correct
12 Correct 15 ms 3676 KB Output is correct
13 Correct 6 ms 3060 KB Output is correct
14 Correct 8 ms 2860 KB Output is correct
15 Correct 10 ms 3372 KB Output is correct
16 Correct 10 ms 3248 KB Output is correct
17 Correct 17 ms 3504 KB Output is correct
18 Correct 13 ms 3420 KB Output is correct
19 Correct 13 ms 3672 KB Output is correct
20 Correct 13 ms 3676 KB Output is correct