oj.uz

Submission #723834

# Submission time Handle Problem Language Result Execution time Memory
723834 2023-04-14T10:51:43 Z vjudge1 Catfish Farm (IOI22_fish) C++17
12 / 100
 82 ms 9580 KB 
//#include "fish.h"
#include<bits/stdc++.h>
#define ll long long

#include <vector>

ll mx(ll a,ll b){
    if(a>b) return a;
    return b;
}

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    ll dp[N][2],a[N];
    ll sum=0,say=0,sum0=0,sum1=0,say1=0;
    for(int i=0;i<N;i++){
        dp[i][0]=dp[i][1]=a[i]=0;
    }
    for(int i=0;i<M;i++){
        a[X[i]]=1ll*W[i];
        if(X[i]%2==1){
            say=1;
        }
        if(X[i]>1){
            say1=1;
        }
        if(X[i]==0){
            sum0+=W[i];
        }
        else{
            sum1+=W[i];
        }
        sum+=W[i];
    }
    dp[0][1]=a[0];
    dp[1][0]=a[0];
    dp[1][1]=a[1];
    ll ans=mx(a[0],a[1]);
    for(int i=2;i<N;i++){
        if(i>2){
            dp[i][0]=mx(dp[i-3][0]+a[i-1]+a[i-2],mx(dp[i-1][1],dp[i-1][0]));
        }
        else{
            dp[i][0]=dp[i-1][1];
        }
        dp[i][1]=dp[i-1][0]+a[i];

    }
    ans=mx(dp[N-1][1],dp[N-1][0]);
    if(say==0){
        ans=sum;
    }
    else if(say1==0){
        ans=mx(sum0,sum1);
    }
    return ans;
}
/*
9 9
0 0 1
1 0 4
2 0 5
3 0 2
4 0 1
5 0 5
6 0 3
7 0 2
8 0 1
*/

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4172 KB Output is correct
2 Correct 28 ms 4940 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 80 ms 9580 KB Output is correct
6 Correct 82 ms 9568 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 17 ms 3628 KB Output is correct
4 Correct 11 ms 3448 KB Output is correct
5 Correct 27 ms 4928 KB Output is correct
6 Correct 23 ms 4936 KB Output is correct
7 Correct 27 ms 4932 KB Output is correct
8 Correct 27 ms 4944 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 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 0 ms 212 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 0 ms 212 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 2 ms 2644 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 17 ms 3628 KB Output is correct
4 Correct 11 ms 3448 KB Output is correct
5 Correct 27 ms 4928 KB Output is correct
6 Correct 23 ms 4936 KB Output is correct
7 Correct 27 ms 4932 KB Output is correct
8 Correct 27 ms 4944 KB Output is correct
9 Incorrect 25 ms 4928 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 24 ms 4172 KB Output is correct
2 Correct 28 ms 4940 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 80 ms 9580 KB Output is correct
6 Correct 82 ms 9568 KB Output is correct
7 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
8 Halted 0 ms 0 KB -