oj.uz

Submission #556264

# Submission time Handle Problem Language Result Execution time Memory
556264 2022-05-02T16:45:55 Z Dan4Life Rice Hub (IOI11_ricehub) C++17
68 / 100
 16 ms 2508 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 k)
{
    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;
            if(med>=i and med<=j)
                mn = min(mn, (ll)a[med]*(med-i+1)-sum(i,med)+sum(med+1,j)-a[med]*(j-med));
            med--;
            if(med>=i and med<=j)
                mn = min(mn, (ll)a[med]*(med-i+1)-sum(i,med)+sum(med+1,j)-a[med]*(j-med));
            med+=2;
            if(med>=i and med<=j)
                mn = min(mn, (ll)a[med]*(med-i+1)-sum(i,med)+sum(med+1,j)-a[med]*(j-med));
        }
        if(mn<=k) 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 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 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 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 0 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 1 ms 212 KB Output is correct
16 Correct 0 ms 312 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 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 312 KB Output is correct
26 Correct 1 ms 212 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 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 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 340 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 312 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 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 360 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 468 KB Output is correct
2 Correct 4 ms 596 KB Output is correct
3 Correct 12 ms 2456 KB Output is correct
4 Incorrect 16 ms 2508 KB Output isn't correct
5 Halted 0 ms 0 KB -