Submission #626784

#	Time	Username	Problem	Language	Result	Execution time	Memory
626784		moyindavid	Catfish Farm (IOI22_fish)	C++17	0 / 100	63 ms	8404 KiB

fish

#include "fish.h"

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

long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> w) {
    map<int,long long> W;
    for(int i=0;i<M;i++) W[X[i]]=w[i];
    long long dp[N+5]{0};
    dp[N-1]=W[N-1];
    dp[N-2] = max(W[N-1],W[N-2]);
    for(int i=N-3;i>=0;i--){
        long long a=-1,b=-1;
        if(i<N-3){a=W[i+1]+W[i+2]+dp[i+4];b=W[i+1]+dp[i+3];}
        dp[i]=max({dp[i+1],a,b,W[i]+dp[i+2]});
    }
    return dp[0];
}

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