답안 #1077140

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077140 2024-08-27T01:39:59 Z juicy 쌀 창고 (IOI11_ricehub) C++17
100 / 100
17 ms 4444 KB
#include "ricehub.h"

#include <bits/stdc++.h>

int besthub(int n, int L, int *a, long long b) {
  std::vector<long long> pf(n);
  for (int i = 0; i < n; ++i) {
    pf[i] = (i ? pf[i - 1] : 0LL) + a[i];
  }
  auto qry = [&](int l, int r) {
    int md = (l + r) / 2;
    return (md - l + 1) * a[md] - pf[md] + (l ? pf[l - 1] : 0LL) + pf[r] - pf[md] - (r - md) * a[md]; 
  };
  int res = 0;
  for (int i = 0, j = 0; i < n; ++i) {
    while (qry(j, i) > b) {
      ++j;
    }
    res = std::max(res, i - j + 1);
  }
  return res;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 452 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 612 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 500 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 10 ms 4288 KB Output is correct
4 Correct 17 ms 4400 KB Output is correct
5 Correct 5 ms 3232 KB Output is correct
6 Correct 5 ms 3164 KB Output is correct
7 Correct 11 ms 4188 KB Output is correct
8 Correct 12 ms 4188 KB Output is correct
9 Correct 4 ms 3164 KB Output is correct
10 Correct 7 ms 3164 KB Output is correct
11 Correct 9 ms 4428 KB Output is correct
12 Correct 10 ms 4444 KB Output is correct
13 Correct 6 ms 3420 KB Output is correct
14 Correct 5 ms 3420 KB Output is correct
15 Correct 7 ms 3932 KB Output is correct
16 Correct 7 ms 3932 KB Output is correct
17 Correct 9 ms 4188 KB Output is correct
18 Correct 9 ms 4192 KB Output is correct
19 Correct 9 ms 4184 KB Output is correct
20 Correct 9 ms 4188 KB Output is correct