Submission #642225

#TimeUsernameProblemLanguageResultExecution timeMemory
642225andecaandeciLasers (NOI19_lasers)C++17
10 / 100
36 ms5552 KiB
#include <bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int l, r; cin >> l >> r; vector<pair<int, int>>seg; for(int i = 1; i <= r; i++){ int x; cin >> x; vector<int>v(x); int last = (x - 1); for(int j = 0; j < x; j++){ cin >> v[i]; last += v[i]; } int geser = l - last; int pos = 0; for(int j = 0; j < x; j++){ if(geser < v[i]){ seg.emplace_back(pos + geser, pos + v[i]); } pos += v[i] + 1; } } sort(seg.begin(), seg.end()); int ans = 0; int left = 0, right = 0; int sz = seg.size(); while(left < sz && right < sz){ while(right + 1 < sz && seg[right + 1].first <= seg[right].second) right++; ans += (seg[right].second - seg[left].first); left = right + 1; } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...