제출 #540791

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
540791		AmirElarbi	쌀 창고 (IOI11_ricehub)	C++14	68 / 100	18 ms	700 KiB

ricehub

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

    #define ii pair<int,int>
    #define ve vector
    #define vi vector<int>
    #define vii vector<ii>
    #define pb push_back
    #define fi first
    #define se second
    #define ll long long
    #define MAX_R  1000000
    #define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    using namespace std;
    int besthub(int r, int l, int s[], long long b){
        ll cur = b, i = s[0];
        int u = 0, v = 0;
        while(v < r-1 && cur-(s[v+1]-i) >= 0){
            v++;
            cur -= s[v]-i;
        }
        int mx = v-u+1;
        for (int k = 1; k < r; ++k)
        {
            i = s[k];      
            cur += (v-k+1)*(s[k]-s[k-1]) - (k-u)*(s[k]-s[k-1]);   
            if(k > v) v = k;   
            while(cur < 0 && u < v){
                if(i-s[u] < s[v]-i){
                    cur += s[v]-i;
                    v--;
                } else {
                    cur += i-s[u];
                    u++;
                }
            }
            while(v < r-1 && i-s[u] >= s[v+1]-i ){
                cur += i-s[u] - (s[v+1]-i);
                u++;
                v++;
            }
            while(cur >= 0 && (u > 0 || v < r-1)){
                if(v >= r-1){
                    if(cur - (i-s[u-1]) < 0) break;
                    u--;
                    cur -= i-s[u];
                } else if(u <= 0){
                    if(cur - (s[v+1]-i) < 0) break;
                    v++;
                    cur -= s[v]-i;
                } else if(i-s[u-1] > s[v+1]-i){
                    if(cur - (s[v+1]-i) < 0) break;
                    v++;
                    cur -= s[v]-i;
                } else {
                    if(cur - (i-s[u-1]) < 0) break;
                    u--;
                    cur -= i-s[u];
                }
            }
            mx = max(mx,v-u+1);
        }
        return mx;
    }

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