Submission #700190

#	Time	Username	Problem	Language	Result	Execution time	Memory
700190		n1k	메기 농장 (IOI22_fish)	C++17	9 / 100	45 ms	15276 KiB

fish

#include <bits/stdc++.h>

#define ll long long
#define vt vector
#define pb push_back
#define ar array
#define all(x) (x).begin(), (x).end()
#define sz(x) (x).size()

using namespace std;

/*
 1. simplify
 2. add new elements
 3. brute force solution
 4. optimize
*/

// --- templates ---

// --- code ---

ll max_weights(int n, int m, vt<int> X, vt<int> Y, vt<int> W){
	int h = 2;

	vt<vt<ll>> a(n, vt<ll>(h));
	for(int i = 0; i < m; i++){
		a[X[i]][1] = W[i];
	}

	auto f = [](auto l, auto i, auto j) -> ll {
		if(i < 0 || j < 0) return 0;
		return l[i][j];
	};

	auto get = [](auto l, auto i) -> ll {
		if(i < 0 || i >= l.size()) return 0;
		return l[i][1];
	};

	vt<vt<ll>> dp(n, vt<ll>(h));

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

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

Compilation message (stderr)

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:31:7: warning: variable 'f' set but not used [-Wunused-but-set-variable]
   31 |  auto f = [](auto l, auto i, auto j) -> ll {
      |       ^
fish.cpp:36:7: warning: variable 'get' set but not used [-Wunused-but-set-variable]
   36 |  auto get = [](auto l, auto i) -> ll {
      |       ^~~

• 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