oj.uz

Submission #405592

# Submission time Handle Problem Language Result Execution time Memory
405592 2021-05-16T14:55:21 Z sad Cigle (COI21_cigle) C++14
48 / 100
 632 ms 247000 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
int n;const int N=5100,M=500*5009;
pair<int,int>dp[N][N];int a[N],prf[M];
pair<int,int>mxdp[N][N];
vector<int>v;
int main()
{ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n;int ans=0;int rw=0;
    for(int i=1;i<n+1;i++)cin>>a[i];memset(prf,-1,sizeof prf);
    for(int m=1;m<=n;m++)
    {
        for(auto it:v)prf[it]=-1;
        v.clear();
        int re=0;v.pb(0);
        for(int i=m;i>0;i--)
        {
            re+=a[i];v.pb(re);
            prf[re]=i;
        }
        re=0;
        dp[m][m]={0,n+1};
        mxdp[m][1]={dp[m][1].fi,1};
        for(int i=2;i<m;i++)
        {

            if(dp[m][i].fi>mxdp[m][i-1].fi)
            {
                mxdp[m][i]={dp[m][i].fi,i};continue;
            }
            mxdp[m][i]=mxdp[m][i-1];
        }
        dp[m+1][m]=mxdp[m][m-1];ans=max(ans,dp[m+1][m].fi);
        rw=0;
        for(int r=m+2;r<n+1;r++)
        {re+=a[r-1];
            if(prf[re]!=-1)rw++;
            int last=dp[r-1][m].se;
            int mx=dp[r-1][m].fi;
            if(prf[re]==-1||prf[re]-2<0)
            {
                dp[r][m]=dp[r-1][m];
                ans=max(ans,mx);continue;
            }
            pair<int,int>z=mxdp[m][prf[re]-2];
            z.fi+=rw;
            if(z.fi>mx)
            {
                dp[r][m]=z;
                ans=max(ans,z.fi);continue;
            }
            dp[r][m]=dp[r-1][m];
            ans=max(ans,mx);
            continue;
        }
    }
    cout<<ans;

}
/*
10
2 3 2 1 1 5 5 2 5 1
*/

Compilation message

cigle.cpp: In function 'int main()':
cigle.cpp:14:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   14 |     for(int i=1;i<n+1;i++)cin>>a[i];memset(prf,-1,sizeof prf);
      |     ^~~
cigle.cpp:14:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   14 |     for(int i=1;i<n+1;i++)cin>>a[i];memset(prf,-1,sizeof prf);
      |                                     ^~~~~~
cigle.cpp:42:17: warning: unused variable 'last' [-Wunused-variable]
   42 |             int last=dp[r-1][m].se;
      |                 ^~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10188 KB Output is correct
2 Correct 6 ms 10188 KB Output is correct
3 Correct 7 ms 10188 KB Output is correct
4 Correct 7 ms 10188 KB Output is correct
5 Correct 6 ms 10188 KB Output is correct
6 Correct 6 ms 10188 KB Output is correct
7 Correct 6 ms 10188 KB Output is correct
8 Correct 6 ms 10188 KB Output is correct
9 Correct 6 ms 10188 KB Output is correct
10 Correct 6 ms 10828 KB Output is correct
11 Correct 6 ms 10828 KB Output is correct
12 Correct 6 ms 10828 KB Output is correct
13 Correct 6 ms 10828 KB Output is correct
14 Correct 6 ms 10828 KB Output is correct
15 Correct 7 ms 10828 KB Output is correct
16 Correct 6 ms 10720 KB Output is correct
17 Correct 6 ms 10828 KB Output is correct
18 Correct 6 ms 10832 KB Output is correct
19 Correct 6 ms 10812 KB Output is correct
20 Correct 6 ms 10760 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16140 KB Output is correct
2 Correct 10 ms 16076 KB Output is correct
3 Correct 10 ms 16076 KB Output is correct
4 Correct 10 ms 16076 KB Output is correct
5 Correct 10 ms 16076 KB Output is correct
6 Correct 11 ms 16076 KB Output is correct
7 Correct 11 ms 16100 KB Output is correct
8 Correct 11 ms 16152 KB Output is correct
9 Correct 11 ms 16112 KB Output is correct
10 Correct 11 ms 16076 KB Output is correct
11 Correct 10 ms 16072 KB Output is correct
12 Correct 10 ms 16076 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10188 KB Output is correct
2 Correct 6 ms 10188 KB Output is correct
3 Correct 7 ms 10188 KB Output is correct
4 Correct 7 ms 10188 KB Output is correct
5 Correct 6 ms 10188 KB Output is correct
6 Correct 6 ms 10188 KB Output is correct
7 Correct 6 ms 10188 KB Output is correct
8 Correct 6 ms 10188 KB Output is correct
9 Correct 6 ms 10188 KB Output is correct
10 Correct 6 ms 10828 KB Output is correct
11 Correct 6 ms 10828 KB Output is correct
12 Correct 6 ms 10828 KB Output is correct
13 Correct 6 ms 10828 KB Output is correct
14 Correct 6 ms 10828 KB Output is correct
15 Correct 7 ms 10828 KB Output is correct
16 Correct 6 ms 10720 KB Output is correct
17 Correct 6 ms 10828 KB Output is correct
18 Correct 6 ms 10832 KB Output is correct
19 Correct 6 ms 10812 KB Output is correct
20 Correct 6 ms 10760 KB Output is correct
21 Correct 10 ms 16140 KB Output is correct
22 Correct 10 ms 16076 KB Output is correct
23 Correct 10 ms 16076 KB Output is correct
24 Correct 10 ms 16076 KB Output is correct
25 Correct 10 ms 16076 KB Output is correct
26 Correct 11 ms 16076 KB Output is correct
27 Correct 11 ms 16100 KB Output is correct
28 Correct 11 ms 16152 KB Output is correct
29 Correct 11 ms 16112 KB Output is correct
30 Correct 11 ms 16076 KB Output is correct
31 Correct 10 ms 16072 KB Output is correct
32 Correct 10 ms 16076 KB Output is correct
33 Correct 10 ms 16112 KB Output is correct
34 Correct 11 ms 16076 KB Output is correct
35 Correct 10 ms 16076 KB Output is correct
36 Correct 11 ms 16076 KB Output is correct
37 Correct 11 ms 16132 KB Output is correct
38 Correct 11 ms 16092 KB Output is correct
39 Correct 11 ms 16132 KB Output is correct
40 Correct 12 ms 16108 KB Output is correct
41 Correct 11 ms 16076 KB Output is correct
42 Correct 11 ms 16048 KB Output is correct
43 Correct 14 ms 16096 KB Output is correct
44 Correct 12 ms 16120 KB Output is correct
45 Correct 11 ms 16076 KB Output is correct
46 Correct 11 ms 16096 KB Output is correct
47 Correct 12 ms 16160 KB Output is correct
48 Correct 13 ms 16156 KB Output is correct
49 Correct 11 ms 16132 KB Output is correct

