Submission #1041065

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041065		inkvizytor	Rice Hub (IOI11_ricehub)	C++17	25 / 100	8 ms	4448 KiB

ricehub

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

int besthub(int R, int L, int X[], long long B) {
    vector<long long> dp (R+1, 0);
    for (int i = 0; i < R; i++) {
        dp[i+1] = dp[i]+X[i];
    }
    int poc=1, kon=1;
    int score = 0;
    while (kon <= R) {
        int sr = (poc+kon)/2;
        if (!((kon-poc)%2)) {
            int s = dp[kon]-dp[sr]-dp[sr-1]+dp[poc-1];
            if (s <= B) {
                score = max(score, kon-poc+1);
                kon++;
            }
            else {
                poc++;
            }
        }
        else {
            int s = dp[kon]-dp[sr]*2+dp[poc-1];
            if (s <= B) {
                score = kon-poc+1;
                kon++;
            }
            else {
                poc++;
            }
        }
    }
    return score;
}

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