제출 #816591

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
816591		gun_gan	Lasers (NOI19_lasers)	C++17	100 / 100	205 ms	15272 KiB

lasers

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 5e5 + 5;
int R, L;

vector<pair<int,int>> vv;

int main() {
      cin.tie(0); ios_base::sync_with_stdio(0);

      cin >> L >> R;
      for(int i = 0; i < R; i++) {
            int x;
            cin >> x;

            vector<int> v;
            vector<pair<int,int>> ranges;

            int sum = 0;
            for(int j = 0; j < x; j++) {
                  int k;
                  cin >> k;
                  v.push_back(k);
                  sum += k;
            }

            int l = 1, r = L - sum; // ga ke cover

            ranges.push_back({l, r});

            for(int j = 0; j < x; j++) {
                  l += v[j];
                  r += v[j];

                  ranges.push_back({l, r});
            }

            sort(ranges.begin(), ranges.end());

            set<int> open;
            int lst = 0;
            for(auto [l, r] : ranges) {
                  while(!open.empty() && *open.begin() < l) {
                        open.erase(open.begin());
                  }

                  if(open.empty()) {
                        if(l - 1 >= lst + 1) {
                              vv.push_back({lst + 1, l - 1}); // selalu ke cover
                        }
                  }

                  open.insert(r);
                  lst = r;
            }

            if(lst + 1 <= L) vv.push_back({lst + 1, L});
      }

      sort(vv.begin(), vv.end());
      set<int> open;
      
      int ans = 0, lf = 1, rg = 0;

      for(auto [l, r] : vv) {
            while(!open.empty() && *open.begin() < l) {
                  open.erase(open.begin());
            }

            if(open.empty()) {
                  ans += rg - lf + 1;
                  lf = l, rg = r;
            }

            open.insert(r);
            rg = max(rg, r);
      }

      ans += rg - lf + 1;

      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