제출 #1087147

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1087147		avighna	Lasers (NOI19_lasers)	C++17	41 / 100	137 ms	262144 KiB

lasers

#include <bits/stdc++.h>

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

  FenwickTree(int n) {
    this->n = n;
    f.resize(n + 1);
  }

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

  int query(int idx) {
    int ans = 0;
    for (int i = idx; i >= 1; i -= i & (-i)) {
      ans += f[i];
    }
    return ans;
  }
  int query(int l, int r) {
    if (l > r) {
      return 0;
    }
    int 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 l, r;
  std::cin >> l >> r;
  std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>,
                      std::greater<>>
      pq;
  std::vector<int> left(r), sum(r);
  std::vector<std::deque<int>> rows(r);
  FenwickTree tree(l + 1);
  // x blocks from right ==> l - x + 1 from left
  auto f = [&](int cnt) { return l - (sum[cnt] - left[cnt]) + 1; };
  for (int cnt = 0; cnt < r; ++cnt) {
    auto &v = rows[cnt];
    int len;
    std::cin >> len;
    v.resize(len);
    for (auto &i : v) {
      std::cin >> i;
    }
    sum[cnt] = std::accumulate(v.begin(), v.end(), 0);
    pq.push({left[cnt] + v[0], cnt});
    v.pop_front();
    tree.add(f(cnt), 1);
  }

  int ans = 0;
  for (int _i = 1; _i <= l; ++_i) {
    while (!pq.empty() and pq.top().first < _i) {
      auto [l, i] = pq.top();
      pq.pop();
      tree.add(f(i), -1);
      left[i] = l;
      tree.add(f(i), 1);
      if (!rows[i].empty()) {
        pq.push({left[i] + rows[i][0], i});
        rows[i].pop_front();
      }
    }
    int gs = tree.query(_i + 1, l + 1);
    // for (int j = 0; j < r; ++j) {
    //   gs += _i < l - (sum[j] - left[j]) + 1;
    // }
    ans += gs != r;
  }
  std::cout << ans << '\n';
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 14
• Subtask 3: 20 / 20
• Subtask 4: 21 / 21
• Subtask 5: 0 / 22
• Subtask 6: 0 / 13