oj.uz

Submission #705925

# Submission time Handle Problem Language Result Execution time Memory
705925 2023-03-05T16:11:09 Z Alihan_8 Rice Hub (IOI11_ricehub) C++17
68 / 100
 1000 ms 2316 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 <int> p;
    for ( int i = 0; i < n; i++ ) p.pb(X[i]);
    sort(all(p));
    auto f = [&](int pos){
        int l = -1, r = n;
        for ( int i = 0; i < n; i++ ){
            if ( p[i] <= pos ) l = i;
            else r = min(r, i);
        }
        auto F = [&](int it){
            return abs(p[it]-pos);
        };
        ll sum = 0;
        int cnt = 0;
        while ( true ){
            if ( l == -1 ){
                if ( r == n or sum+F(r) > B ) break;
                sum += F(r++);
                cnt++;
            }
            else{
                if ( r == n ){
                    if ( sum+F(l) > B ) break;
                    sum += F(l--); cnt++;
                }
                else{
                    int Mn = min(F(l), F(r));
                    if ( sum+Mn > B ) break;
                    sum += Mn; cnt++;
                    if ( Mn == F(l) ) l--;
                    else r++;
                }
            }
        }
        return cnt;
    };
    int l = 0, r = 1e9;
    for ( int _ = 1; _ <= 27; _++ ){
        int m1 = l+(r-l)/3;
        int m2 = r-(r-l)/3;
        if ( f(m1) >= f(m2) ) r = m2;
        else l = m1;
    }
    int Mx = 0;
    for ( int i = l; i <= r; i++ ){
        Mx = max(Mx, f(i));
    }
    return Mx;
}
#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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 2 ms 212 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 2 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 4 ms 212 KB Output is correct
17 Correct 2 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 7 ms 312 KB Output is correct
22 Correct 9 ms 212 KB Output is correct
23 Correct 20 ms 308 KB Output is correct
24 Correct 18 ms 212 KB Output is correct
25 Correct 24 ms 212 KB Output is correct
26 Correct 24 ms 212 KB Output is correct
27 Correct 14 ms 340 KB Output is correct
28 Correct 11 ms 212 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 212 KB Output is correct
2 Correct 5 ms 212 KB Output is correct
3 Correct 35 ms 212 KB Output is correct
4 Correct 60 ms 300 KB Output is correct
5 Correct 7 ms 212 KB Output is correct
6 Correct 7 ms 212 KB Output is correct
7 Correct 13 ms 316 KB Output is correct
8 Correct 13 ms 212 KB Output is correct
9 Correct 8 ms 212 KB Output is correct
10 Correct 7 ms 212 KB Output is correct
11 Correct 14 ms 316 KB Output is correct
12 Correct 13 ms 316 KB Output is correct
13 Correct 54 ms 308 KB Output is correct
14 Correct 41 ms 212 KB Output is correct
15 Correct 8 ms 212 KB Output is correct
16 Correct 8 ms 308 KB Output is correct
17 Correct 52 ms 304 KB Output is correct
18 Correct 42 ms 312 KB Output is correct
19 Correct 37 ms 212 KB Output is correct
20 Correct 100 ms 312 KB Output is correct
21 Correct 61 ms 460 KB Output is correct
22 Correct 62 ms 332 KB Output is correct
23 Correct 234 ms 428 KB Output is correct
24 Correct 201 ms 396 KB Output is correct
25 Correct 453 ms 404 KB Output is correct
26 Correct 586 ms 460 KB Output is correct
27 Correct 194 ms 404 KB Output is correct
28 Correct 198 ms 400 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 358 ms 596 KB Output is correct
2 Correct 376 ms 692 KB Output is correct
3 Execution timed out 1073 ms 2316 KB Time limit exceeded
4 Halted 0 ms 0 KB -