제출 #1169740

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

fish

#include "fish.h"
#include<bits/stdc++.h>
#define int long long
#define vi vector<int>
#define pb push_back
#define f0r(i,n) for(int i = 0; i<n; i++)
#define FOR(i, k, n) for(int i = k; i<n; i++)
#define vout(v) for(auto u : v)cout<<u<<' '; cout<<'\n';

using namespace std;

int max_weights(signed n, signed m, std::vector<signed> x, std::vector<signed> y,
                      std::vector<signed> w) {
	int ans = 0;
	vi v(n);
	f0r(i,m){
		v[x[i]] = w[i];
	}
	// vout(v);
	vector<vector<vi>> dp(n, vector<vi>(2, vi(2)));
	dp[1][0][1] = v[0];
	dp[1][1][0] = v[1];
	FOR(i, 2, n){
		dp[i][0][0] = max(dp[i-1][0][0], dp[i-1][1][0]);
		dp[i][0][1] = max(dp[i-1][0][0] + v[i-1], dp[i-1][1][0]);
		dp[i][1][0] = max(dp[i-1][0][1], dp[i-1][1][1]) + v[i];
		dp[i][1][1] = max(dp[i-1][0][1], dp[i-1][1][1]);
	}
	f0r(i, 2)f0r(j,2)ans = max(ans, dp[n-1][i][j]);
	return ans;
}

• 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