제출 #1189860

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

fish

#include "fish.h"
#include <vector>

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define sz size()
const int N2 = 1e5+2;
 ll a[N2]={0}, b[N2], prea[N2], preb[N2];
 ll dp[N2][2];
 ll inf = 1e18;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {

    for(int i = 0; i < N; i++)
    {
        a[X[i]+1] = W[i];
    }
    dp[0][1] = -inf;
    dp[1][0] = 0;
    dp[1][1] = 0;
    for(int i = 2; i <= N; i++)
    {
        dp[i][1] = max( max(dp[i-2][0],dp[i-2][1])+a[i-1],dp[i-1][1]);
        dp[i][0] = max(dp[i-1][1]+a[i],dp[i-1][0]);
    }
    cout << max(dp[N][0], dp[N][1]) << endl;

  return 0;
}

• 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