oj.uz

Submission #581263

# Submission time Handle Problem Language Result Execution time Memory
581263 2022-06-22T12:39:13 Z stevancv Rice Hub (IOI11_ricehub) C++14
42 / 100
 13 ms 2108 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int mxn = 1e5 + 2;
int a[mxn];
ll n, k;
ll Get(ll l, ll r) {
    if (l > r) return 0LL;
    ll ans = a[r];
    if (l > 0) ans -= a[l - 1];
    return ans;
}
bool Can(ll x) {
    for (ll i = 0; i <= n - x; i++) {
        ll j = i + x - 1;
        ll o = i + j >> 1;
        ll val = Get(o, o);
        ll tr = val * (o - i + 1) - Get(i, o);
        tr += Get(o + 1, j) - val * (j - o);
        if (tr <= k) return true;
    }
    return false;
}
int besthub(int N, int M, int A[], ll K) {
    n = N; k = K;
    for (ll i = 0; i < n; i++) {
        a[i] = A[i];
        if (i > 0) a[i] += a[i - 1];
    }
    ll l = 1; ll r = n;
    int ans = l;
    while (l <= r) {
        ll mid = l + r >> 1;
        if (Can(mid)) {
            l = mid + 1;
            ans = mid;
        }
        else r = mid - 1;
    }
    return ans;
}

Compilation message

ricehub.cpp: In function 'bool Can(long long int)':
ricehub.cpp:22:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |         ll o = i + j >> 1;
      |                ~~^~~
ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:39:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   39 |         ll mid = l + r >> 1;
      |                  ~~^~~

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 308 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 308 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 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 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 1 ms 304 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 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 1 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 212 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 212 KB Output is correct
10 Correct 1 ms 304 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 1 ms 312 KB Output is correct
15 Correct 0 ms 304 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 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 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Incorrect 1 ms 320 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 596 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 13 ms 2108 KB Output is correct
4 Incorrect 11 ms 2060 KB Output isn't correct
5 Halted 0 ms 0 KB -