이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 = yes - a[i] + 1; 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 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... |