oj.uz

답안 #972787

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972787 2024-05-01T07:33:39 Z rahidilbayramli 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 14 ms 5212 KB 
#pragma GCC optimize("-O3")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include "ricehub.h"
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define p_b pop_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int besthub(int R, int L, int X[], long long B)
{
    ll v[R+5], pref[R+5];
    for(int i = 1; i <= R; i++)
    {
        v[i] = X[i-1];
        pref[i] = pref[i-1] + v[i];
    }
    int ans = 0;
    for(int i = 1; i <= R; i++)
    {
        int l = i, r = R;
        while(l <= r)
        {
            int mid = (l + r) / 2;
            ll idx = (l + mid) / 2;
            ll sum1 = pref[idx-1] - pref[i-1];
            ll sum2 = pref[mid] - pref[idx];
            ll cost = (v[idx] * (idx - i) - sum1) + (sum2 - v[idx] * (mid - idx));
            if(cost <= B)
            {
                ans = max(ans, mid - i + 1);
                l = mid + 1;
            }
            else
                r = mid - 1;
        }
    }
    return ans;
}
/*
void solve()
{
    int r, l, b;
    cin >> r >> l >> b;
    int x[r];
    for(int i = 0; i < r; i++)
        cin >> x[i];
    cout << besthub(r, l, x, b) << "\n";
}
int main()
{
    ll tests = 1;
    //cin >> tests;
    while(tests--)
    {
        solve();
    }
}
*/

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 864 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 14 ms 5212 KB Output is correct
4 Incorrect 14 ms 5064 KB Output isn't correct
5 Halted 0 ms 0 KB -