Submission #540791

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
540791	2022-03-21 18:13:50	AmirElarbi	Rice Hub (IOI11_ricehub)	C++14	68 / 100	18 ms	700 KiB

ricehub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
    #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;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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