oj.uz

Submission #390847

# Submission time Handle Problem Language Result Execution time Memory
390847 2021-04-17T08:22:16 Z SavicS Rice Hub (IOI11_ricehub) C++14
100 / 100
 50 ms 2924 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 dud[maxn];
void upd(int x, ll val){
	while(x <= maxn){
		dud[x] += val;
		x += x&(-x);
	}
}
ll query(int x){
	ll sum = 0;
	while(x > 0){
		sum += dud[x];
		x -= x&(-x);
	}
	return sum;
}

bool check(int x){
		
	ff(i,1,n)dud[i] = 0;	
	
	{
		ff(i,1,x)upd(i, niz[i]);
		
		int id = (1 + x) / 2;
		ll zbirL = niz[id] * (id - 1) - query(id - 1);
		ll zbirR = query(n) - query(id) - niz[id] * (x - id);

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

	
	ff(i,x + 1, n){
		upd(i - x, -niz[i - x]);
		upd(i, niz[i]);
		
		int id = (i + i - x + 1) / 2;
		ll zbirL = niz[id] * (id - (i - x + 1)) - query(id - 1);
		ll zbirR = query(n) - query(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];
	
	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];
//	
//	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 308 KB Output is correct
2 Correct 1 ms 332 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 332 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 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 332 KB Output is correct
6 Correct 1 ms 332 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 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 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 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 308 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 332 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 308 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 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 308 KB Output is correct
6 Correct 1 ms 332 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 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 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 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 3 ms 332 KB Output is correct
25 Correct 3 ms 460 KB Output is correct
26 Correct 3 ms 460 KB Output is correct
27 Correct 4 ms 460 KB Output is correct
28 Correct 4 ms 460 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 716 KB Output is correct
2 Correct 18 ms 720 KB Output is correct
3 Correct 43 ms 2872 KB Output is correct
4 Correct 42 ms 2924 KB Output is correct
5 Correct 42 ms 1356 KB Output is correct
6 Correct 50 ms 1436 KB Output is correct
7 Correct 40 ms 2636 KB Output is correct
8 Correct 42 ms 2620 KB Output is correct
9 Correct 38 ms 1356 KB Output is correct
10 Correct 43 ms 1344 KB Output is correct
11 Correct 42 ms 2892 KB Output is correct
12 Correct 43 ms 2884 KB Output is correct
13 Correct 45 ms 1488 KB Output is correct
14 Correct 44 ms 1484 KB Output is correct
15 Correct 32 ms 2168 KB Output is correct
16 Correct 33 ms 2272 KB Output is correct
17 Correct 49 ms 2636 KB Output is correct
18 Correct 39 ms 2640 KB Output is correct
19 Correct 41 ms 2796 KB Output is correct
20 Correct 41 ms 2812 KB Output is correct