oj.uz

Submission #586084

# Submission time Handle Problem Language Result Execution time Memory
586084 2022-06-29T20:13:38 Z MilosMilutinovic Cigle (COI21_cigle) C++14
48 / 100
 1000 ms 98644 KB 
/**
 *    author:  wxhtzdy
 *    created: 29.06.2022 21:43:16
**/
#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<long long> pref(n + 1);
  for (int i = 0; i < n; i++) {
    pref[i + 1] = pref[i] + a[i];
  }
  vector<vector<int>> dp(n + 1, vector<int>(n + 1));
  for (int l = 1; l <= n; l++) {
    unordered_map<long long, int> pos;
    for (int i = 1; i < l; i++) {
      pos[pref[l - 1] - pref[i - 1]] = i;
    }
    vector<int> pref_mx(n + 1);
    for (int i = 0; i < l; i++) {
      pref_mx[i + 1] = max(pref_mx[i], dp[i][l - 1]);
    }
    int ft = 0;
    for (int r = l; r <= n; r++) {
      dp[l][r] = dp[l][r - 1];
      if (l < r) {
        long long s = pref[r - 1] - pref[l - 1];
        if (pos.count(s) && pos[s] != 1) { 
          ft += 1;
          dp[l][r] = max(dp[l][r], ft + pref_mx[pos[s]]);
        }
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    ans = max(ans, dp[i][n]);
  }              
  cout << ans << '\n';
  return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1328 KB Output is correct
2 Correct 10 ms 1332 KB Output is correct
3 Correct 10 ms 1336 KB Output is correct
4 Correct 14 ms 1364 KB Output is correct
5 Correct 12 ms 1236 KB Output is correct
6 Correct 13 ms 1336 KB Output is correct
7 Correct 13 ms 1236 KB Output is correct
8 Correct 11 ms 1336 KB Output is correct
9 Correct 12 ms 1344 KB Output is correct
10 Correct 12 ms 1328 KB Output is correct
11 Correct 11 ms 1236 KB Output is correct
12 Correct 11 ms 1236 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 10 ms 1328 KB Output is correct
22 Correct 10 ms 1332 KB Output is correct
23 Correct 10 ms 1336 KB Output is correct
24 Correct 14 ms 1364 KB Output is correct
25 Correct 12 ms 1236 KB Output is correct
26 Correct 13 ms 1336 KB Output is correct
27 Correct 13 ms 1236 KB Output is correct
28 Correct 11 ms 1336 KB Output is correct
29 Correct 12 ms 1344 KB Output is correct
30 Correct 12 ms 1328 KB Output is correct
31 Correct 11 ms 1236 KB Output is correct
32 Correct 11 ms 1236 KB Output is correct
33 Correct 10 ms 1340 KB Output is correct
34 Correct 10 ms 1236 KB Output is correct
35 Correct 10 ms 1344 KB Output is correct
36 Correct 12 ms 1236 KB Output is correct
37 Correct 11 ms 1236 KB Output is correct
38 Correct 12 ms 1236 KB Output is correct
39 Correct 13 ms 1236 KB Output is correct
40 Correct 14 ms 1236 KB Output is correct
41 Correct 13 ms 1336 KB Output is correct
42 Correct 12 ms 1236 KB Output is correct
43 Correct 12 ms 1236 KB Output is correct
44 Correct 13 ms 1344 KB Output is correct
45 Correct 12 ms 1328 KB Output is correct
46 Correct 12 ms 1344 KB Output is correct
47 Correct 13 ms 1236 KB Output is correct
48 Correct 13 ms 1236 KB Output is correct
49 Correct 13 ms 1236 KB Output is correct

Subtask #5
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 10 ms 1328 KB Output is correct
22 Correct 10 ms 1332 KB Output is correct
23 Correct 10 ms 1336 KB Output is correct
24 Correct 14 ms 1364 KB Output is correct
25 Correct 12 ms 1236 KB Output is correct
26 Correct 13 ms 1336 KB Output is correct
27 Correct 13 ms 1236 KB Output is correct
28 Correct 11 ms 1336 KB Output is correct
29 Correct 12 ms 1344 KB Output is correct
30 Correct 12 ms 1328 KB Output is correct
31 Correct 11 ms 1236 KB Output is correct
32 Correct 11 ms 1236 KB Output is correct
33 Correct 10 ms 1340 KB Output is correct
34 Correct 10 ms 1236 KB Output is correct
35 Correct 10 ms 1344 KB Output is correct
36 Correct 12 ms 1236 KB Output is correct
37 Correct 11 ms 1236 KB Output is correct
38 Correct 12 ms 1236 KB Output is correct
39 Correct 13 ms 1236 KB Output is correct
40 Correct 14 ms 1236 KB Output is correct
41 Correct 13 ms 1336 KB Output is correct
42 Correct 12 ms 1236 KB Output is correct
43 Correct 12 ms 1236 KB Output is correct
44 Correct 13 ms 1344 KB Output is correct
45 Correct 12 ms 1328 KB Output is correct
46 Correct 12 ms 1344 KB Output is correct
47 Correct 13 ms 1236 KB Output is correct
48 Correct 13 ms 1236 KB Output is correct
49 Correct 13 ms 1236 KB Output is correct
50 Correct 994 ms 98588 KB Output is correct
51 Correct 986 ms 98644 KB Output is correct
52 Execution timed out 1004 ms 98596 KB Time limit exceeded
53 Halted 0 ms 0 KB -