oj.uz

Submission #724350

# Submission time Handle Problem Language Result Execution time Memory
724350 2023-04-15T06:11:14 Z nihaddhuseynli Catfish Farm (IOI22_fish) C++17
18 / 100
 94 ms 14304 KB 
#include "fish.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
typedef long long int ll;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    ll ans =0;
    ll a[300005];
    ll flag=0,flag1=0;
    for(int i =0;i<M;i++)
    {
        if(X[i]%2==1)
        {
            flag=1;
        }
        if(Y[i]!=0)
        {
            flag1=1;
        }
        a[X[i]]+=W[i];
    }
    if(flag==0)
    {
        ans=0;
        for(int i =0;i<M;i++)
        {
            ans+=W[i];
        }
    }
    else if(flag1==0)
    {
        ans=0;
        ll dp[300005][2];
        memset(dp,0,sizeof(dp));
        dp[1][0]=a[1];
        dp[1][1]=a[0];
        for(int i =2;i<N;i++)
        {
            dp[i][0]=max(dp[i-1][1]+a[i],dp[i-1][0]);
            dp[i][1]=max({dp[i-2][0]+a[i-1],dp[i-1][1],dp[i-2][1]+a[i-1]});
        }
        ans=max(dp[N-1][0],dp[N-1][1]);
    }
    else
    {
        ll b[300005][2];
        memset(b,0,sizeof(b));
        for(int i =0;i<M;i++)
        {
            b[Y[i]][X[i]]+=W[i];
        }
        for(int i =1;i<N;i++)
        {
            b[i][0]+=b[i-1][0];
            b[i][1]+=b[i-1][1];
        }
        ans=max(b[N-1][0],b[N-1][1]);
        if(N>2)
        {
            for(int i =0;i<N;i++)
            {
                ll cnt=b[N-1][1]-b[i][1];
                ans=max(ans,cnt+b[i][0]);
            }
        }
    }
    return ans;

}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 9172 KB Output is correct
2 Correct 30 ms 9660 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 94 ms 14304 KB Output is correct
6 Correct 93 ms 14304 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 53 ms 11032 KB Output is correct
3 Correct 61 ms 12000 KB Output is correct
4 Correct 25 ms 9172 KB Output is correct
5 Correct 32 ms 9656 KB Output is correct
6 Correct 4 ms 7252 KB Output is correct
7 Correct 4 ms 7252 KB Output is correct
8 Correct 4 ms 7252 KB Output is correct
9 Correct 6 ms 7344 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct
11 Correct 3 ms 7252 KB Output is correct
12 Correct 30 ms 9188 KB Output is correct
13 Correct 35 ms 9680 KB Output is correct
14 Correct 29 ms 9208 KB Output is correct
15 Correct 32 ms 9432 KB Output is correct
16 Correct 26 ms 9172 KB Output is correct
17 Correct 32 ms 9420 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7252 KB Output is correct
2 Correct 4 ms 7252 KB Output is correct
3 Correct 18 ms 8496 KB Output is correct
4 Correct 13 ms 8172 KB Output is correct
5 Correct 29 ms 9668 KB Output is correct
6 Correct 26 ms 9676 KB Output is correct
7 Correct 31 ms 9684 KB Output is correct
8 Correct 30 ms 9664 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 7252 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 4 ms 7252 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 4 ms 7252 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 3 ms 7252 KB Output is correct
2 Correct 4 ms 7252 KB Output is correct
3 Correct 18 ms 8496 KB Output is correct
4 Correct 13 ms 8172 KB Output is correct
5 Correct 29 ms 9668 KB Output is correct
6 Correct 26 ms 9676 KB Output is correct
7 Correct 31 ms 9684 KB Output is correct
8 Correct 30 ms 9664 KB Output is correct
9 Incorrect 28 ms 9668 KB 1st lines differ - on the 1st token, expected: '99999', found: '33334'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 9172 KB Output is correct
2 Correct 30 ms 9660 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 94 ms 14304 KB Output is correct
6 Correct 93 ms 14304 KB Output is correct
7 Correct 4 ms 7252 KB Output is correct
8 Correct 53 ms 11032 KB Output is correct
9 Correct 61 ms 12000 KB Output is correct
10 Correct 25 ms 9172 KB Output is correct
11 Correct 32 ms 9656 KB Output is correct
12 Correct 4 ms 7252 KB Output is correct
13 Correct 4 ms 7252 KB Output is correct
14 Correct 4 ms 7252 KB Output is correct
15 Correct 6 ms 7344 KB Output is correct
16 Correct 4 ms 7252 KB Output is correct
17 Correct 3 ms 7252 KB Output is correct
18 Correct 30 ms 9188 KB Output is correct
19 Correct 35 ms 9680 KB Output is correct
20 Correct 29 ms 9208 KB Output is correct
21 Correct 32 ms 9432 KB Output is correct
22 Correct 26 ms 9172 KB Output is correct
23 Correct 32 ms 9420 KB Output is correct
24 Correct 3 ms 7252 KB Output is correct
25 Correct 4 ms 7252 KB Output is correct
26 Correct 18 ms 8496 KB Output is correct
27 Correct 13 ms 8172 KB Output is correct
28 Correct 29 ms 9668 KB Output is correct
29 Correct 26 ms 9676 KB Output is correct
30 Correct 31 ms 9684 KB Output is correct
31 Correct 30 ms 9664 KB Output is correct
32 Incorrect 4 ms 7252 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
33 Halted 0 ms 0 KB -