oj.uz

Submission #724741

# Submission time Handle Problem Language Result Execution time Memory
724741 2023-04-15T20:22:44 Z Bogdan1110 Rice Hub (IOI11_ricehub) C++14
100 / 100
 17 ms 3284 KB 
#include <bits/stdc++.h>
#define FAST {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
#define FILES {freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);}
#define ll long long
#define ull unsigned long long
#define pqueue priority_queue
#define pb push_back
#define fi first
#define se second
#define ld long double
#define pii pair<int,int>
#define pll pair<long long,long long>
#define all(a) (a).begin(), (a).end()
#define mp make_pair 
using namespace std;
// order_of_key -> # less than k
// find_by_order -> k-th element
// pq max element
 
const double eps = 0.00000001;
const int NMAX = 100010;
const ll inf = LLONG_MAX/3;
const ll modi = 998244353;

ll s1[NMAX], s2[NMAX], X[NMAX];

#define SUM(l,r) (s1[r]-(l?s1[l-1]:0))

ll calc(int l, int r) {
    int mid = (l+r)/2;
    ll res = (mid-l+1)*(X[mid]) - SUM(l,mid);
    res += SUM(mid,r) - (r-mid+1)*(X[mid]);
    return res;
}

ll besthub(int n, int L, int  x[], ll b) {

    for (int i = 0 ; i < n ; i++) {
        s1[i] = x[i];
        X[i] = x[i];
        if ( i )
            s1[i] += s1[i-1];
    }
    ll res = 1;
    ll l = 0;
    ll r = 1;
    while(r<n) {
        //cout << l << ' ' << r << endl;
        ll temp = calc(l,r);
        if (temp <= b) {
            r++;
            res = max(res, r-l);
        }
        else {
            l++;
        }
    }
    return res;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #3
26.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 316 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 452 KB Output is correct
25 Correct 1 ms 456 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 356 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 2 ms 816 KB Output is correct
3 Correct 13 ms 3276 KB Output is correct
4 Correct 17 ms 3224 KB Output is correct
5 Correct 6 ms 1620 KB Output is correct
6 Correct 6 ms 1620 KB Output is correct
7 Correct 12 ms 2936 KB Output is correct
8 Correct 10 ms 3052 KB Output is correct
9 Correct 7 ms 1492 KB Output is correct
10 Correct 5 ms 1476 KB Output is correct
11 Correct 12 ms 3276 KB Output is correct
12 Correct 12 ms 3284 KB Output is correct
13 Correct 6 ms 1604 KB Output is correct
14 Correct 6 ms 1620 KB Output is correct
15 Correct 9 ms 2516 KB Output is correct
16 Correct 10 ms 2484 KB Output is correct
17 Correct 11 ms 2892 KB Output is correct
18 Correct 11 ms 2892 KB Output is correct
19 Correct 12 ms 3032 KB Output is correct
20 Correct 12 ms 3156 KB Output is correct