oj.uz

답안 #544535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544535 2022-04-02T08:57:01 Z SavicS 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 3 ms 596 KB 
#include "ricehub.h"
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
 
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const int inf = 1e9 + 5;
 
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)
 
int n, m;
ll b;
int niz[maxn];
 
ll pref[maxn];
 
bool check(int X){
    
    ff(i,X,n){
        int L = i - X + 1;
        int R = i;

        int mid = (L + R) / 2;

        ll kol_L = 1ll * niz[mid] * (mid - L) - pref[mid - 1] - pref[L - 1];
        ll kol_R = pref[R] - pref[mid] - 1ll * (R - mid) * niz[mid];

        ll uk = kol_L + kol_R;
        if(uk <= b)return 1;

    }

    return 0;

}
 
int besthub(int R, int L, int X[], ll B) {
    n = R, m = L, b = B;
    ff(i,1,n)niz[i] = X[i - 1];
 
    ff(i,1,n)pref[i] = pref[i - 1] + niz[i];
 
    int l = 1, r = n, ans = 0;
    while(l <= r) {
        int mid = (l + r) / 2;
        if(check(mid)) {
            l = mid + 1;
            ans = mid;
        } else r = mid - 1;
    }
 
    return ans;
}
 
//int main()
//{
//      ios::sync_with_stdio(false);
//      cout.tie(nullptr);
//      cin.tie(nullptr);
//  cin >> n >> m >> b;
//  ff(i,1,n)cin >> niz[i];
//
//  ff(i,1,n)pref[i] = pref[i - 1] + niz[i];
//
//  int l = 1, r = n, ans = 0;
//  while(l <= r){
//      int mid = (l + r) / 2;
//      if(check(mid)){
//          l = mid + 1;
//          ans = mid;
//      }
//      else r = mid - 1;
//  }
//
//  cout << ans << endl;
//
//      return 0;
//}
///**
//
//5 20 6
//1 2 10 12 14
//
//// probati bojenje sahovski ili slicno
//
//**/

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -