제출 #1289921

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289921		MMihalev	메기 농장 (IOI22_fish)	C++20	9 / 100	26 ms	10044 KiB

fish

#include<iostream>
#include<algorithm>
#include<vector>
#include "fish.h"
using namespace std;
const int MAX_N=1e5+5;
int n,m;
vector<int>x,y,w;
vector<pair<int,long long>>cells[MAX_N];//rows,weight
long long dp[MAX_N];
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W)
{
    n=N;
    m=M;
    x=X;
    y=Y;
    w=W;

    for(int i=0;i<m;i++)
    {
        cells[x[i]].push_back({y[i],w[i]});
    }
    for(int i=0;i<n;i++)
    {
        sort(cells[i].begin(),cells[i].end());
    }

    long long ans=0;

    for(int i=1;i<n;i++)
    {
        dp[i]=max((cells[i-1].size()>0 ? cells[i-1][0].second : 0),dp[i-1]);
        if(i-2>=0)
        {
            dp[i]=max(dp[i],dp[i-2]+(cells[i-1].size()>0 ? cells[i-1][0].second : 0));
        }
        if(i-3>=0)
        {
            dp[i]=max(dp[i],dp[i-3]+(cells[i-1].size()>0 ? cells[i-1][0].second : 0)+
                                    (cells[i-2].size()>0 ? cells[i-2][0].second : 0));
        }
    }

    ans=dp[n-1];
    ans=max(ans,dp[n-2]+(cells[n-1].size()>0 ? cells[n-1][0].second : 0));
    if(n>=3)ans=max(ans,dp[n-3]+(cells[n-2].size()>0 ? cells[n-2][0].second : 0));

    return ans;
}

• 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