oj.uz

Submission #1075477

# Submission time Handle Problem Language Result Execution time Memory
1075477 2024-08-26T06:53:03 Z Faisal_Saqib Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 2097152 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];
    for(int i=0;i<n;i++)for(int j=0;j<=n;j++)val[i][j]=0;
    for(int j=0;j<m;j++)val[x[j]][y[j]+1]+=w[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++)
        {
            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;
}

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

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1006 ms 2097152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 980 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 996 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 344 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 9 ms 1172 KB Output is correct
10 Correct 68 ms 3392 KB Output is correct
11 Correct 9 ms 1116 KB Output is correct
12 Correct 68 ms 3164 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 68 ms 3296 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 344 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 9 ms 1172 KB Output is correct
10 Correct 68 ms 3392 KB Output is correct
11 Correct 9 ms 1116 KB Output is correct
12 Correct 68 ms 3164 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 68 ms 3296 KB Output is correct
15 Correct 67 ms 3164 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 78 ms 5956 KB Output is correct
18 Correct 75 ms 5976 KB Output is correct
19 Correct 76 ms 6076 KB Output is correct
20 Correct 77 ms 5948 KB Output is correct
21 Correct 76 ms 5976 KB Output is correct
22 Correct 83 ms 8788 KB Output is correct
23 Correct 70 ms 3672 KB Output is correct
24 Correct 75 ms 4952 KB Output is correct
25 Correct 68 ms 3416 KB Output is correct
26 Correct 72 ms 3676 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 344 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 9 ms 1172 KB Output is correct
10 Correct 68 ms 3392 KB Output is correct
11 Correct 9 ms 1116 KB Output is correct
12 Correct 68 ms 3164 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 68 ms 3296 KB Output is correct
15 Correct 67 ms 3164 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 78 ms 5956 KB Output is correct
18 Correct 75 ms 5976 KB Output is correct
19 Correct 76 ms 6076 KB Output is correct
20 Correct 77 ms 5948 KB Output is correct
21 Correct 76 ms 5976 KB Output is correct
22 Correct 83 ms 8788 KB Output is correct
23 Correct 70 ms 3672 KB Output is correct
24 Correct 75 ms 4952 KB Output is correct
25 Correct 68 ms 3416 KB Output is correct
26 Correct 72 ms 3676 KB Output is correct
27 Execution timed out 1069 ms 282356 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 996 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1006 ms 2097152 KB Time limit exceeded
2 Halted 0 ms 0 KB -