Submission #657542

#	Time	Username	Problem	Language	Result	Execution time	Memory
657542		coding_snorlax	Catfish Farm (IOI22_fish)	C++17	9 / 100	31 ms	4044 KiB

fish

#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
long long int max_weights(int N,int M,vector<int> x,vector<int> y,vector<int> w){
    long long int dp[4]={0,0,0,0};
    long long int tmp[4];
    int Graph[N]={0};
    for(int i=0;i<M;i++){
        Graph[x[i]]=w[i];
    }
    dp[2]=Graph[0];
    for(int i=1;i<N-1;i++){
        tmp[0]=max(dp[0],dp[2]);
        tmp[1]=max(dp[0],dp[2]);
        tmp[2]=max(dp[1],dp[3])+Graph[i];
        tmp[3]=max(dp[1]+Graph[i],dp[3]);
        dp[0]=tmp[0];
        dp[1]=tmp[1];
        dp[2]=tmp[2];
        dp[3]=tmp[3];
        //cout<<dp[0]<<" "<<dp[1]<<" "<<dp[2]<<" "<<dp[3]<<endl;
    }
    dp[1]+=Graph[N-1];
    return max(max(dp[0],dp[1]),max(dp[2],dp[3]));
}

• Subtask 1: 0 / 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