Submission #1012774

#TimeUsernameProblemLanguageResultExecution timeMemory
1012774kebineLasers (NOI19_lasers)C++17
24 / 100
84 ms51776 KiB
#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];
    }

    for (int j = 1; j <= k[i]; ++j) {
      ans = max(ans, b[i][j] + b[i][j] - (n - sum + b[i][j]));
    }
  }

  cout << ans << '\n';

  return 0;
}
#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...