Submission #1325243

#	Time	Username	Problem	Language	Result	Execution time	Memory
1325243		eri16	Catfish Farm (IOI22_fish)	C++20	12 / 100	48 ms	7248 KiB

fish

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
    bool evn=true;
    bool lwr=true;
    ll sm1=0;
    ll sm2=0;
    
    for (int i=0; i<M; i++){
        if (X[i]%2){evn=false;sm1+=W[i];}
        else{sm2+=W[i];}
        if (X[i]>1){lwr=false;}
    }
    
    if (evn){return (sm1+sm2);}
    if (lwr){return max(sm1,sm2);}
    
    vector <int> w(N,0);
    
    for (int i=0; i<M; i++){w[X[i]]=W[i];}
    
    ll dp[N][2];
    
    dp[0][0]=0;
    dp[0][1]=0;
    dp[1][0]=w[1];
    dp[1][1]=w[0];
    
    for (int i=2; i<N; i++){
        dp[i][0]=max(dp[i-1][0],dp[i-1][1]+w[i]);
        
        dp[i][1]=max({dp[i-1][0],dp[i-1][1],dp[i-2][0]+w[i-1]});
    }
    
    return max(dp[N-1][0],dp[N-1][1]);
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 6
• Subtask 3: 9 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16