제출 #1087223

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

lasers

#include <bits/stdc++.h>

typedef long long ll;

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

  ll l, r;
  std::cin >> l >> r;
  std::vector<std::vector<ll>> rows(r);
  std::vector<ll> left(r), sum(r);
  std::priority_queue<std::pair<ll, ll>, std::vector<std::pair<ll, ll>>,
                      std::greater<>>
      pq;
  std::multiset<ll> st;
  auto f = [&](ll cnt) { return l - (sum[cnt] - left[cnt]) + 1; };
  for (ll cnt = 0; cnt < r; ++cnt) {
    auto &v = rows[cnt];
    ll len;
    std::cin >> len;
    v.resize(len);
    for (auto &i : v) {
      std::cin >> i;
    }
    std::reverse(v.begin(), v.end());
    sum[cnt] = std::accumulate(v.begin(), v.end(), 0LL);
    pq.push({left[cnt] + v.back(), cnt});
    v.pop_back();
    st.insert(f(cnt));
  }

  auto range = [](ll l, ll r, ll c) {
    if (r <= c) {
      return r - l + 1;
    } else if (l > c) {
      return 0LL;
    }
    return c - l + 1;
  };

  ll ans = l, i = 1;
  while (i <= l) {
    while (!pq.empty() and pq.top().first < i) {
      auto [l, j] = pq.top();
      pq.pop();
      st.erase(st.find(f(j)));
      left[j] = l;
      st.insert(f(j));
      if (!rows[j].empty()) {
        pq.push({left[j] + rows[j].back(), j});
        rows[j].pop_back();
      }
    }
    ll end = !pq.empty() ? pq.top().first : l;
    ans -= range(i + 1, ++end, *st.begin());
    i = end;
  }
  std::cout << ans << '\n';
}

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