제출 #1251420

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1251420		pirhosig	Catfish Farm (IOI22_fish)	C++20	0 / 100	14 ms	5696 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
#define  R(a) for (int i = 0; i < a; ++i)
#define RR(a) for (int j = 0; j < a; ++j)
using namespace std;
typedef long long ll;
typedef vector<int> vi;

// (idx, i - 1, i)
ll dp[100'005][2][2];

ll max_weights(int N, int M, vi X, vi Y, vi W) {
    vector<ll> val(N + 1);
    R(M) val[Y[i]] = W[i];

    dp[0][0][1] = dp[0][1][1] = val[1];
    for (int i = 1; i < N; ++i) {
        dp[i][0][0] = max(dp[i - 1][1][0], dp[i - 1][0][0]);
        dp[i][0][1] = max(dp[i - 1][1][0], dp[i - 1][0][0] + val[i - 1]) + val[i + 1];
        dp[i][1][0] = max(dp[i - 1][0][1], dp[i - 1][1][1]);
        dp[i][1][1] = max(dp[i - 1][0][1], dp[i - 1][1][1]) + val[i + 1];
    }

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

• 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