oj.uz

답안 #1097451

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097451 2024-10-07T12:18:15 Z avighna Meteors (POI11_met) C++17
74 / 100
 720 ms 51832 KB 
#include <bits/stdc++.h>

typedef long long ll;

class FenwickTree {
public:
  std::vector<ll> f;
  int n;

  FenwickTree(int n) : n(n) { f.resize(n + 1); }

  void add(int idx, int del) {
    for (int i = idx; i <= n; i += i & (-i)) {
      f[i] += del;
    }
  }

  ll query(int idx) {
    ll ans = 0;
    for (int i = idx; i >= 1; i -= i & (-i)) {
      ans += f[i];
    }
    return ans;
  }
  ll query(int l, int r) {
    if (l > r) {
      return 0;
    }
    ll ans = query(r);
    if (l - 1 >= 1) {
      ans -= query(l - 1);
    }
    return ans;
  }
};

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n, m;
  std::cin >> n >> m;
  std::vector owned(n + 1, std::vector<int>());
  for (int i = 1, x; i <= m; ++i) {
    std::cin >> x;
    owned[x].push_back(i);
  }
  std::vector<ll> p(n + 1);
  for (ll i = 1; i <= n; ++i) {
    std::cin >> p[i];
  }
  int k;
  std::cin >> k;
  struct Update {
    int l, r, a;
  };
  std::vector<Update> upd(k);
  for (auto &[l, r, a] : upd) {
    std::cin >> l >> r >> a;
  }

  struct State {
    int i, l, r;
  };
  std::vector midpoints(k + 1, std::vector<State>());
  for (int i = 0; i < n; ++i) {
    midpoints[(k + 1) / 2].push_back({i, 1, k});
  }
  std::vector<int> ans(n, k + 1);
  for (ll j = 0; j < 30; ++j) {
    FenwickTree tree(m + 1);
    auto apply = [&](int l, int r, int d) {
      tree.add(l, d);
      tree.add(r + 1, -d);
    };
    bool changed = false;
    for (int i = 1; i <= k; ++i) {
      if (upd[i - 1].l <= upd[i - 1].r) {
        apply(upd[i - 1].l, upd[i - 1].r, upd[i - 1].a);
      } else {
        apply(upd[i - 1].l, m, upd[i - 1].a);
        apply(1, upd[i - 1].r, upd[i - 1].a);
      }
      while (!midpoints[i].empty()) {
        changed = true;
        auto [_i, l, r] = midpoints[i].back();
        midpoints[i].pop_back();
        if (l > r) {
          continue;
        }
        ll obtained = 0;
        for (auto &x : owned[_i + 1]) {
          obtained += tree.query(x);
        }
        if (obtained >= p[_i + 1]) {
          ans[_i] = std::min(ans[_i], i);
          midpoints[(l + i - 1) / 2].push_back({_i, l, i - 1});
        } else {
          midpoints[(i + r + 1) / 2].push_back({_i, i + 1, r});
        }
      }
    }
    if (!changed) {
      break;
    }
  }
  for (auto &i : ans) {
    if (i == k + 1) {
      std::cout << "NIE\n";
    } else {
      std::cout << i << '\n';
    }
  }
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 468 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 4956 KB Output is correct
2 Correct 91 ms 10308 KB Output is correct
3 Correct 76 ms 7916 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 7052 KB Output is correct
2 Correct 71 ms 7064 KB Output is correct
3 Correct 96 ms 10792 KB Output is correct
4 Correct 20 ms 5180 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 5324 KB Output is correct
2 Correct 70 ms 10872 KB Output is correct
3 Correct 31 ms 2896 KB Output is correct
4 Correct 72 ms 8960 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 3932 KB Output is correct
2 Correct 85 ms 7052 KB Output is correct
3 Correct 47 ms 4628 KB Output is correct
4 Correct 90 ms 11972 KB Output is correct

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 602 ms 51832 KB Output is correct
2 Incorrect 668 ms 22364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 720 ms 48928 KB Output is correct
2 Incorrect 520 ms 20944 KB Output isn't correct
3 Halted 0 ms 0 KB -