Submission #390847

#	Time	Username	Problem	Language	Result	Execution time	Memory
390847		SavicS	Rice Hub (IOI11_ricehub)	C++14	100 / 100	50 ms	2924 KiB

ricehub

#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 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32