oj.uz

Submission #487509

# Submission time Handle Problem Language Result Execution time Memory
487509 2021-11-15T17:50:04 Z ETK Cigle (COI21_cigle) C++14
0 / 100
 5 ms 7760 KB 
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define pii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define ll long long
using namespace std;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
    while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
const int N=5e3+5;
int a[N],dp[N][N],g[N][N],pos[N][N];
void Max(int &a,const int b){if(a<b)a=b;}
int main(){
    int n=read();
    rep(i,1,n)a[i]=read();
    rep(i,1,n){
        int sum=0,pre=0,p=i-1;
        rep(j,i,n){
            dp[i][j]=dp[i-1][i-1];
            g[i][j]=g[i][j-1];
            sum+=a[j];
            while(p&&pre+a[p]<=sum)pre+=a[p--];
            if(sum==pre)g[i][j]++;
            pos[i][j]=p;
            if(pos[i][j-1])Max(dp[i][j-1],dp[pos[i][j-1]][i-1]+g[i][j-1]);
            Max(dp[i][j],dp[i][j-1]);
            Max(dp[i][j],dp[i-1][j]);
        }
    }
    printf("%d\n",dp[n][n]);
    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Incorrect 0 ms 464 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Incorrect 0 ms 464 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Incorrect 0 ms 464 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Incorrect 0 ms 464 KB Output isn't correct
6 Halted 0 ms 0 KB -