oj.uz

Submission #390848

# Submission time Handle Problem Language Result Execution time Memory
390848 2021-04-17T08:25:55 Z SavicS Rice Hub (IOI11_ricehub) C++14
100 / 100
 18 ms 1872 KB 
#include "ricehub.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const int inf = 1e9 + 5;

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)

int n, m;
ll b;
int niz[maxn];

ll pref[maxn];

bool check(int x) {

    {
        int id = (1 + x) / 2;
        ll zbirL = niz[id] * (id - 1) - pref[id - 1];
        ll zbirR = pref[x] - pref[id] - niz[id] * (x - id);

        if(zbirL + zbirR <= b)return 1;
    }


    ff(i,x + 1, n) {

        int id = (i + i - x + 1) / 2;
        ll zbirL = niz[id] * (id - (i - x + 1)) - (pref[id - 1] - pref[i - x]);
        ll zbirR = pref[i] - pref[id] - niz[id] * (i - id);

        if(zbirL + zbirR <= 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)) {
            l = mid + 1;
            ans = mid;
        } else r = mid - 1;
    }

    return ans;
}

//int main()
//{
//   	ios::sync_with_stdio(false);
//   	cout.tie(nullptr);
//  	cin.tie(nullptr);
//	cin >> n >> m >> b;
//	ff(i,1,n)cin >> niz[i];
//
//	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)){
//			l = mid + 1;
//			ans = mid;
//		}
//		else r = mid - 1;
//	}
//
//	cout << ans << endl;
//
//   	return 0;
//}
///**
//
//5 20 6
//1 2 10 12 14
//
//// probati bojenje sahovski ili slicno
//
//**/

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 588 KB Output is correct
2 Correct 4 ms 588 KB Output is correct
3 Correct 16 ms 1868 KB Output is correct
4 Correct 16 ms 1732 KB Output is correct
5 Correct 9 ms 1100 KB Output is correct
6 Correct 9 ms 1040 KB Output is correct
7 Correct 14 ms 1780 KB Output is correct
8 Correct 14 ms 1824 KB Output is correct
9 Correct 8 ms 1100 KB Output is correct
10 Correct 9 ms 1100 KB Output is correct
11 Correct 16 ms 1792 KB Output is correct
12 Correct 16 ms 1868 KB Output is correct
13 Correct 10 ms 1100 KB Output is correct
14 Correct 9 ms 1112 KB Output is correct
15 Correct 12 ms 1488 KB Output is correct
16 Correct 12 ms 1468 KB Output is correct
17 Correct 14 ms 1704 KB Output is correct
18 Correct 14 ms 1668 KB Output is correct
19 Correct 15 ms 1816 KB Output is correct
20 Correct 18 ms 1872 KB Output is correct