oj.uz

답안 #705946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705946 2023-03-05T16:31:11 Z Alihan_8 쌀 창고 (IOI11_ricehub) C++17
100 / 100
 14 ms 3500 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
typedef long long ll;
int besthub(int R, int L, int X[], ll B){
    int n = R;
    vector <ll> pref(n+1), p;
    for ( int i = 0; i < n; i++ ) p.pb(X[i]);
    for ( int i = 0; i < n; i++ ){
        if ( i ) pref[i] = pref[i-1];
        pref[i] += p[i];
    }
    auto get = [&](int l, int r){
        return pref[r]-(l ? pref[l-1] : 0);
    };
    auto ok = [&](int len){
        int l = 0, r = len-1, add = len/2;
        while ( r < n ){
            ll k = p[l+add];
            ll cnt = get(l+add, r)-k*(r-(l+add)+1);
            if ( add ){
                cnt += k*add-get(l, l+add-1);
            }
            if ( cnt <= B ) return true;
            l++, r++;
        }
        return false;
    };
    int l = 1, r = n+1;
    while ( l+1 < r ){
        int md = (l+r) >> 1;
        if ( ok(md) ) l = md;
        else r = md;
    }
    return l;
}
#if false
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    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);

    cout << '\n';
/*
5 20 6
1 2 10 12 14
answer: 3
*/
}
#endif

Compilation message

ricehub.cpp: In function 'void IO(std::string)':
ricehub.cpp:12:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ricehub.cpp:12:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 14 ms 2636 KB Output is correct
4 Correct 13 ms 2544 KB Output is correct
5 Correct 9 ms 1488 KB Output is correct
6 Correct 7 ms 1488 KB Output is correct
7 Correct 11 ms 2636 KB Output is correct
8 Correct 12 ms 2636 KB Output is correct
9 Correct 7 ms 1616 KB Output is correct
10 Correct 6 ms 1488 KB Output is correct
11 Correct 14 ms 2548 KB Output is correct
12 Correct 14 ms 2636 KB Output is correct
13 Correct 7 ms 1488 KB Output is correct
14 Correct 8 ms 1488 KB Output is correct
15 Correct 11 ms 3148 KB Output is correct
16 Correct 11 ms 3008 KB Output is correct
17 Correct 12 ms 3344 KB Output is correct
18 Correct 12 ms 3468 KB Output is correct
19 Correct 13 ms 3500 KB Output is correct
20 Correct 13 ms 3480 KB Output is correct