oj.uz

Submission #1075527

# Submission time Handle Problem Language Result Execution time Memory
1075527 2024-08-26T07:23:04 Z Muhammad_Aneeq Catfish Farm (IOI22_fish) C++17
18 / 100
 57 ms 7384 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]={};
        long long val[N][2]={};
        for (int i=0;i<M;i++)
            val[Y[i]][X[i]]=W[i];
        sm[0]=val[0][1];
        for (int i=1;i<N;i++)
            sm[i]=sm[i-1]+val[i][1];
        long long ans=sm[N-1];
        long long x=0;
        for (int i=0;i<N;i++)
        {
            x+=val[i][0];
            if (N>2)
                ans=max(ans,x+sm[N-1]-sm[i]);
        }
        ans=max(ans,x);
        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;
        long long mx=0;
        for (int i=1;i<N;i++)
        {
            if (i>1)
                dp[i][0]=mx+val[i];
            if (i<N-1)
                dp[i][1]=max(dp[i][0],dp[i-1][0]+val[i]);
            mx=max(mx,max(dp[i-1][0],dp[i-1][1]));
            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 14 ms 2140 KB Output is correct
2 Correct 16 ms 2640 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 57 ms 7252 KB Output is correct
6 Correct 54 ms 7252 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 29 ms 6180 KB Output is correct
3 Correct 36 ms 7384 KB Output is correct
4 Correct 13 ms 2136 KB Output is correct
5 Correct 16 ms 2636 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 15 ms 4464 KB Output is correct
13 Correct 18 ms 4956 KB Output is correct
14 Correct 15 ms 4440 KB Output is correct
15 Correct 23 ms 4652 KB Output is correct
16 Correct 15 ms 4444 KB Output is correct
17 Correct 17 ms 4816 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 2140 KB Output is correct
3 Correct 10 ms 3372 KB Output is correct
4 Correct 7 ms 3160 KB Output is correct
5 Correct 18 ms 4700 KB Output is correct
6 Correct 19 ms 4700 KB Output is correct
7 Correct 19 ms 4696 KB Output is correct
8 Correct 17 ms 4700 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: '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 1 ms 2140 KB Output is correct
3 Correct 10 ms 3372 KB Output is correct
4 Correct 7 ms 3160 KB Output is correct
5 Correct 18 ms 4700 KB Output is correct
6 Correct 19 ms 4700 KB Output is correct
7 Correct 19 ms 4696 KB Output is correct
8 Correct 17 ms 4700 KB Output is correct
9 Incorrect 16 ms 2652 KB 1st lines differ - on the 1st token, expected: '99999', found: '0'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2140 KB Output is correct
2 Correct 16 ms 2640 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 57 ms 7252 KB Output is correct
6 Correct 54 ms 7252 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 29 ms 6180 KB Output is correct
9 Correct 36 ms 7384 KB Output is correct
10 Correct 13 ms 2136 KB Output is correct
11 Correct 16 ms 2636 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 15 ms 4464 KB Output is correct
19 Correct 18 ms 4956 KB Output is correct
20 Correct 15 ms 4440 KB Output is correct
21 Correct 23 ms 4652 KB Output is correct
22 Correct 15 ms 4444 KB Output is correct
23 Correct 17 ms 4816 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 2140 KB Output is correct
26 Correct 10 ms 3372 KB Output is correct
27 Correct 7 ms 3160 KB Output is correct
28 Correct 18 ms 4700 KB Output is correct
29 Correct 19 ms 4700 KB Output is correct
30 Correct 19 ms 4696 KB Output is correct
31 Correct 17 ms 4700 KB Output is correct
32 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
33 Halted 0 ms 0 KB -