oj.uz

Submission #314714

# Submission time Handle Problem Language Result Execution time Memory
314714 2020-10-20T23:28:14 Z VROOM_VARUN Rice Hub (IOI11_ricehub) C++14
0 / 100
 4 ms 640 KB 
/*
ID: varunra2
LANG: C++
TASK: besthub
*/

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

vector<ll> pref;

ll qry(int l, int r) { return pref[r] - (l ? pref[l - 1] : 0); }
ll calc(int l, int r) {
  int mid = (l + r) / 2;
  ll lc, rc;
  lc = 1ll * pref[mid] * (mid - l) - 1ll * qry(l, mid - 1);
  rc = 1ll * qry(mid + 1, r) - 1ll * pref[mid] * (r - mid);
  return lc + rc;
}

int besthub(int n, int m, int* vals, long long bud) {
  pref.resize(n);
  for (int i = 0; i < n; i++) {
    pref[i] = vals[i];
  }
  partial_sum(all(pref), pref.begin());

  int p1 = 0, p2 = 0;

  int ret = 0;

  while (p1 < n) {
    while (p2 + 1 < n and calc(p1, p2 + 1) <= bud) p2++;
    ret = max(ret, p2 - p1 + 1);
    p1++;
  }

  return ret;
}

// int32_t main() {
// #ifndef ONLINE_JUDGE
//   freopen("besthub.in", "r", stdin);
//   freopen("besthub.out", "w", stdout);
// #endif
//   cin.sync_with_stdio(0);
//   cin.tie(0);

//   int n, m, bud;

//   cin >> n >> m >> bud;

//   int vals[n];

//   for (int i = 0; i < n; i++) {
//     cin >> vals[i];
//   }

//   debug(besthub(n, m, vals, bud));

//   return 0;
// }

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Incorrect 4 ms 640 KB Output isn't correct
3 Halted 0 ms 0 KB -