# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1007699 | devariaota | Lasers (NOI19_lasers) | C++17 | 143 ms | 15696 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
bool ckmin(int& a, int b){return b < a ? a = b, 1 : 0;}
bool ckmax(int& a, int b){return b > a ? a = b, 1 : 0;}
const int N = 2e5 + 5, mod = 1e9 + 7;
signed main(){
ios_base::sync_with_stdio(0), cin.tie(0);
int n, q; cin >> n >> q;
set<pii> st;
while(q--) {
int k, s = 0; cin >> k;
vector<int> v(k);
int r = n, id = 0;
for(int i = 0; i < k; i++) {
cin >> v[i];
s += v[i];
}
int ll = 0, l = n - s + 1;
int rl = -1, rh = -1;
for(int i = 0; i < k; i++) {
ll += v[i];
if(ll >= l) st.insert({l, ll});
// cout << i << " " << ll << " " << l << endl;
l += v[i];
}
}
// for(auto i : st) cout << i.fi << " " << i.se << endl;
int l = -1, r = -1, ans = 0;
for(auto i : st) {
if(l == -1) ans += i.se - i.fi + 1, l = i.se + 1;
else if(i.se >= l) {
l = max(l, i.fi);
ans += i.se - l + 1;
l = i.se + 1;
}
}
cout << ans << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |