Submission #989828

#	Time	Username	Problem	Language	Result	Execution time	Memory
989828		cpdreamer	Catfish Farm (IOI22_fish)	C++17	0 / 100	16 ms	4944 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>
using namespace std;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    long long dp[N][2];
    sort(X.begin(),X.end());
    long long c;
    if(X[0]==0)
        c=W[0];
    else
        c=0;
    dp[0][0]=0;
    dp[0][1]=c;
    if(X[0]==1)
        c=W[0];
    else {
        if (X[1] == 1)
            c = W[1];
        else
            c = 0;
    }
    dp[1][1]=max(dp[0][1],c);
    dp[1][0]=max(dp[0][1],c);
    int index;
    if(X[0]==0 && X[1]==1)
        index=2;
    if(X[0]==0 && X[1]!=1)
        index=1;
    if(X[0]==1 )
        index=1;
    if(X[0]!=1 && X[0]!=0)
        index=0;
    for(int i=2;i<N;i++){
        if(i==X[index]) {
            c = W[index];
            index++;
        }
        else
            c=0;
        dp[i][1]=max(dp[i-1][1],dp[i-1][0]+c);
        dp[i][0]=max(dp[i-1][1],max(dp[i-2][0],dp[i-2][1]+c));
    }
    return dp[N-1][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