oj.uz

Submission #319801

# Submission time Handle Problem Language Result Execution time Memory
319801 2020-11-06T12:52:08 Z zaneyu Rice Hub (IOI11_ricehub) C++14
100 / 100
 28 ms 2156 KB 
/*input
5 20 6
1
2
10
12
14
3

*/
#include "ricehub.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e6+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(dist(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define MP make_pair
ll mult(ll a,ll b){
    ll res=0LL;
    while(b){
        if(b&1) res=(res+a)%MOD;
        a=(a+a)%MOD;
        b>>=1;
    }
    return res%MOD;
}
ll mypow(ll a,ll b){
    ll res=1LL;
    while(b){
        if(b&1) res=res*a%MOD;
        a=a*a%MOD;
        b>>=1;
    }
    return res;
}
int arr[maxn];
int n;
ll b;
bool wk(ll x){
    deque<int> bef,aft;
    ll sb=0,sa=0;
    REP(i,x/2) bef.pb(arr[i]),sb+=arr[i];
    REP(i,(x+1)/2) aft.pb(arr[i+x/2]),sa+=arr[i+x/2];
    REP(i,n-x){
        ll cur=aft[0];
        if(cur*(x/2)-sb+sa-((x+1)/2)*cur<=b){
            return true;
        } 
        aft.pb(arr[i+x]);
        sa+=arr[i+x];
        sb-=bef[0];
        bef.pop_front();
        sb+=cur;
        sa-=cur;
        aft.pop_front();
        bef.pb(cur);
    }
    ll cur=aft[0];
    if(cur*(x/2)-sb+sa-((x+1)/2)*cur<=b){
        return true;
    } 
    return false;
}
int besthub(int N, int L, int X[], long long B){
    b=B;
    n=N;
    REP(i,n) arr[i]=X[i];
    int l=1,r=n;
    while(l<r){
        int mid=(l+r+1)/2;
        if(wk(mid)) l=mid;
        else r=mid-1;
    }
    return l;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 360 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 620 KB Output is correct
2 Correct 7 ms 612 KB Output is correct
3 Correct 23 ms 2092 KB Output is correct
4 Correct 22 ms 2156 KB Output is correct
5 Correct 14 ms 1132 KB Output is correct
6 Correct 11 ms 1036 KB Output is correct
7 Correct 20 ms 1584 KB Output is correct
8 Correct 21 ms 1584 KB Output is correct
9 Correct 11 ms 780 KB Output is correct
10 Correct 11 ms 876 KB Output is correct
11 Correct 24 ms 1588 KB Output is correct
12 Correct 24 ms 1588 KB Output is correct
13 Correct 12 ms 876 KB Output is correct
14 Correct 12 ms 876 KB Output is correct
15 Correct 17 ms 1276 KB Output is correct
16 Correct 17 ms 1276 KB Output is correct
17 Correct 20 ms 1444 KB Output is correct
18 Correct 21 ms 1452 KB Output is correct
19 Correct 28 ms 1520 KB Output is correct
20 Correct 21 ms 1524 KB Output is correct