oj.uz

답안 #481897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
481897 2021-10-22T07:34:30 Z uHyHn 쌀 창고 (IOI11_ricehub) C++14
58 / 100
 16 ms 2532 KB 
#include<bits/stdc++.h>

//IBOW
#define Task "IOI11_RICEHUB"
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cerr << #A << "[" << _ << "] = " << (A[_]) << '\n'; }
#define DB2(A, _, __) { cerr << #A << "[" << _ << "][" << __ << "] = " << (A[_][__]) << '\n'; }
#define DB3(A, _, __, ___) { cerr << #A << "[" << _ << "][" << __ << "][" << ___ << "] = " << (A[_][__][___]) << '\n'; }
#define pb push_back
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define eb emplace_back

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;

const int N = 2e5 + 10;
const int inf = 2e9 + 10;
const ll INF = 2e18 + 10;
const int MOD = 1e9 + 7;

bool ok(int va, int n, int l, int x[], ll B, ll pre[])
{
    ll mn = INF;
    for (int i = va; i <= n; ++i)
    {
        int rr = i;
        int ll = i - va + 1;
        int median = (rr + ll) / 2;
        for (int j = median - 1; j <= median + 1; ++j)
        {
            mn = min(mn, x[j] * 1LL * (j - ll + 1) - (pre[j] - pre[ll - 1]) + (pre[rr] - pre[j]) - x[j] * 1LL * (rr - j));
        }
    }
    return mn <= B;
}
int besthub(int n, int l, int x[], ll B)
{
    ll pre[100010] = {};
    for (int i = 1; i <= n; ++i) pre[i] = pre[i - 1] + x[i - 1];
    int L = 1, R = n, ans = -1;
    while (L <= R)
    {
        int mid = (L + R) / 2;
        if (ok(mid, n, l, x, B, pre))
            L = mid + 1, ans = mid;
        else R = mid - 1;
    }
    return ans;
//    return 0;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1100 KB Output is correct
2 Correct 4 ms 1228 KB Output is correct
3 Correct 12 ms 2532 KB Output is correct
4 Correct 11 ms 2452 KB Output is correct
5 Correct 11 ms 1612 KB Output is correct
6 Correct 16 ms 1612 KB Output is correct
7 Correct 12 ms 2216 KB Output is correct
8 Correct 10 ms 2252 KB Output is correct
9 Correct 9 ms 1572 KB Output is correct
10 Correct 10 ms 1484 KB Output is correct
11 Correct 12 ms 2508 KB Output is correct
12 Correct 12 ms 2508 KB Output is correct
13 Correct 11 ms 1612 KB Output is correct
14 Correct 12 ms 1644 KB Output is correct
15 Correct 11 ms 2124 KB Output is correct
16 Correct 9 ms 2156 KB Output is correct
17 Correct 10 ms 2380 KB Output is correct
18 Correct 10 ms 2316 KB Output is correct
19 Correct 12 ms 2388 KB Output is correct
20 Correct 11 ms 2380 KB Output is correct