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>
#define int long long
#define fi first
#define se second
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, q;
cin >> n >> q;
vector<int> k(q + 5);
vector<vector<int>> b(q + 5);
for (int i = 1; i <= q; ++i) {
cin >> k[i];
b[i].resize(k[i] + 5);
for (int j = 1; j <= k[i]; ++j) {
cin >> b[i][j];
}
}
int ans = 0;
for (int i = 1; i <= q; ++i) {
int sum = 0;
for (int j = 1; j <= k[i]; ++j) {
sum += b[i][j];
}
ans = max(ans, sum + sum - n);
}
cout << ans << '\n';
return 0;
}
# | 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... |