oj.uz

Submission #705943

# Submission time Handle Problem Language Result Execution time Memory
705943 2023-03-05T16:25:37 Z Alihan_8 Rice Hub (IOI11_ricehub) C++17
17 / 100
 16 ms 3660 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]);
    sort(all(p));
    for ( int i = 1; i <= n; i++ ){
        pref[i] = pref[i-1]+p[i-1];
    }
    auto get = [&](int l, int r){
        return pref[r]-pref[l-1];
    };
    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 >= 1 ){
                cnt += k*add-get(l, l+add-1);
            }
            if ( cnt <= B ) return true;
            l++, r++;
        }
        return false;
    };
    int l = 0, 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Incorrect 1 ms 340 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 3 ms 1064 KB Output is correct
3 Correct 15 ms 2892 KB Output is correct
4 Correct 16 ms 3164 KB Output is correct
5 Correct 8 ms 1872 KB Output is correct
6 Correct 9 ms 1856 KB Output is correct
7 Correct 14 ms 3364 KB Output is correct
8 Correct 14 ms 3380 KB Output is correct
9 Correct 8 ms 1744 KB Output is correct
10 Correct 8 ms 1744 KB Output is correct
11 Correct 16 ms 3660 KB Output is correct
12 Correct 15 ms 3612 KB Output is correct
13 Correct 8 ms 1872 KB Output is correct
14 Incorrect 9 ms 1844 KB Output isn't correct
15 Halted 0 ms 0 KB -