oj.uz

답안 #705922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705922 2023-03-05T16:01:39 Z Alihan_8 쌀 창고 (IOI11_ricehub) C++17
42 / 100
 1000 ms 648 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;
    auto f = [&](int pos){
        vector <int> res;
        for ( int i = 0; i < n; i++ ){
            res.pb(abs(X[i]-pos));
        }
        sort(all(res));
        int cnt = 0; ll sum = 0;
        for ( auto i: res ){
            if ( sum+i > B ) break;
            cnt++, sum += i;
        }
        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

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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 212 KB Output is correct
2 Correct 5 ms 212 KB Output is correct
3 Correct 8 ms 212 KB Output is correct
4 Correct 10 ms 308 KB Output is correct
5 Correct 18 ms 312 KB Output is correct
6 Correct 14 ms 304 KB Output is correct
7 Correct 15 ms 212 KB Output is correct
8 Correct 15 ms 212 KB Output is correct
9 Correct 5 ms 212 KB Output is correct
10 Correct 5 ms 212 KB Output is correct
11 Correct 8 ms 308 KB Output is correct
12 Correct 8 ms 212 KB Output is correct
13 Correct 9 ms 308 KB Output is correct
14 Correct 9 ms 212 KB Output is correct
15 Correct 16 ms 304 KB Output is correct
16 Correct 21 ms 308 KB Output is correct
17 Correct 11 ms 212 KB Output is correct
18 Correct 9 ms 312 KB Output is correct
19 Correct 17 ms 212 KB Output is correct
20 Correct 16 ms 212 KB Output is correct
21 Correct 89 ms 212 KB Output is correct
22 Correct 96 ms 296 KB Output is correct
23 Correct 130 ms 212 KB Output is correct
24 Correct 130 ms 292 KB Output is correct
25 Correct 124 ms 292 KB Output is correct
26 Correct 127 ms 288 KB Output is correct
27 Correct 131 ms 212 KB Output is correct
28 Correct 144 ms 292 KB Output is correct

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 292 KB Output is correct
2 Correct 35 ms 212 KB Output is correct
3 Correct 193 ms 304 KB Output is correct
4 Correct 478 ms 308 KB Output is correct
5 Correct 100 ms 312 KB Output is correct
6 Correct 87 ms 296 KB Output is correct
7 Correct 208 ms 320 KB Output is correct
8 Correct 187 ms 212 KB Output is correct
9 Correct 93 ms 296 KB Output is correct
10 Correct 117 ms 312 KB Output is correct
11 Correct 198 ms 212 KB Output is correct
12 Correct 173 ms 304 KB Output is correct
13 Correct 288 ms 308 KB Output is correct
14 Correct 285 ms 212 KB Output is correct
15 Correct 91 ms 212 KB Output is correct
16 Correct 100 ms 300 KB Output is correct
17 Correct 229 ms 308 KB Output is correct
18 Correct 221 ms 212 KB Output is correct
19 Correct 210 ms 312 KB Output is correct
20 Correct 515 ms 308 KB Output is correct
21 Execution timed out 1074 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1075 ms 648 KB Time limit exceeded
2 Halted 0 ms 0 KB -