oj.uz

Submission #114155

# Submission time Handle Problem Language Result Execution time Memory
114155 2019-05-30T18:44:29 Z MladenP Rice Hub (IOI11_ricehub) C++17
100 / 100
 18 ms 1152 KB 
#include<bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x);
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define mid (l+r)/2
#define endl '\n'
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXN 100010
int x[MAXN];
lld n, b;
bool check(lld key) {
    int c = key/2;
    lld l = c, r = key-l-1;
    lld L = 0, R = 0;
    for(int i = 0; i < c; i++) L += x[i];
    for(int i = c+1; i < key; i++) R += x[i];
    lld rez = R-r*x[c]+l*x[c]-L;
    for(int i = 1; i <= n-key; i++) {
        c++;
        L -= x[i-1]; L += x[c-1];
        R -= x[c]; R += x[i+key-1];
        if(R-r*x[c]+l*x[c]-L < rez) rez = R-r*x[c]+l*x[c]-L;
    }
    return rez <= b;
}
int besthub(int R, int L, int X[], long long B) {
    n = R, b = B;
    for(int i = 0; i < R; i++) x[i] = X[i];
    int l = 2, r = R, rez = 1;
    while(l <= r) {
        if(check(mid)) rez = mid, l = mid+1;
        else r = mid-1;
    }
    return rez;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 16 ms 1152 KB Output is correct
4 Correct 17 ms 1152 KB Output is correct
5 Correct 8 ms 768 KB Output is correct
6 Correct 9 ms 768 KB Output is correct
7 Correct 14 ms 1152 KB Output is correct
8 Correct 14 ms 1152 KB Output is correct
9 Correct 9 ms 768 KB Output is correct
10 Correct 8 ms 768 KB Output is correct
11 Correct 18 ms 1152 KB Output is correct
12 Correct 18 ms 1152 KB Output is correct
13 Correct 9 ms 768 KB Output is correct
14 Correct 9 ms 768 KB Output is correct
15 Correct 14 ms 896 KB Output is correct
16 Correct 13 ms 896 KB Output is correct
17 Correct 16 ms 1024 KB Output is correct
18 Correct 16 ms 1024 KB Output is correct
19 Correct 17 ms 1024 KB Output is correct
20 Correct 16 ms 1024 KB Output is correct