oj.uz

답안 #1003533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1003533 2024-06-20T12:29:49 Z hyakup Cigle (COI21_cigle) C++17
100 / 100
 111 ms 67436 KB 
#include <bits/stdc++.h>
using namespace std;
#define bug(x) cout << #x << " " << x << endl;

const int maxn = 5e3 + 10;
const int maxm = 1e7;

int dp[maxn][maxn], v[maxn], suf[maxn];

int main(){
  int n; cin >> n;
  for( int i = 1; i <= n; i++ ) cin >> v[i];
  int resp = 0;
  for( int j = n - 1; j >= 1; j-- ){
    // bug(j);
    // for( int k = 0; k <= n; k++ ) cout << dp[j][k] << " "; cout << endl;
    for( int k = n; k > j; k-- ) suf[k] = max( dp[j][k], suf[k + 1] );
    int k = j + 1, cont = 0;
    int sumL = 0, sumR = v[k];
    int pref = dp[j][k];
    for( int i = j - 1; i >= 0; i-- ){
      // bug(i);
      // bug(sumL);
      while( k < n && sumR <= sumL ){
        if( sumL == sumR ) cont++;
        sumR += v[++k];
        pref = max( pref, dp[j][k] + cont );
      }
      // bug(k) ;
      // bug(sumR);
      // bug(cont);

      dp[i][j] = max( pref, suf[k + 1] + cont );
      resp = max( resp, dp[i][j] );
      sumL += v[i + 1];
    }
  }
  cout << resp << endl;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 444 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 444 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 700 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 696 KB Output is correct
20 Correct 0 ms 604 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2908 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 2 ms 2908 KB Output is correct
12 Correct 2 ms 2904 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 444 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 700 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 696 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 1 ms 2908 KB Output is correct
23 Correct 1 ms 2908 KB Output is correct
24 Correct 2 ms 2908 KB Output is correct
25 Correct 2 ms 2908 KB Output is correct
26 Correct 1 ms 2908 KB Output is correct
27 Correct 2 ms 2908 KB Output is correct
28 Correct 2 ms 2908 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 1 ms 2908 KB Output is correct
31 Correct 2 ms 2908 KB Output is correct
32 Correct 2 ms 2904 KB Output is correct
33 Correct 2 ms 2908 KB Output is correct
34 Correct 1 ms 2908 KB Output is correct
35 Correct 1 ms 2908 KB Output is correct
36 Correct 1 ms 2908 KB Output is correct
37 Correct 1 ms 2908 KB Output is correct
38 Correct 1 ms 2908 KB Output is correct
39 Correct 1 ms 2908 KB Output is correct
40 Correct 2 ms 2908 KB Output is correct
41 Correct 1 ms 2908 KB Output is correct
42 Correct 1 ms 2908 KB Output is correct
43 Correct 1 ms 2908 KB Output is correct
44 Correct 2 ms 2908 KB Output is correct
45 Correct 2 ms 2908 KB Output is correct
46 Correct 2 ms 2908 KB Output is correct
47 Correct 2 ms 2904 KB Output is correct
48 Correct 2 ms 2908 KB Output is correct
49 Correct 2 ms 2744 KB Output is correct

Subtask #5
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 444 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 700 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 696 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 1 ms 2908 KB Output is correct
23 Correct 1 ms 2908 KB Output is correct
24 Correct 2 ms 2908 KB Output is correct
25 Correct 2 ms 2908 KB Output is correct
26 Correct 1 ms 2908 KB Output is correct
27 Correct 2 ms 2908 KB Output is correct
28 Correct 2 ms 2908 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 1 ms 2908 KB Output is correct
31 Correct 2 ms 2908 KB Output is correct
32 Correct 2 ms 2904 KB Output is correct
33 Correct 2 ms 2908 KB Output is correct
34 Correct 1 ms 2908 KB Output is correct
35 Correct 1 ms 2908 KB Output is correct
36 Correct 1 ms 2908 KB Output is correct
37 Correct 1 ms 2908 KB Output is correct
38 Correct 1 ms 2908 KB Output is correct
39 Correct 1 ms 2908 KB Output is correct
40 Correct 2 ms 2908 KB Output is correct
41 Correct 1 ms 2908 KB Output is correct
42 Correct 1 ms 2908 KB Output is correct
43 Correct 1 ms 2908 KB Output is correct
44 Correct 2 ms 2908 KB Output is correct
45 Correct 2 ms 2908 KB Output is correct
46 Correct 2 ms 2908 KB Output is correct
47 Correct 2 ms 2904 KB Output is correct
48 Correct 2 ms 2908 KB Output is correct
49 Correct 2 ms 2744 KB Output is correct
50 Correct 84 ms 67408 KB Output is correct
51 Correct 78 ms 67408 KB Output is correct
52 Correct 79 ms 67412 KB Output is correct
53 Correct 91 ms 67436 KB Output is correct
54 Correct 77 ms 67408 KB Output is correct
55 Correct 82 ms 67412 KB Output is correct
56 Correct 96 ms 67412 KB Output is correct
57 Correct 95 ms 67408 KB Output is correct
58 Correct 96 ms 67408 KB Output is correct
59 Correct 104 ms 67424 KB Output is correct
60 Correct 106 ms 67348 KB Output is correct
61 Correct 98 ms 67408 KB Output is correct
62 Correct 111 ms 67408 KB Output is correct
63 Correct 85 ms 67408 KB Output is correct
64 Correct 90 ms 67412 KB Output is correct
65 Correct 87 ms 67412 KB Output is correct
66 Correct 89 ms 67412 KB Output is correct
67 Correct 88 ms 67412 KB Output is correct
68 Correct 87 ms 67408 KB Output is correct
69 Correct 90 ms 67296 KB Output is correct
70 Correct 110 ms 67216 KB Output is correct
71 Correct 104 ms 67292 KB Output is correct
72 Correct 98 ms 67412 KB Output is correct