oj.uz

Submission #556492

# Submission time Handle Problem Language Result Execution time Memory
556492 2022-05-03T09:03:32 Z Dan4Life Rice Hub (IOI11_ricehub) C++17
100 / 100
 19 ms 1480 KB 
#include "ricehub.h"
#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;
    for(int i = 0; i < n; i++) pref[i+1] = pref[i]+a[i];
    int l = 1, r = n;
    while(l<r){
        ll mid = (l+r+1)/2, mn = (ll)4e18;
        for(int i = 0; i <= n-mid; i++){
            int j = i+mid-1; int med = (i+j)/2;
            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;
    }
    return l;
}

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 0 ms 212 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 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 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 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 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 212 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 1 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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 1 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 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 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 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 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 5 ms 468 KB Output is correct
3 Correct 12 ms 1408 KB Output is correct
4 Correct 12 ms 1364 KB Output is correct
5 Correct 10 ms 900 KB Output is correct
6 Correct 10 ms 852 KB Output is correct
7 Correct 10 ms 1360 KB Output is correct
8 Correct 10 ms 1480 KB Output is correct
9 Correct 10 ms 892 KB Output is correct
10 Correct 10 ms 872 KB Output is correct
11 Correct 12 ms 1380 KB Output is correct
12 Correct 19 ms 1364 KB Output is correct
13 Correct 12 ms 900 KB Output is correct
14 Correct 13 ms 820 KB Output is correct
15 Correct 9 ms 1112 KB Output is correct
16 Correct 11 ms 1176 KB Output is correct
17 Correct 15 ms 1264 KB Output is correct
18 Correct 12 ms 1308 KB Output is correct
19 Correct 12 ms 1376 KB Output is correct
20 Correct 11 ms 1364 KB Output is correct