oj.uz

Submission #467450

# Submission time Handle Problem Language Result Execution time Memory
467450 2021-08-23T03:18:12 Z julian33 Cigle (COI21_cigle) C++14
100 / 100
 248 ms 201336 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);} 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxN=5e3+5; //make sure this is right
const int mod=1e9+7;

int dp[mxN][mxN],a[mxN],cnt[mxN][mxN],ptr[mxN][mxN];

int main(){
    cin.sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #ifdef LOCAL
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    #endif

    int n; cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=n;i++){
        int p=i-1;
        int s1=0; int s2=0;
        for(int j=i;j<=n;j++){
            dp[i][j]=dp[i-1][i-1];
            cnt[i][j]=cnt[i][j-1];
            s1+=a[j];
            while(p && s2+a[p]<=s1)
                s2+=a[p--];
            if(s1==s2)
                cnt[i][j]++;
            ptr[i][j]=p;
            if(ptr[i][j-1])
                maxa(dp[i][j],cnt[i][j-1]+dp[ptr[i][j-1]][i-1]);
            deb(i,j,dp[i][j]);
            maxa(dp[i][j],dp[i][j-1]);
            maxa(dp[i][j],dp[i-1][j]);
        }
    }
    cout<<dp[n][n]<<"\n";
}

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7756 KB Output is correct
2 Correct 5 ms 7756 KB Output is correct
3 Correct 5 ms 7756 KB Output is correct
4 Correct 6 ms 7828 KB Output is correct
5 Correct 5 ms 7756 KB Output is correct
6 Correct 6 ms 7756 KB Output is correct
7 Correct 6 ms 7744 KB Output is correct
8 Correct 7 ms 7756 KB Output is correct
9 Correct 6 ms 7748 KB Output is correct
10 Correct 6 ms 7756 KB Output is correct
11 Correct 5 ms 7756 KB Output is correct
12 Correct 6 ms 7756 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 576 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 1 ms 1228 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 1 ms 1228 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1348 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 1 ms 1228 KB Output is correct
19 Correct 1 ms 1228 KB Output is correct
20 Correct 1 ms 1348 KB Output is correct
21 Correct 5 ms 7756 KB Output is correct
22 Correct 5 ms 7756 KB Output is correct
23 Correct 5 ms 7756 KB Output is correct
24 Correct 6 ms 7828 KB Output is correct
25 Correct 5 ms 7756 KB Output is correct
26 Correct 6 ms 7756 KB Output is correct
27 Correct 6 ms 7744 KB Output is correct
28 Correct 7 ms 7756 KB Output is correct
29 Correct 6 ms 7748 KB Output is correct
30 Correct 6 ms 7756 KB Output is correct
31 Correct 5 ms 7756 KB Output is correct
32 Correct 6 ms 7756 KB Output is correct
33 Correct 5 ms 7760 KB Output is correct
34 Correct 5 ms 7752 KB Output is correct
35 Correct 5 ms 7756 KB Output is correct
36 Correct 6 ms 7756 KB Output is correct
37 Correct 7 ms 7756 KB Output is correct
38 Correct 6 ms 7756 KB Output is correct
39 Correct 6 ms 7756 KB Output is correct
40 Correct 6 ms 7884 KB Output is correct
41 Correct 6 ms 7756 KB Output is correct
42 Correct 5 ms 7756 KB Output is correct
43 Correct 5 ms 7756 KB Output is correct
44 Correct 6 ms 7756 KB Output is correct
45 Correct 6 ms 7756 KB Output is correct
46 Correct 6 ms 7756 KB Output is correct
47 Correct 6 ms 7756 KB Output is correct
48 Correct 6 ms 7756 KB Output is correct
49 Correct 6 ms 7796 KB Output is correct

Subtask #5
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 576 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 1 ms 1228 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 1 ms 1228 KB Output is correct
14 Correct 1 ms 1228 KB Output is correct
15 Correct 1 ms 1348 KB Output is correct
16 Correct 1 ms 1228 KB Output is correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 1 ms 1228 KB Output is correct
19 Correct 1 ms 1228 KB Output is correct
20 Correct 1 ms 1348 KB Output is correct
21 Correct 5 ms 7756 KB Output is correct
22 Correct 5 ms 7756 KB Output is correct
23 Correct 5 ms 7756 KB Output is correct
24 Correct 6 ms 7828 KB Output is correct
25 Correct 5 ms 7756 KB Output is correct
26 Correct 6 ms 7756 KB Output is correct
27 Correct 6 ms 7744 KB Output is correct
28 Correct 7 ms 7756 KB Output is correct
29 Correct 6 ms 7748 KB Output is correct
30 Correct 6 ms 7756 KB Output is correct
31 Correct 5 ms 7756 KB Output is correct
32 Correct 6 ms 7756 KB Output is correct
33 Correct 5 ms 7760 KB Output is correct
34 Correct 5 ms 7752 KB Output is correct
35 Correct 5 ms 7756 KB Output is correct
36 Correct 6 ms 7756 KB Output is correct
37 Correct 7 ms 7756 KB Output is correct
38 Correct 6 ms 7756 KB Output is correct
39 Correct 6 ms 7756 KB Output is correct
40 Correct 6 ms 7884 KB Output is correct
41 Correct 6 ms 7756 KB Output is correct
42 Correct 5 ms 7756 KB Output is correct
43 Correct 5 ms 7756 KB Output is correct
44 Correct 6 ms 7756 KB Output is correct
45 Correct 6 ms 7756 KB Output is correct
46 Correct 6 ms 7756 KB Output is correct
47 Correct 6 ms 7756 KB Output is correct
48 Correct 6 ms 7756 KB Output is correct
49 Correct 6 ms 7796 KB Output is correct
50 Correct 228 ms 201152 KB Output is correct
51 Correct 233 ms 201312 KB Output is correct
52 Correct 241 ms 201160 KB Output is correct
53 Correct 236 ms 201212 KB Output is correct
54 Correct 236 ms 201172 KB Output is correct
55 Correct 237 ms 201156 KB Output is correct
56 Correct 241 ms 201308 KB Output is correct
57 Correct 248 ms 201160 KB Output is correct
58 Correct 239 ms 201160 KB Output is correct
59 Correct 241 ms 201184 KB Output is correct
60 Correct 236 ms 201284 KB Output is correct
61 Correct 234 ms 201180 KB Output is correct
62 Correct 238 ms 201244 KB Output is correct
63 Correct 246 ms 201196 KB Output is correct
64 Correct 238 ms 201276 KB Output is correct
65 Correct 234 ms 201164 KB Output is correct
66 Correct 235 ms 201220 KB Output is correct
67 Correct 239 ms 201336 KB Output is correct
68 Correct 240 ms 201320 KB Output is correct
69 Correct 234 ms 201156 KB Output is correct
70 Correct 230 ms 201252 KB Output is correct
71 Correct 240 ms 201280 KB Output is correct
72 Correct 247 ms 201272 KB Output is correct