oj.uz

Submission #544536

# Submission time Handle Problem Language Result Execution time Memory
544536 2022-04-02T08:58:10 Z SavicS Rice Hub (IOI11_ricehub) C++17
100 / 100
 13 ms 1876 KB 
#include "ricehub.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 100005; 

int n, M; ll B;
int niz[mxN];

ll pref[mxN];

bool check(int X){
    
    ff(i,X,n){
        int L = i - X + 1;
        int R = i;

        int mid = (L + R) / 2;

        ll kol_L = 1ll * niz[mid] * (mid - L) - (pref[mid - 1] - pref[L - 1]);
        ll kol_R = pref[R] - pref[mid] - 1ll * (R - mid) * niz[mid];

        ll uk = kol_L + kol_R;
        if(uk <= B)return 1;

    }

    return 0;

}

int besthub(int _R, int _L, int _X[], ll _B){
    n = _R; M = _L; B = _B; ff(i,1,n)niz[i] = _X[i - 1];

    ff(i,1,n)pref[i] = pref[i - 1] + niz[i];

    int l = 1, r = n, ans = 0;
    while(l <= r){
        int mid = (l + r) / 2;
        if(check(mid)){
            ans = mid;
            l = mid + 1;
        }
        else r = mid - 1;
    }

    return ans;
}


// int main() {
//     cin.tie(0)->sync_with_stdio(0);

//     int _X[] = {1, 2, 10, 12, 14};
//     cout << besthub(5, 20, _X, 6) << '\n';

//     return 0;
// }
/*
 

 
// probati bojenje sahovski
*/

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 1 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 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 0 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 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 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 236 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 292 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 244 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 2 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 3 ms 596 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 13 ms 1756 KB Output is correct
4 Correct 12 ms 1876 KB Output is correct
5 Correct 6 ms 980 KB Output is correct
6 Correct 6 ms 1108 KB Output is correct
7 Correct 11 ms 1776 KB Output is correct
8 Correct 11 ms 1772 KB Output is correct
9 Correct 7 ms 1100 KB Output is correct
10 Correct 6 ms 1108 KB Output is correct
11 Correct 12 ms 1824 KB Output is correct
12 Correct 13 ms 1876 KB Output is correct
13 Correct 7 ms 980 KB Output is correct
14 Correct 9 ms 1108 KB Output is correct
15 Correct 9 ms 1408 KB Output is correct
16 Correct 9 ms 1444 KB Output is correct
17 Correct 10 ms 1620 KB Output is correct
18 Correct 10 ms 1620 KB Output is correct
19 Correct 11 ms 1748 KB Output is correct
20 Correct 11 ms 1748 KB Output is correct