oj.uz

Submission #311973

# Submission time Handle Problem Language Result Execution time Memory
311973 2020-10-12T05:31:04 Z jainbot27 Rice Hub (IOI11_ricehub) C++17
100 / 100
 24 ms 2560 KB 
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

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

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;



int besthub(int R, int L, int* X, ll B){
    #define int long long
    ll p[R], sum;
    F0R(i, R){
        if(i) p[i] = p[i-1] + X[i];
        else p[i] = X[i];
        // cout << p[i] << ' ';
    } 
    // cout << nl;
    int i = 0, res = 0; 
    F0R(j, R){
        sum = (((i+j)/2 - i + 1) - (j-(i+j)/2)) * X[(i+j)/2] - (p[(i+j)/2] - (i?p[i-1]:0)) + (p[j] - p[(i+j)/2]);
        // cout << j << " " << i << " " << (j-i+1)*(X[(i+j)/2]) << " " << (p[(i+j)/2] - (i?p[i-1]:0)) << " " <<  (p[j] - p[(i+j)/2])<< endl;
        // cout << i << ' ' << j << ' ' << sum << nl;
        while(sum > B){
            i++;
            // sum = (j - i + 1) * X[(i+j)/2] - (p[(i+j)/2] - (i?p[i-1]:0)) + (p[j] - p[(i+j)/2]);
            sum = (((i+j)/2 - i + 1) - (j-(i+j)/2)) * X[(i+j)/2] - (p[(i+j)/2] - (i?p[i-1]:0)) + (p[j] - p[(i+j)/2]);
            // cout << j << " " << i << " " << sum << endl;
            // cout << j << " " << i << " " << (j-i+1)*(X[(i+j)/2]) << " " << (p[(i+j)/2] - (i?p[i-1]:0)) << " " <<  (p[j] - p[(i+j)/2])<< endl;
            // cout << i<< ' ' << j << ' ' << sum << nl;
        }
        ckmax(res, j - i + 1);
    }
    return res;
}

// int32_t main(){
//     ios_base::sync_with_stdio(0); cin.tie(0);
//     int X[] = {1, 2, 10, 12, 14};
//     cout << besthub(5, 20, X, 6) << nl;

//     return 0;
// }

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 19 ms 2560 KB Output is correct
4 Correct 19 ms 2560 KB Output is correct
5 Correct 8 ms 1280 KB Output is correct
6 Correct 8 ms 1280 KB Output is correct
7 Correct 17 ms 2304 KB Output is correct
8 Correct 17 ms 2304 KB Output is correct
9 Correct 8 ms 1152 KB Output is correct
10 Correct 8 ms 1280 KB Output is correct
11 Correct 21 ms 2552 KB Output is correct
12 Correct 24 ms 2560 KB Output is correct
13 Correct 9 ms 1280 KB Output is correct
14 Correct 9 ms 1280 KB Output is correct
15 Correct 16 ms 1920 KB Output is correct
16 Correct 16 ms 2000 KB Output is correct
17 Correct 20 ms 2304 KB Output is correct
18 Correct 18 ms 2304 KB Output is correct
19 Correct 20 ms 2432 KB Output is correct
20 Correct 20 ms 2432 KB Output is correct