oj.uz

Submission #1012771

# Submission time Handle Problem Language Result Execution time Memory
1012771 2024-07-02T15:01:27 Z kebine Lasers (NOI19_lasers) C++17
24 / 100
 109 ms 52712 KB 
#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) {
    for (int j = 1; j <= k[i]; ++j) {
      ans = max(ans, b[i][j] + b[i][j] - n);
    }
  }

  cout << ans << '\n';

  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 109 ms 52192 KB Output is correct
13 Correct 0 ms 456 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 556 KB Output is correct
17 Correct 91 ms 52712 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 3364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 3364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 109 ms 52192 KB Output is correct
13 Correct 0 ms 456 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 556 KB Output is correct
17 Correct 91 ms 52712 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 12 ms 3364 KB Output isn't correct
22 Halted 0 ms 0 KB -