oj.uz

답안 #586411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
586411 2022-06-30T08:33:07 Z usukhbaatar 사탕 분배 (IOI21_candies) C++17
100 / 100
 988 ms 32212 KB 
// O((n + q) sqrt(q))

#include "candies.h"

#include <algorithm>
#include <cmath>
#include <vector>

struct Buckets {
  int n;
  int bucket_size, bucket_cnt;
  std::vector<int> vals;
  std::vector<long long> mini, maxi, sums;
  Buckets(int _n): n(_n) {
    bucket_size = sqrt(n);
    bucket_cnt = (n + bucket_size - 1) / bucket_size;
    vals.assign(n, 0);
    mini.assign(bucket_cnt, 0);
    maxi.assign(bucket_cnt, 0);
    sums.assign(bucket_cnt, 0);
  }

  void update(int x, int val) {
    vals[x] = val;
    int bucket = x / bucket_size;

    mini[bucket] = maxi[bucket] = sums[bucket] = 0;
    for (int i = std::min(n, (bucket + 1) * bucket_size) - 1; 
         i >= bucket * bucket_size; --i) {
      sums[bucket] += vals[i];
      maxi[bucket] = std::max(maxi[bucket], sums[bucket]);
      mini[bucket] = std::min(mini[bucket], sums[bucket]);
    }
  }

  std::tuple<int, int, int> query(int c) {
    int sufsum = 0, sufmin = 0, sufmax = 0;
    for (int bucket = bucket_cnt - 1; bucket >= 0; --bucket) {
      long long nsufsum = sufsum + sums[bucket],
                nsufmin = std::min(1LL * sufmin, sufsum + mini[bucket]),
                nsufmax = std::max(1LL * sufmax, sufsum + maxi[bucket]);
      if (nsufmax - nsufmin > c) {
        for (int i = std::min(n, (bucket + 1) * bucket_size) - 1; 
             i >= bucket * bucket_size; --i) {
          sufsum += vals[i];
          sufmin = std::min(sufmin, sufsum);
          sufmax = std::max(sufmax, sufsum);
          if (sufmax - sufmin > c) return std::make_tuple(sufmin, sufmax, i);
        }
      }
      sufsum = nsufsum; sufmax = nsufmax; sufmin = nsufmin;
    }
    return std::make_tuple(sufmin, sufmax, 0);
  }

  inline int at(int x) { return vals[x]; }
};

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
  int n = c.size(), q = v.size();
  std::vector<std::vector<std::pair<int, int>>> queriesL(n), queriesR(n);
  for (int i = 0; i < q; ++i) {
    queriesL[l[i]].emplace_back(i, v[i]);
    queriesR[r[i]].emplace_back(i, v[i]);
  }

  std::vector<int> s(n);
  Buckets tree(q);
  for (int i = 0; i < n; ++i) {
    for (auto [idx, val] : queriesL[i]) {
      tree.update(idx, -val);
    }

    auto [mini, maxi, idx] = tree.query(c[i]);
    if (maxi - mini <= c[i]) {
      s[i] = -mini;
    } else {
      if (tree.at(idx) < 0) {
        s[i] = c[i] - maxi;
      } else {
        s[i] = -mini;
      }
    }

    for (auto [idx, val] : queriesR[i]) {
      tree.update(idx, 0);
    }
  }

  return s;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 3 ms 596 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 841 ms 25992 KB Output is correct
2 Correct 887 ms 29544 KB Output is correct
3 Correct 878 ms 29376 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 690 ms 14452 KB Output is correct
3 Correct 82 ms 14368 KB Output is correct
4 Correct 988 ms 31384 KB Output is correct
5 Correct 915 ms 31780 KB Output is correct
6 Correct 816 ms 32212 KB Output is correct
7 Correct 823 ms 31504 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 664 ms 11672 KB Output is correct
4 Correct 62 ms 13264 KB Output is correct
5 Correct 778 ms 24180 KB Output is correct
6 Correct 758 ms 24916 KB Output is correct
7 Correct 720 ms 25472 KB Output is correct
8 Correct 783 ms 24076 KB Output is correct
9 Correct 986 ms 25552 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 841 ms 25992 KB Output is correct
7 Correct 887 ms 29544 KB Output is correct
8 Correct 878 ms 29376 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 690 ms 14452 KB Output is correct
11 Correct 82 ms 14368 KB Output is correct
12 Correct 988 ms 31384 KB Output is correct
13 Correct 915 ms 31780 KB Output is correct
14 Correct 816 ms 32212 KB Output is correct
15 Correct 823 ms 31504 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 288 KB Output is correct
18 Correct 664 ms 11672 KB Output is correct
19 Correct 62 ms 13264 KB Output is correct
20 Correct 778 ms 24180 KB Output is correct
21 Correct 758 ms 24916 KB Output is correct
22 Correct 720 ms 25472 KB Output is correct
23 Correct 783 ms 24076 KB Output is correct
24 Correct 986 ms 25552 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 67 ms 13388 KB Output is correct
27 Correct 671 ms 13948 KB Output is correct
28 Correct 895 ms 29972 KB Output is correct
29 Correct 858 ms 30408 KB Output is correct
30 Correct 903 ms 30608 KB Output is correct
31 Correct 846 ms 30876 KB Output is correct
32 Correct 850 ms 31000 KB Output is correct