oj.uz

답안 #970303

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970303 2024-04-26T10:35:03 Z Whisper 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 12 ms 7508 KB 
#include <bits/stdc++.h>
//#include <ricehub.h>

using namespace std;
using ll = long long;

//#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

//void setupIO(){
//    #define name "bai"
//    //Phu Trong from Nguyen Tat Thanh High School for gifted student
//    srand(time(NULL));
//    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//    freopen(name".inp", "r", stdin);
//    freopen(name".ans", "w", stdout);
//    cout << fixed << setprecision(10);
//}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

const int MAX = 1e5 + 5;
ll nArr, Lim, A[MAX], numCoin;
ll l[MAX], r[MAX], rsum[MAX], lsum[MAX];

ll Query(int L, int R){
    if (L <= R){
        return (l[L + 1] - l[R]) - (lsum[L + 1] - lsum[R]) * (nArr - R) + A[R];
    }
    if (L > R){
        return (r[R - 1] - r[L]) - (rsum[R - 1] - rsum[L]) * (L - 1) + A[L];
    }
    return 0;
}
bool check(int d){
    for (int i = 1; i <= nArr - d + 1; ++i){
        int id = i + d / 2;
        ll tot = Query(i, id) + Query(id, i + d - 1);
        if (tot <= numCoin) return 1;
    }
    return 0;
}
int besthub(int RR, int LL, int X[], ll B){
    nArr = RR, Lim = LL, numCoin = B;
    FOR(i, 1, nArr) A[i] = X[i - 1];
    for (int i = 2; i <= nArr; ++i) A[i] = X[i - 1] - X[i - 2];
    for (int i = 1; i <= nArr; ++i){
        r[i] = r[i - 1] + A[i] * i;
        rsum[i] = rsum[i - 1] + A[i];
    }
    for (int i = nArr; i >= 1; --i){
        l[i] = l[i + 1] + A[i] * (nArr - i + 1);
        lsum[i] = lsum[i + 1] + A[i];
    }
    int l = 1, r = nArr;
    int ans = 1;
    while (l <= r){
        int mid = (l + r) >> 1;
        if(check(mid)) l = mid + 1, ans = mid;
        else r = mid - 1;
    }
    return ans;
}
//int a[MAX];
//void Whisper(){
//    int R, L, B; cin >> R >> L >> B;
//    FOR(i, 0, R - 1) cin >> a[i];
//    cout << besthub(R, L, a, B);
//}
//
//
//signed main(){
//    setupIO();
//    int Test = 1;
////    cin >> Test;
//    for ( int i = 1 ; i <= Test ; i++ ){
//        Whisper();
//        if (i < Test) cout << '\n';
//    }
//}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2500 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Incorrect 1 ms 2396 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2908 KB Output is correct
2 Correct 3 ms 2908 KB Output is correct
3 Correct 11 ms 7508 KB Output is correct
4 Correct 12 ms 7344 KB Output is correct
5 Incorrect 7 ms 3928 KB Output isn't correct
6 Halted 0 ms 0 KB -