제출 #666462

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
666462		Banan	메기 농장 (IOI22_fish)	C++17	9 / 100	37 ms	10424 KiB

fish

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

using ll = long long;
#define double long double
#define endl '\n'
#define sz(a) (int)a.size()
#define pb push_back
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
ll const INF = LONG_LONG_MAX;


long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y, std::vector<int> w)
{
    vector<ll> val(n+3, 0);
    for(int i=0;i<m;i++)
        val[x[i]]=w[i];
    vector<vector<ll>> dp(n+3, vector<ll>(3, 0));
    dp[0][1]=val[1];
    for(int i=1;i<n;i++)
    {
        dp[i][0]=max(dp[i-1][0], dp[i-1][1]);
        dp[i][1]=val[i+1];
        if(i==1){dp[i][1]+=max(dp[i-1][0]+val[i-1], dp[i-1][1]-val[i]);}
        else
        {
            dp[i][1]+=max(dp[i-2][0]+val[i-1], max(dp[i-2][1], dp[i-1][1]-val[i]));
        }
    }

    return max(dp[n-1][0], dp[n-1][1]);
}

• 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