| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 284770 | ec1117 | 쌀 창고 (IOI11_ricehub) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
const int MOD = 1000000007;
const char nl = '\n';
const int MX = 100001; //check the limits, dummy
int besthub(int r,int l, ll x[],ll b) {
int lhub=0;
int p=0;
int rhub=0;
ll rice=0;//riceused
int mx=1;
while(rhub<r-1 && rice+x[rhub+1]-x[p]<=b){
rhub++;
rice+=x[rhub]-x[p];
}
mx=max(mx, rhub-lhub+1);
while(p<r-1 && rhub<r){
rice+=-1LL*(x[p+1]-x[p])*1LL*((rhub-p-1)-(p-lhub));
p++;
while(rice>b){//more hubs to the left than right
rice-=x[p]-x[lhub];//remove lhub
lhub++;
}
while(rhub<r-1 && p<r-1 && rice-(x[p]-x[lhub])+(x[rhub+1]-x[p])<=b){//do i add rhub+1?
rice-=x[p]-x[lhub];
lhub++;
while(rhub<r-1 && rice+x[rhub+1]-x[p]<=b){
rhub++;
rice+=x[rhub]-x[p];
}
if(lhub>p)break;
}
while(lhub!=0 && rice+(x[p]-x[lhub-1])<=b){
lhub--;
rice+=x[p]-x[lhub];
}
mx=max(mx,rhub-lhub+1);
}
return mx;
}
//
//int main(){
// int x[]={1,3,7};
// cout << besthub(3,10,x,1)<<nl;
// cout << besthub(3,10,x,2)<<nl;
// cout << besthub(3,10,x,4)<<nl;
// cout << besthub(3,10,x,6)<<nl;
// return 0;
//}