oj.uz

답안 #114133

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
114133 2019-05-30T13:38:25 Z MladenP 쌀 창고 (IOI11_ricehub) C++17
49 / 100
 19 ms 2688 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
lld x[MAXN], 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 = 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

# 결과 실행 시간 메모리 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

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 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 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Incorrect 2 ms 384 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 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 Incorrect 2 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 15 ms 1536 KB Output is correct
4 Correct 16 ms 2688 KB Output is correct
5 Correct 9 ms 1280 KB Output is correct
6 Correct 9 ms 1280 KB Output is correct
7 Correct 15 ms 2196 KB Output is correct
8 Correct 14 ms 2304 KB Output is correct
9 Correct 9 ms 1196 KB Output is correct
10 Correct 9 ms 1152 KB Output is correct
11 Correct 19 ms 2560 KB Output is correct
12 Correct 18 ms 2552 KB Output is correct
13 Correct 9 ms 1280 KB Output is correct
14 Correct 10 ms 1280 KB Output is correct
15 Correct 13 ms 1920 KB Output is correct
16 Correct 15 ms 2048 KB Output is correct
17 Correct 17 ms 2304 KB Output is correct
18 Correct 16 ms 2304 KB Output is correct
19 Correct 17 ms 2432 KB Output is correct
20 Correct 18 ms 2424 KB Output is correct