oj.uz

Submission #1075557

# Submission time Handle Problem Language Result Execution time Memory
1075557 2024-08-26T07:41:26 Z Faisal_Saqib Catfish Farm (IOI22_fish) C++17
53 / 100
 1000 ms 226400 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define all(x) begin(x),end(x)
const int N=3e3+1;
ll val[N][N],pre[N][N];
map<ll,ll> dp[N][3];
vll possible[N];
ll solve(ll&n,ll&m,vll&x,vll&y,vll&w)
{
    ll ans=0;
    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],possible[x[j]].push_back(y[j]+1),possible[x[j]+1].push_back(y[j]+1);
        if(x[j]>0)
            possible[x[j]-1].push_back(y[j]+1);
    }
    for(int i=0;i<=n;i++)
    {
        possible[i].push_back(0);
        possible[i].push_back(n);
        pre[i][0]=val[i][0];
        for(int j=1;j<=n;j++)
            pre[i][j]=pre[i][j-1]+val[i][j];
    }
    // 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(auto&h:possible[0])
    {
        dp[0][0][h]=0;
        dp[0][1][h]=0;
    }
    for(int i=1;i<n;i++)
    {
        // ll sum=0;
        ll mx1=-2e18;
        ll mx2=-2e18;
        ll mx11=0,mx22=0;
        for(auto&ip:dp[i-1][0])
        {
            int hp=ip.first;
            mx11=max(mx11,ip.second);

            mx1=max(mx1,ip.second-pre[i-1][hp]);
        }
        for(auto&ip:dp[i-1][1])
        {
            int hp=ip.first;
            mx22=max(mx22,ip.second);
            mx2=max(mx2,ip.second+pre[i][hp]);
        }
        for(auto&h:possible[i])
        {
            dp[i][0][h]=max(dp[i][0][h],mx1+pre[i-1][h]);
            dp[i][1][h]=max(dp[i][1][h],mx1+pre[i-1][h]);
            dp[i][1][h]=max(dp[i][1][h],mx2-pre[i][h]);

            dp[i][0][h]=max(dp[i][0][h],mx11);
            dp[i][0][h]=max(dp[i][0][h],mx22);

            dp[i][1][h]=max(dp[i][1][h],mx11);
            dp[i][1][h]=max(dp[i][1][h],mx22);
            // 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(auto&ip:dp[i][0])
        {
            // cout<<"AT "<<ip.first<<' '<<i<<' '<<ip.second<<endl;
            ans=max(ans,ip.second);
        }
        for(auto&ip:dp[i][1])
        {
            // cout<<"AT1 "<<ip.first<<' '<<i<<' '<<ip.second<<endl;
            ans=max(ans,ip.second);
        }
    }
    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<=3000)
        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:171:16: warning: unused variable 'ans' [-Wunused-variable]
  171 |     ll n=N,m=M,ans=0;
      |                ^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 5976 KB Output is correct
