Submission #976546

#	Time	Username	Problem	Language	Result	Execution time	Memory
976546		thegamercoder19	Rice Hub (IOI11_ricehub)	C++14	100 / 100	20 ms	4212 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>

#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ull MAX = 1LL << 24;
const ll MODD = 998244353;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout << (s ? "YES" : "NO") << endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;
int besthub(int n, int m, int X[], long long c)
{
	V<ll> pf(n + 1), a(n + 1);
	FOR(ll, i, 1, n + 1, 1)a[i] = X[i - 1], pf[i] = pf[i - 1] + a[i];
	ll ans = 0;
	FOR(ll,i,1,n+1,1)
	{
		ll l = i, r = n, m = 0, res = 0;
		WH(l <= r)
		{
			m = (l + r) >> 1;
			ll med = i + ((m - i) >> 1);
			// [i, med-1] coords <= med whilst [med,mid] >= med
			ll total = (med - i) * a[med] - (pf[med - 1] - pf[i - 1]) + (pf[m] - pf[med - 1]) - (m - med + 1) * a[med];
			if (total <= c) res = max(res, m - i + 1), l = m + 1;
			else r = m - 1;
		}
		ans = max(ans, res);
		
	}
	RET ans;
}

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32