oj.uz

답안 #314717

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
314717 2020-10-20T23:33:56 Z VROOM_VARUN 쌀 창고 (IOI11_ricehub) C++14
58 / 100
 21 ms 3344 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;
vector<ll> vals;

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 * vals[mid] * (mid - l) - 1ll * qry(l, mid - 1);
  rc = 1ll * qry(mid + 1, r) - 1ll * vals[mid] * (r - mid);
  return lc + rc;
}

int besthub(int n, int m, int* val, long long bud) {
  pref.resize(n);
  vals.resize(n);
  for (int i = 0; i < n; i++) {
    vals[i] = val[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

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

Subtask #2
0 / 25.0

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

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 768 KB Output is correct
2 Correct 4 ms 768 KB Output is correct
3 Correct 19 ms 3344 KB Output is correct
4 Correct 19 ms 3320 KB Output is correct
5 Correct 11 ms 1664 KB Output is correct
6 Correct 8 ms 1664 KB Output is correct
7 Correct 17 ms 3072 KB Output is correct
8 Correct 16 ms 3072 KB Output is correct
9 Correct 8 ms 1536 KB Output is correct
10 Correct 8 ms 1536 KB Output is correct
11 Correct 21 ms 3328 KB Output is correct
12 Correct 21 ms 3328 KB Output is correct
13 Correct 10 ms 1664 KB Output is correct
14 Correct 9 ms 1664 KB Output is correct
15 Correct 15 ms 2688 KB Output is correct
16 Correct 15 ms 2560 KB Output is correct
17 Correct 18 ms 3064 KB Output is correct
18 Correct 19 ms 3072 KB Output is correct
19 Correct 19 ms 3200 KB Output is correct
20 Correct 19 ms 3192 KB Output is correct