Submission #405350

#	Time	Username	Problem	Language	Result	Execution time	Memory
405350		Andyvanh1	Rice Hub (IOI11_ricehub)	C++14	17 / 100	1093 ms	2488 KiB

ricehub

#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

#define vt vector
#define pb push_back
#define all(x) x.begin(),x.end()

typedef vt<int> vi;
typedef long long ll;
typedef pair<int,int> pii;

ll prefsum[100005];

int besthub(int r, int l, int x[], ll b){
    prefsum[0] = 0;
    for(int i = 1; i <= r; i++){
        prefsum[i] = prefsum[i-1]+x[i-1];
    }
    int ans = 1;
    for(int i = 0; i < r; i++){
        for(int j = ans+1; j < r; j++){
            int mid = (i+j)>>1;
            ll n = x[mid]*(2*mid-j-i+1)-(prefsum[mid+1]-prefsum[i])+(prefsum[j+1]-prefsum[mid+1]);
            if(n < b){
                ans = max(ans,j-i+1);
            }
        }
    }
    return ans;


}

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