oj.uz

Submission #698380

# Submission time Handle Problem Language Result Execution time Memory
698380 2023-02-13T10:32:20 Z Boomyday Rice Hub (IOI11_ricehub) C++14
25 / 100
 18 ms 3452 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using db = double;
using str = string; // yay python!

using ii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vii = vector<ii>;
using vpl = vector<pl>;
using vpd = vector<pd>;

#define tcT template<class T
#define tcTU tcT, class U

tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
tcT> using PR = pair<T,T>;

// pairs
#define mp make_pair
#define f first
#define s second

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define len(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!


vl fields;
vl field_prefs;



ll getScore(int l, int r){
    int m = (l+r)/2;
    ll sm = 0;
    sm +=  (m-l+1)*(fields[m-1]) - field_prefs[m]+field_prefs[l-1] ;
    sm += field_prefs[r]-field_prefs[m] - (r-m)*fields[m-1];
    return sm;
}



ll besthub(int R, int L, int X[], ll B){
    F0R(i, R) fields.pb(X[i]);
    field_prefs.resize(R+1);
    field_prefs[0] = 0;
    F0R(i, R) field_prefs[i+1] = fields[i] + field_prefs[i];
    int maxScore = 1;
    FOR(left, 1 ,R+1){
        int lower=left, upper=R;
        while(lower<upper){

            ll sm = getScore(lower, upper);
            if (sm<=B){
                maxScore = max(maxScore, upper-lower+1);
                lower = (lower+upper)/2 + 1;
            }
            else upper = (lower+upper)/2;
        }

    }
    return maxScore;

}
/*
int main(){
    int R;
    ll L, B;
    cin >> R >> L >> B;
    int fd[R];
    F0R(i, R) cin >> fd[i];
    cout << besthub(R, L, fd, B) << endl;
}*/

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

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

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 0 ms 212 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 17 ms 2376 KB Output is correct
4 Correct 18 ms 3452 KB Output is correct
5 Correct 7 ms 1740 KB Output is correct
6 Correct 7 ms 1740 KB Output is correct
7 Correct 16 ms 3160 KB Output is correct
8 Correct 16 ms 3164 KB Output is correct
9 Correct 8 ms 1612 KB Output is correct
10 Correct 7 ms 1612 KB Output is correct
11 Correct 18 ms 3400 KB Output is correct
12 Correct 18 ms 3400 KB Output is correct
13 Incorrect 8 ms 1740 KB Output isn't correct
14 Halted 0 ms 0 KB -