제출 #1234705

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1234705		Muhammad_Aneeq	Catfish Farm (IOI22_fish)	C++17	0 / 100	13 ms	3656 KiB

fish

#include "fish.h"
#include <vector>
#include <iostream>
using namespace std;
int const N=1e5+10;
long long dp[N][2]={},val[N]={};
// 0 if we are updating it from behind 1 if being updated from
long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> W) 
{
    long long mx=0;
    for (int i=0;i<M;i++)
        val[X[i]]=W[i];
    long long ans=0;
    for (int i=0;i<N;i++)
    {
        if (i>0)
            dp[i][0]=mx+val[i];
        if (i+1<N)
        {
            dp[i][1]=mx;
            if (i>0)
                dp[i][1]=max(dp[i-1][0],dp[i][1]);
            dp[i][1]+=val[i];
        }
        if (i>1)
            mx=max(mx,max(dp[i-1][1],dp[i-1][0]));
        ans=max(ans,max(dp[i][0],dp[i][1]));
    }
    return ans;
}

• 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