| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 336328 | hackxsaras | Rice Hub (IOI11_ricehub) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
// #include "chrono"
using namespace std;
// using namespace std::chrono;
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define galen_colin {ios_base::sync_with_stdio(false);}
#define orz {cin.tie(NULL); cout.tie(NULL);}
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define mp make_pair
#define f first
#define s second
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << ""; for(int i = 0; i < v.size(); i++) {if (i) cout << " "; cout << v[i];} return cout << "\n";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
cin >> p.first;
return cin >> p.second;
}
template<typename A> istream& operator>>(istream& cin, vector<A> &v) {
for(auto &x:v)cin>>x;
return cin;
}
ll min(ll a, int b){return min(a, (ll) b);}
ll min(int a, ll b){return min(b, (ll) a);}
ll max(ll a, int b){return max(a, (ll) b);}
ll max(int a, ll b){return max(b, (ll) a);}
void usaco(string filename) {
// #pragma message("be careful, freopen may be wrong")
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const ld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
const ll INF = 1e9+7;
ll n, m, k, q, l, r, x, y, z;
const ll sz = 1e6 + 1;
string s, t;
ll ans = 0;
//BINARY SEARCH OVER THE NUMBER OF ALLOTED THINGS,
//we can calcuate a prefix array, and then search for the optimal point and break into -ve and +ve
//now if any of the window gets true, return true
vl pre, rice;
bool check2(deque<ll> &v, ll alloted, ll s){
//the median
ll med = v[v.size()/2 - (v.size()%2==0)];
// cout<<"\n";
// cout<<med<<" ";
ll l=s, r=s + v.size() - 1;
ll optimal = s;
while(l<=r){
ll m = (l+r)/2;
if(med >= rice[m]){
optimal = m;
l = m+1;
} else {
r = m-1;
}
}
ll left = optimal-s + 1;
ll right = v.size() - left;
ll cost = med*left - (pre[optimal+1] - pre[s]) + pre[min(n, s + v.size())] - pre[min(optimal+1, n)] - med*right;//excluding optimal in Right
// for(int i=0;i<v.size();i++)cout<<v[i]<<" ";cout<<"=";
// cout<<cost<<" "<< left<<" "<<right<<" "<<optimal<<"\n";
return cost <= alloted;
}
bool check1(ll window){
deque<ll> v;
for(int i=0;i<window;i++){
v.pb(rice[i]);
}
bool ans = check2(v, k, 0);
for(ll i=window;i<n;i++){
v.pop_front();
v.pb(rice[i]);
ans |= check2(v, k, i - window + 1);
}
return ans;
}
ll besthub(ll R, ll L, ll ricef[], ll B) {
n = R, k = B;
pre.resize(R+1);
rice.resize(R);
for(ll i=0;i<R;i++){
rice[i] = ricef[i];
pre[i+1] = pre[i] + rice[i];
}
ll ans = 1;
ll l=2, r = R;
while(l <= r){
m = (l+r)/2;
//cout<<m<<" "<<check1(m)<<"\n";
if(check1(m)){
ans = m;
l = m+1;
} else {
r = m-1;
}
}
return ans;
}
// int main() {
// ll R = 5, L = 20, B = 6, X[5] = {1,2,10,12,14};
// cout<<besthub(R, L, X, B);
// }