2 Correct 18 ms 6992 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 59 ms 22632 KB Output is correct
6 Correct 60 ms 22616 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 860 KB Output is correct
2 Correct 29 ms 9760 KB Output is correct
3 Correct 37 ms 11856 KB Output is correct
4 Correct 20 ms 5968 KB Output is correct
5 Correct 19 ms 7004 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 0 ms 860 KB Output is correct
8 Correct 0 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 15 ms 5976 KB Output is correct
13 Correct 18 ms 6996 KB Output is correct
14 Correct 17 ms 5980 KB Output is correct
15 Correct 18 ms 6628 KB Output is correct
16 Correct 16 ms 5980 KB Output is correct
17 Correct 17 ms 6492 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 13 ms 10288 KB Output is correct
4 Correct 11 ms 10584 KB Output is correct
5 Correct 22 ms 13392 KB Output is correct
6 Correct 19 ms 13400 KB Output is correct
7 Correct 26 ms 13404 KB Output is correct
8 Correct 22 ms 13400 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 0 ms 860 KB Output is correct
3 Correct 1 ms 908 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 0 ms 856 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 2 ms 2748 KB Output is correct
12 Correct 5 ms 4956 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 0 ms 860 KB Output is correct
3 Correct 1 ms 908 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 0 ms 856 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 2 ms 2748 KB Output is correct
12 Correct 5 ms 4956 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4992 KB Output is correct
16 Correct 3 ms 2140 KB Output is correct
17 Correct 95 ms 15976 KB Output is correct
18 Correct 91 ms 14552 KB Output is correct
19 Correct 75 ms 14680 KB Output is correct
20 Correct 68 ms 13648 KB Output is correct
21 Correct 72 ms 13652 KB Output is correct
22 Correct 185 ms 22732 KB Output is correct
23 Correct 15 ms 8540 KB Output is correct
24 Correct 64 ms 15116 KB Output is correct
25 Correct 3 ms 5212 KB Output is correct
26 Correct 14 ms 8024 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 0 ms 860 KB Output is correct
3 Correct 1 ms 908 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 0 ms 856 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 3 ms 5212 KB Output is correct
11 Correct 2 ms 2748 KB Output is correct
12 Correct 5 ms 4956 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4992 KB Output is correct
16 Correct 3 ms 2140 KB Output is correct
17 Correct 95 ms 15976 KB Output is correct
18 Correct 91 ms 14552 KB Output is correct
19 Correct 75 ms 14680 KB Output is correct
20 Correct 68 ms 13648 KB Output is correct
21 Correct 72 ms 13652 KB Output is correct
22 Correct 185 ms 22732 KB Output is correct
23 Correct 15 ms 8540 KB Output is correct
24 Correct 64 ms 15116 KB Output is correct
25 Correct 3 ms 5212 KB Output is correct
26 Correct 14 ms 8024 KB Output is correct
27 Correct 76 ms 143936 KB Output is correct
28 Correct 582 ms 65800 KB Output is correct
29 Execution timed out 1054 ms 226400 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 13 ms 10288 KB Output is correct
4 Correct 11 ms 10584 KB Output is correct
5 Correct 22 ms 13392 KB Output is correct
6 Correct 19 ms 13400 KB Output is correct
7 Correct 26 ms 13404 KB Output is correct
8 Correct 22 ms 13400 KB Output is correct
9 Incorrect 29 ms 13392 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 5976 KB Output is correct
2 Correct 18 ms 6992 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 59 ms 22632 KB Output is correct
6 Correct 60 ms 22616 KB Output is correct
7 Correct 0 ms 860 KB Output is correct
8 Correct 29 ms 9760 KB Output is correct
9 Correct 37 ms 11856 KB Output is correct
10 Correct 20 ms 5968 KB Output is correct
11 Correct 19 ms 7004 KB Output is correct
12 Correct 0 ms 860 KB Output is correct
13 Correct 0 ms 860 KB Output is correct
14 Correct 0 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 15 ms 5976 KB Output is correct
19 Correct 18 ms 6996 KB Output is correct
20 Correct 17 ms 5980 KB Output is correct
21 Correct 18 ms 6628 KB Output is correct
22 Correct 16 ms 5980 KB Output is correct
23 Correct 17 ms 6492 KB Output is correct
24 Correct 2 ms 2392 KB Output is correct
25 Correct 5 ms 8540 KB Output is correct
26 Correct 13 ms 10288 KB Output is correct
27 Correct 11 ms 10584 KB Output is correct
28 Correct 22 ms 13392 KB Output is correct
29 Correct 19 ms 13400 KB Output is correct
30 Correct 26 ms 13404 KB Output is correct
31 Correct 22 ms 13400 KB Output is correct
32 Correct 1 ms 860 KB Output is correct
33 Correct 0 ms 860 KB Output is correct
34 Correct 1 ms 908 KB Output is correct
35 Correct 0 ms 860 KB Output is correct
36 Correct 0 ms 860 KB Output is correct
37 Correct 0 ms 860 KB Output is correct
38 Correct 0 ms 856 KB Output is correct
39 Correct 1 ms 860 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Correct 3 ms 5212 KB Output is correct
42 Correct 2 ms 2748 KB Output is correct
43 Correct 5 ms 4956 KB Output is correct
44 Correct 1 ms 1628 KB Output is correct
45 Correct 2 ms 4956 KB Output is correct
46 Correct 2 ms 4992 KB Output is correct
47 Correct 3 ms 2140 KB Output is correct
48 Correct 95 ms 15976 KB Output is correct
49 Correct 91 ms 14552 KB Output is correct
50 Correct 75 ms 14680 KB Output is correct
51 Correct 68 ms 13648 KB Output is correct
52 Correct 72 ms 13652 KB Output is correct
53 Correct 185 ms 22732 KB Output is correct
54 Correct 15 ms 8540 KB Output is correct
55 Correct 64 ms 15116 KB Output is correct
56 Correct 3 ms 5212 KB Output is correct
57 Correct 14 ms 8024 KB Output is correct
58 Correct 76 ms 143936 KB Output is correct
59 Correct 582 ms 65800 KB Output is correct
60 Execution timed out 1054 ms 226400 KB Time limit exceeded
61 Halted 0 ms 0 KB -