oj.uz

Submission #114132

# Submission time Handle Problem Language Result Execution time Memory
114132 2019-05-30T13:36:55 Z MladenP Rice Hub (IOI11_ricehub) C++17
17 / 100
 18 ms 2296 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], n, b;
bool check(int 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 = 1, 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 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 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct

Subtask #2
0 / 25.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 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Incorrect 2 ms 256 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 26.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 384 KB Output is correct
5 Incorrect 2 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Incorrect 18 ms 2296 KB Output isn't correct
4 Halted 0 ms 0 KB -