Submission #796367

#TimeUsernameProblemLanguageResultExecution timeMemory
79636712345678Lasers (NOI19_lasers)C++17
41 / 100
1063 ms3328 KiB
#include <bits/stdc++.h> using namespace std; const int nx=5e5+5, mx=1e6+5; int n, l, x, s[nx], ans; bool c[mx]; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>l>>n; for (int i=0; i<n; i++) { cin>>s[i]; vector<int> v(s[i]+1); for (int j=1; j<=s[i]; j++) cin>>v[j], v[j]+=v[j-1]; if (v[v.size()-1]>(l/2)) { for (int j=1; j<=v[v.size()-1]; j++) { auto x=*prev(lower_bound(v.begin()+1, v.end(), j)); if ((v[v.size()-1]-x)>l-j) c[j]=1; } } } for (int i=1; i<=l; i++) if (c[i]) ans++; cout<<ans; }
#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...