oj.uz

Submission #1075513

# Submission time Handle Problem Language Result Execution time Memory
1075513 2024-08-26T07:14:00 Z Faisal_Saqib Catfish Farm (IOI22_fish) C++17
53 / 100
 137 ms 25784 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define all(x) begin(x),end(x)
ll solve(ll&n,ll&m,vll&x,vll&y,vll&w)
{
    ll ans=0;
    ll val[n+1][n+1],pre[n+1][n+1];
    for(int i=0;i<n;i++)for(int j=0;j<=n;j++)val[i][j]=pre[i][j]=0;
    for(int j=0;j<m;j++)val[x[j]][y[j]+1]+=w[j];
    for(int i=0;i<=n;i++)
    {
        pre[i][0]=val[i][0];
        for(int j=1;j<=n;j++)
            pre[i][j]=pre[i][j-1]+val[i][j];
    }
    ll dp[n+1][n+1][3];
    for(int i=0;i<n;i++)
        for(int j=0;j<=n;j++)
            for(int k=0;k<2;k++)
                dp[i][j][k]=0;
    for(int i=1;i<n;i++)
    {
        // ll sum=0;
        for(int h=0;h<=n;h++)
        {
            for(int hp=0;hp<=n;hp++)
            {
                dp[i][h][0]=max(dp[i][h][0],dp[i-1][hp][0]);
                dp[i][h][0]=max(dp[i][h][0],dp[i-1][hp][1]);
                dp[i][h][0]=max(dp[i][h][0],dp[i-1][hp][0]-pre[i-1][hp]+pre[i-1][h]);
            }

            for(int hp=0;hp<=n;hp++)
            {
                dp[i][h][1]=max(dp[i][h][1],dp[i-1][hp][0]);
                dp[i][h][1]=max(dp[i][h][1],dp[i-1][hp][1]);
                dp[i][h][1]=max(dp[i][h][1],dp[i-1][hp][0]+pre[i-1][h]-pre[i-1][hp]);
                dp[i][h][1]=max(dp[i][h][1],dp[i-1][hp][1]+pre[i][hp]-pre[i][h]);
            }

            // sum+=val[i-1][h];
            // ll aux=0;
            // for(int nh=h+1;nh<=n;nh++)
            // {
            //     // aux+=val[i][nh];
            //     dp[i][h][0]=max(dp[i][h][0],dp[i-1][nh][0]);
            //     dp[i][h][0]=max(dp[i][h][0],dp[i-1][nh][1]);
                
            //     dp[i][h][1]=max(dp[i][h][1],dp[i-1][nh][0]);
            //     dp[i][h][1]=max(dp[i][h][1],dp[i-1][nh][1]+pre[i][nh]-pre[i][h]);

            // }
            // // ll og=sum;
            // for(int nh=0;nh<=h;nh++)
            // {
            //     // sum-=val[i-1][nh];
            //     dp[i][h][0]=max(dp[i][h][0],dp[i-1][nh][0]+pre[i-1][h]-pre[i-1][nh]);
            //     dp[i][h][0]=max(dp[i][h][0],dp[i-1][nh][1]);
                
            //     dp[i][h][1]=max(dp[i][h][1],dp[i-1][nh][0]+pre[i-1][j]-pre[i-1][nh]);
            //     dp[i][h][1]=max(dp[i][h][1],dp[i-1][nh][1]);
            // }
            // sum=og;
        }
    }
    for(int i=0;i<n;i++)
    {
        for(int h=0;h<=n;h++)
        {
            // cout<<"For: "<<i<<' '<<h<<' '<<dp[i][h][0]<<' '<<dp[i][h][1]<<endl;
            ans=max(ans,dp[i][h][0]);
            ans=max(ans,dp[i][h][1]);
        }
    }
    return ans;
}
ll subtask2(ll&n,ll&m,vll&x,vll&y,vll&w)
{
    ll ans=0;
    ll val[2][n]={0};
    for(int i=0;i<2;i++)
    {
        for(int j=0;j<n;j++)
        {
            val[i][j]=0;
        }
    }
    ll sum1=0,sum0=0;
    for(int j=0;j<m;j++)
    {
        val[x[j]][y[j]]+=w[j];
        if(x[j]==1)
        {
            sum1+=w[j];
        }
        else
        {
            sum0+=w[j];
        }
    }
    ans=max(sum0,sum1);
    ll taken=0;
    ll cur=0;
    for(int j=0;j<n;j++)
    {
        cur+=val[0][j];
        taken+=val[1][j];
        ans=max(ans,cur);
        if(n>2)
            ans=max(ans,cur+sum1-taken);
    }
    return ans;
}
ll subtask3(ll&n,ll&m,vll&x,vll&y,vll&w)
{
    ll ans=0;
    ll val[n+1];
    for(int i=0;i<n;i++)val[i]=0;
    for(int j=0;j<m;j++)val[x[j]]+=w[j];
    ll dp[n+1][3][3];
    for(int i=0;i<n;i++)
        for(int j=0;j<2;j++)
            for(int k=0;k<2;k++)
                dp[i][j][k]=0;
    for(int i=1;i<n;i++)
    {
        // wall not at i
        dp[i][0][0]=max(max(dp[i-1][0][0],dp[i-1][0][1]),dp[i-1][1][0]);
        dp[i][0][1]=max(max(dp[i-1][0][0],dp[i-1][0][1]),dp[i-1][1][0]+val[i]);

        dp[i][1][0]=max(max(dp[i-1][0][1],dp[i-1][0][0]+val[i-1]),dp[i-1][1][0]);
    }
    for(int i=0;i<n;i++)
    {
        ans=max({ans,dp[i][0][0],dp[i][0][1],dp[i][1][0],dp[i][1][1]});
    }
    return ans;
}
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W)
{
    ll n=N,m=M,ans=0;
    vector<ll> x(all(X)),y(all(Y)),w(all(W));
    ll mx_x=*max_element(all(x));
    if(n<=300)
        return solve(n,m,x,y,w);
    if(mx_x<=1)
        return subtask2(n,m,x,y,w);
    return subtask3(n,m,x,y,w);
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:143:16: warning: unused variable 'ans' [-Wunused-variable]
  143 |     ll n=N,m=M,ans=0;
      |                ^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 6492 KB Output is correct
2 Correct 21 ms 7508 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 72 ms 25760 KB Output is correct
6 Correct 73 ms 25784 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 33 ms 10764 KB Output is correct
3 Correct 39 ms 14676 KB Output is correct
4 Correct 16 ms 7012 KB Output is correct
5 Correct 23 ms 8380 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 17 ms 7004 KB Output is correct
13 Correct 20 ms 8284 KB Output is correct
14 Correct 16 ms 6992 KB Output is correct
15 Correct 17 ms 7768 KB Output is correct
16 Correct 17 ms 7004 KB Output is correct
17 Correct 18 ms 7632 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 4 ms 8028 KB Output is correct
3 Correct 14 ms 10704 KB Output is correct
4 Correct 11 ms 10492 KB Output is correct
5 Correct 25 ms 14124 KB Output is correct
6 Correct 20 ms 13660 KB Output is correct
7 Correct 24 ms 13904 KB Output is correct
8 Correct 23 ms 13884 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 14 ms 1208 KB Output is correct
10 Correct 110 ms 4096 KB Output is correct
11 Correct 14 ms 1368 KB Output is correct
12 Correct 113 ms 3932 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 109 ms 4008 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 14 ms 1208 KB Output is correct
10 Correct 110 ms 4096 KB Output is correct
11 Correct 14 ms 1368 KB Output is correct
12 Correct 113 ms 3932 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 109 ms 4008 KB Output is correct
15 Correct 116 ms 3928 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 117 ms 6492 KB Output is correct
18 Correct 116 ms 6492 KB Output is correct
19 Correct 118 ms 6584 KB Output is correct
20 Correct 125 ms 6520 KB Output is correct
21 Correct 119 ms 6600 KB Output is correct
22 Correct 137 ms 9092 KB Output is correct
23 Correct 122 ms 4508 KB Output is correct
24 Correct 120 ms 5724 KB Output is correct
25 Correct 112 ms 4032 KB Output is correct
26 Correct 113 ms 4444 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 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 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 14 ms 1208 KB Output is correct
10 Correct 110 ms 4096 KB Output is correct
11 Correct 14 ms 1368 KB Output is correct
12 Correct 113 ms 3932 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 109 ms 4008 KB Output is correct
15 Correct 116 ms 3928 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 117 ms 6492 KB Output is correct
18 Correct 116 ms 6492 KB Output is correct
19 Correct 118 ms 6584 KB Output is correct
20 Correct 125 ms 6520 KB Output is correct
21 Correct 119 ms 6600 KB Output is correct
22 Correct 137 ms 9092 KB Output is correct
23 Correct 122 ms 4508 KB Output is correct
24 Correct 120 ms 5724 KB Output is correct
25 Correct 112 ms 4032 KB Output is correct
26 Correct 113 ms 4444 KB Output is correct
27 Incorrect 1 ms 604 KB 1st lines differ - on the 1st token, expected: '2999', found: '1999'
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 4 ms 8028 KB Output is correct
3 Correct 14 ms 10704 KB Output is correct
4 Correct 11 ms 10492 KB Output is correct
5 Correct 25 ms 14124 KB Output is correct
6 Correct 20 ms 13660 KB Output is correct
7 Correct 24 ms 13904 KB Output is correct
8 Correct 23 ms 13884 KB Output is correct
9 Incorrect 21 ms 13936 KB 1st lines differ - on the 1st token, expected: '99999', found: '66666'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 6492 KB Output is correct
2 Correct 21 ms 7508 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 72 ms 25760 KB Output is correct
6 Correct 73 ms 25784 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 33 ms 10764 KB Output is correct
9 Correct 39 ms 14676 KB Output is correct
10 Correct 16 ms 7012 KB Output is correct
11 Correct 23 ms 8380 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 17 ms 7004 KB Output is correct
19 Correct 20 ms 8284 KB Output is correct
20 Correct 16 ms 6992 KB Output is correct
21 Correct 17 ms 7768 KB Output is correct
22 Correct 17 ms 7004 KB Output is correct
23 Correct 18 ms 7632 KB Output is correct
24 Correct 1 ms 1884 KB Output is correct
25 Correct 4 ms 8028 KB Output is correct
26 Correct 14 ms 10704 KB Output is correct
27 Correct 11 ms 10492 KB Output is correct
28 Correct 25 ms 14124 KB Output is correct
29 Correct 20 ms 13660 KB Output is correct
30 Correct 24 ms 13904 KB Output is correct
31 Correct 23 ms 13884 KB Output is correct
32 Correct 0 ms 596 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 14 ms 1208 KB Output is correct
41 Correct 110 ms 4096 KB Output is correct
42 Correct 14 ms 1368 KB Output is correct
43 Correct 113 ms 3932 KB Output is correct
44 Correct 2 ms 600 KB Output is correct
45 Correct 109 ms 4008 KB Output is correct
46 Correct 116 ms 3928 KB Output is correct
47 Correct 3 ms 604 KB Output is correct
48 Correct 117 ms 6492 KB Output is correct
49 Correct 116 ms 6492 KB Output is correct
50 Correct 118 ms 6584 KB Output is correct
51 Correct 125 ms 6520 KB Output is correct
52 Correct 119 ms 6600 KB Output is correct
53 Correct 137 ms 9092 KB Output is correct
54 Correct 122 ms 4508 KB Output is correct
55 Correct 120 ms 5724 KB Output is correct
56 Correct 112 ms 4032 KB Output is correct
57 Correct 113 ms 4444 KB Output is correct
58 Incorrect 1 ms 604 KB 1st lines differ - on the 1st token, expected: '2999', found: '1999'
59 Halted 0 ms 0 KB -