oj.uz

Submission #1075506

# Submission time Handle Problem Language Result Execution time Memory
1075506 2024-08-26T07:09:47 Z Faisal_Saqib Catfish Farm (IOI22_fish) C++17
12 / 100
 69 ms 22136 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][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]+aux);

            // }
            // 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]+sum);
            //     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]+sum);
            //     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 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));
    if(n<=300)
        return solve(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:106:16: warning: unused variable 'ans' [-Wunused-variable]
  106 |     ll n=N,m=M,ans=0;
      |                ^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 11100 KB Output is correct
2 Correct 21 ms 12888 KB Output is correct
3 Correct 6 ms 8160 KB Output is correct
4 Correct 4 ms 8028 KB Output is correct
5 Correct 69 ms 22128 KB Output is correct
6 Correct 68 ms 22136 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8028 KB Output is correct
2 Correct 5 ms 8028 KB Output is correct
3 Correct 13 ms 9816 KB Output is correct
4 Correct 10 ms 9836 KB Output is correct
5 Correct 21 ms 12880 KB Output is correct
6 Correct 21 ms 12892 KB Output is correct
7 Correct 21 ms 12892 KB Output is correct
8 Correct 23 ms 12888 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8028 KB Output is correct
2 Correct 5 ms 8028 KB Output is correct
3 Correct 13 ms 9816 KB Output is correct
4 Correct 10 ms 9836 KB Output is correct
5 Correct 21 ms 12880 KB Output is correct
6 Correct 21 ms 12892 KB Output is correct
7 Correct 21 ms 12892 KB Output is correct
8 Correct 23 ms 12888 KB Output is correct
9 Incorrect 21 ms 12880 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 17 ms 11100 KB Output is correct
2 Correct 21 ms 12888 KB Output is correct
3 Correct 6 ms 8160 KB Output is correct
4 Correct 4 ms 8028 KB Output is correct
5 Correct 69 ms 22128 KB Output is correct
6 Correct 68 ms 22136 KB Output is correct
7 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
8 Halted 0 ms 0 KB -