제출 #421092

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
421092		OttoTheDino	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	19 ms	2116 KiB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;

#define rep(i,s,e)                          for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                         for (int i = s; i >= e; --i)
#define pb                                  push_back
#define pf                                  push_front
#define fi                                  first
#define se                                  second
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;

int besthub (int r, int l, int x[], long long b) {
    int ans = 1, right = 0, cur = 1;
    ll tot = 0;
    deque<int> dq;
    dq.pb(x[0]);
    rep (i,1,r-1) {
        while (right<r-1) {
            ll newy = tot;
            dq.pb(x[right+1]);
            int nmid = dq[((int)dq.size()-1)/2];
            newy += dq.back()-nmid; 
            if (newy<=b) {
                tot = newy;
                ans = max(ans, ++cur);
                right++;
            }
            else {
                dq.pop_back();
                break;
            }
        }
        tot -= dq[((int)dq.size()-1)/2]-dq.front();
        if ((int)dq.size()%2==0) tot -= dq[(int)dq.size()/2]-dq[((int)dq.size()-1)/2];
        dq.pop_front();
        cur--;
    }
    return ans;
}

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