Subtask #5
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10188 KB Output is correct
2 Correct 6 ms 10188 KB Output is correct
3 Correct 7 ms 10188 KB Output is correct
4 Correct 7 ms 10188 KB Output is correct
5 Correct 6 ms 10188 KB Output is correct
6 Correct 6 ms 10188 KB Output is correct
7 Correct 6 ms 10188 KB Output is correct
8 Correct 6 ms 10188 KB Output is correct
9 Correct 6 ms 10188 KB Output is correct
10 Correct 6 ms 10828 KB Output is correct
11 Correct 6 ms 10828 KB Output is correct
12 Correct 6 ms 10828 KB Output is correct
13 Correct 6 ms 10828 KB Output is correct
14 Correct 6 ms 10828 KB Output is correct
15 Correct 7 ms 10828 KB Output is correct
16 Correct 6 ms 10720 KB Output is correct
17 Correct 6 ms 10828 KB Output is correct
18 Correct 6 ms 10832 KB Output is correct
19 Correct 6 ms 10812 KB Output is correct
20 Correct 6 ms 10760 KB Output is correct
21 Correct 10 ms 16140 KB Output is correct
22 Correct 10 ms 16076 KB Output is correct
23 Correct 10 ms 16076 KB Output is correct
24 Correct 10 ms 16076 KB Output is correct
25 Correct 10 ms 16076 KB Output is correct
26 Correct 11 ms 16076 KB Output is correct
27 Correct 11 ms 16100 KB Output is correct
28 Correct 11 ms 16152 KB Output is correct
29 Correct 11 ms 16112 KB Output is correct
30 Correct 11 ms 16076 KB Output is correct
31 Correct 10 ms 16072 KB Output is correct
32 Correct 10 ms 16076 KB Output is correct
33 Correct 10 ms 16112 KB Output is correct
34 Correct 11 ms 16076 KB Output is correct
35 Correct 10 ms 16076 KB Output is correct
36 Correct 11 ms 16076 KB Output is correct
37 Correct 11 ms 16132 KB Output is correct
38 Correct 11 ms 16092 KB Output is correct
39 Correct 11 ms 16132 KB Output is correct
40 Correct 12 ms 16108 KB Output is correct
41 Correct 11 ms 16076 KB Output is correct
42 Correct 11 ms 16048 KB Output is correct
43 Correct 14 ms 16096 KB Output is correct
44 Correct 12 ms 16120 KB Output is correct
45 Correct 11 ms 16076 KB Output is correct
46 Correct 11 ms 16096 KB Output is correct
47 Correct 12 ms 16160 KB Output is correct
48 Correct 13 ms 16156 KB Output is correct
49 Correct 11 ms 16132 KB Output is correct
50 Correct 414 ms 244816 KB Output is correct
51 Correct 415 ms 244872 KB Output is correct
52 Correct 417 ms 244804 KB Output is correct
53 Correct 433 ms 245048 KB Output is correct
54 Correct 431 ms 244788 KB Output is correct
55 Correct 409 ms 244900 KB Output is correct
56 Correct 429 ms 244868 KB Output is correct
57 Correct 425 ms 244936 KB Output is correct
58 Correct 419 ms 244808 KB Output is correct
59 Correct 449 ms 244952 KB Output is correct
60 Incorrect 632 ms 247000 KB Output isn't correct
61 Halted 0 ms 0 KB -