oj.uz

Submission #1075480

# Submission time Handle Problem Language Result Execution time Memory
1075480 2024-08-26T06:57:07 Z Muhammad_Aneeq Catfish Farm (IOI22_fish) C++17
3 / 100
 53 ms 7268 KB 
#include <vector>
using namespace std;
long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> W)
{
    bool subt1=1,subt2=1,subt3=1;
    for (int i=0;i<M;i++)
    {
        if (X[i]%2)
            subt1=0;
        if (X[i]>1)
            subt2=0;
        if (Y[i]!=0)
            subt3=0;
    }
    if (subt1)
    {
        long long sm=0;
        for (int i=0;i<M;i++)
            sm+=W[i];
        return sm;
    }
    if (subt2)
    {
        long long sm[N]={};
        vector<vector<long long>>val(2,vector<long long>(N,0));
        for (int i=0;i<M;i++)
            val[X[i]][Y[i]]=W[i];
        sm[0]=val[1][0];
        for (int i=1;i<N;i++)
            sm[i+1]=sm[i]+val[1][i];
        long long ans=sm[N-1];
        long long x=0;
        for (int i=0;i<N;i++)
        {
            x+=val[0][i];
            ans=max(ans,x+sm[N-1]-sm[i]);
        }
        return ans;
    }
    if (subt3)
    {
        long long dp[N][2]={};
        int val[N]={};
        for (int i=0;i<M;i++)
            val[X[i]]=W[i];
        dp[0][0]=0,dp[0][1]=val[0];
        long long ans=0;
        for (int i=1;i<N;i++)
        {
            if (i>1)
                dp[i][0]=max(dp[i-2][0],dp[i-2][1])+val[i];
            else
                dp[i][0]=val[i];
            if (i<N-1)
                dp[i][1]=max(dp[i][0],dp[i-1][0]+val[i]);
            ans=max(ans,max(dp[i][0],dp[i][1]));
        }
        return ans;
    }
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2136 KB Output is correct
2 Correct 17 ms 2644 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 53 ms 7268 KB Output is correct
6 Correct 52 ms 7256 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 30 ms 7004 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '40604835820592'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 2140 KB Output is correct
3 Incorrect 11 ms 3372 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21049836049923'
4 Halted 0 ms 0 KB -

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: '0'
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: '0'
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: '0'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 2140 KB Output is correct
3 Incorrect 11 ms 3372 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21049836049923'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2136 KB Output is correct
2 Correct 17 ms 2644 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 53 ms 7268 KB Output is correct
6 Correct 52 ms 7256 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 30 ms 7004 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '40604835820592'
9 Halted 0 ms 0 KB -