oj.uz

답안 #434101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
434101 2021-06-20T15:02:05 Z illyakr 쌀 창고 (IOI11_ricehub) C++14
43 / 100
 72 ms 1464 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
#define ll long long

ll Abs(ll x) {
    if (x < 0)return -x;
    return x;
}

ll have;
ll n;
ll a[101010];
ll tr(ll x) {
    ll now = have;
    ll cl = 1;
    for (ll i = 1; i <= n; i++) {
        if (Abs(a[i] - x) < Abs(a[cl] - x))
            cl = i;
    }
    ll ans = 0;

    if (Abs(a[cl] - x) <= now) {
        now -= Abs(a[cl] - x);
        ans++;
        ll l = cl - 1, r = cl + 1;
        while (true) {
            if (l < 1 && r > n)break;
            if (l < 1 && r <= n && Abs(a[r] - x) <= now) {
                now -= Abs(a[r] - x);
                r++;ans++;continue;
            }
            if (r > n && l >= 1 && Abs(a[l] - x) <= now) {
                now -= Abs(a[l] - x);
                l--;ans++;continue;
            }


            if (l >= 1 && r <= n && Abs(a[l] - x) <= Abs(a[r] - x) && Abs(a[l] - x) <= now) {
                now -= Abs(a[l] - x);
                l--;ans++;continue;
            }
            if (l >= 1 && r <= n && Abs(a[l] - x) >= Abs(a[r] - x) && Abs(a[r] - x) <= now) {
                now -= Abs(a[r] - x);
                r++;ans++;continue;
            }

            break;
        }
    }
//    cout << x << " ---   " << ans << " " << cnt << endl;
    return ans;
}

ll ans = 0;
int besthub(int R, int L, int X[], long long B) {
    n = R;
    for (ll i = 0; i < R; i++)
        a[i + 1] = X[i];
    have = B;

    int l = 0, r = L + 1;
    while (l + 2 < r) {
        int m1 = l + (r - l) / 3;
        int m2 = r - (r - l) / 3;
        if (tr(m1) <= tr(m2))
            l = m1;
        else
            r = m2;
    }
    for (ll i = l; i <= r; i++) {
        ans = max(ans, tr(i));
    }
    return ans;
}

/**
5 20 6
1
2
10
12
14
3
*/

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 4 ms 332 KB Output is correct
26 Correct 4 ms 460 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 364 KB Output is correct

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 460 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 56 ms 1356 KB Output is correct
4 Correct 63 ms 1456 KB Output is correct
5 Correct 13 ms 892 KB Output is correct
6 Correct 16 ms 892 KB Output is correct
7 Correct 52 ms 1356 KB Output is correct
8 Correct 47 ms 1356 KB Output is correct
9 Correct 13 ms 844 KB Output is correct
10 Correct 13 ms 892 KB Output is correct
11 Correct 58 ms 1464 KB Output is correct
12 Correct 72 ms 1424 KB Output is correct
13 Incorrect 17 ms 844 KB Output isn't correct
14 Halted 0 ms 0 KB -