# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
705942 | 2023-03-05T16:24:34 Z | Alihan_8 | 쌀 창고 (IOI11_ricehub) | C++17 | 3 ms | 1024 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+add-1, l); } 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 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 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 1024 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |