Submission #1055815

#	Time	Username	Problem	Language	Result	Execution time	Memory
1055815		pawned	메기 농장 (IOI22_fish)	C++17	3 / 100	48 ms	15700 KiB

fish

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

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

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;

#include "fish.h"

ll max_weights(int N, int M, vector<int> X_g, vector<int> Y_g, vector<int> W_g) {
	vi a(N);
	for (int i = 0; i < M; i++) {
		a[X_g[i]] += W_g[i];
	}
/*	cout<<"a: ";
	for (ll x : a)
		cout<<x<<" ";
	cout<<endl;*/
	vi dp(N + 1, 0);
	// dp[i]: max sum till i, exclusive
	for (int i = 1; i <= N; i++) {
		dp[i] = dp[i - 1];
		if (i >= 2)
			dp[i] = max(dp[i], dp[i - 2] + a[i - 2]);
		if (i >= 3)
			dp[i] = max(dp[i], dp[i - 3] + a[i - 3] + a[i - 1]);
	}
	return dp[N];
}

// subtasks 1, 2: greedy
// subtask 3: dp

// code subtask 3 first to verify correct dp

• Subtask 1: 3 / 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