oj.uz

Submission #556511

# Submission time Handle Problem Language Result Execution time Memory
556511 2022-05-03T09:19:40 Z Dan4Life Rice Hub (IOI11_ricehub) C++17
100 / 100
 27 ms 1544 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll pref[100010];
ll sum(int i, int j){ return pref[j+1]-pref[i]; }

int besthub(int n, int m, int a[], ll b)
{
    pref[0] = 0; int ans = 0;
    for(int i = 0; i < n; i++)
        pref[i+1] = pref[i]+a[i];
    for(int i = 0; i < n; i++){
        int l = i, r = n-1;
        while(l<r){
            int mid = (l+r+1)/2; int j = mid;
            int med = (i+mid)/2; ll mn = (ll)4e18;
            for(int x = med-1; x <= med+1; x++){
                if(x<i or x>j) continue;
                ll sum1 = (ll)a[x]*(x-i+1)-sum(i,x);
                ll sum2 = sum(x+1,j)-(ll)a[x]*(j-x);
                mn = min(mn, sum1+sum2);
            }
            if(mn<=b) l=mid;
            else r = mid-1;
        }
        ans = max(ans, l-i+1);
    }
    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 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 1 ms 212 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 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 1 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 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct

Subtask #3
26.0 / 26.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 1 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 1 ms 212 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 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 212 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 212 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 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 468 KB Output is correct
2 Correct 4 ms 468 KB Output is correct
3 Correct 26 ms 1428 KB Output is correct
4 Correct 25 ms 1368 KB Output is correct
5 Correct 13 ms 896 KB Output is correct
6 Correct 12 ms 860 KB Output is correct
7 Correct 24 ms 1420 KB Output is correct
8 Correct 27 ms 1456 KB Output is correct
9 Correct 13 ms 900 KB Output is correct
10 Correct 14 ms 900 KB Output is correct
11 Correct 25 ms 1420 KB Output is correct
12 Correct 26 ms 1468 KB Output is correct
13 Correct 13 ms 980 KB Output is correct
14 Correct 12 ms 960 KB Output is correct
15 Correct 19 ms 1236 KB Output is correct
16 Correct 20 ms 1228 KB Output is correct
17 Correct 23 ms 1468 KB Output is correct
18 Correct 24 ms 1364 KB Output is correct
19 Correct 24 ms 1512 KB Output is correct
20 Correct 26 ms 1544 KB Output is correct