Submission #1008155

#TimeUsernameProblemLanguageResultExecution timeMemory
1008155kebineLasers (NOI19_lasers)C++17
0 / 100
20 ms16316 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define endl "\n" const int MAXN = 1e6 + 5; vector < int > freq ( MAXN, 0); int n, q; signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> q; while ( q-- ){ int k; cin >> k; int yes = n; int a[k + 5]; for ( int i = 1; i <= k; i++){ cin >> a[i]; } sort ( a + 1, a + 1 + k, greater < int >()); for ( int i = 1; i <= k; i++){ for ( int j = max ( yes - a[i] + 1, 1ll ); j <= a[i]; j++){ freq[j]++; ///cout << j << " "; } yes -= a[i]; } } int ans = 0; int l = 1, r = n; while ( l < r ){ if ( freq[l] ) freq[r] = 1; l++; r--; } for ( int i = 1; i <= n; i++) if ( freq[i] ) ans++; cout << ans << endl; }
#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...