제출 #701322

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
701322		n1k	Catfish Farm (IOI22_fish)	C++17	0 / 100	1057 ms	2097152 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;

/*
 ## TAKE IT EASY ##
 1. simplify
 2. add new elements
 3. brute force solution
 4. optimize
 5. start implementing
*/

// --- templates ---

// --- code ---

const int N = 300 + 5;

ll dp[N][2][N];

ll max_weights(int n, int m, vt<int> X, vt<int> Y, vt<int> W){
	memset(dp, 0, sizeof dp);

	int h = n + 5;

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


	for(int i = 0; i < n; i++){
		for(int flow = 0; flow < 2; flow++){
			for(int h1 = 0; h1 < h; h1++){
				for(int h2 = 0; h2 < (flow ? h : h1 + 1); h2++){

					int nflow = h1 <= h2;
					ll l = 0, r = a[i + 1][h2], sub = a[i][min(h1, h2)];
					if(i == 0){
						dp[i][nflow][h2] = max(dp[i][nflow][h2], r);
					}else{
						l = max((ll)0, a[i - 1][h2] - a[i - 1][h1]);
						dp[i][nflow][h2] = max(dp[i][nflow][h2], l + dp[i - 1][flow][h1] + r - sub);
					}
				}
			}
		}
	}

	ll ans = 0;

	for(int flow = 0; flow < 2; flow++){
		for(int h1 = 0; h1 < h; h1++){
			ans = max(ans, dp[n - 1][flow][h1]);
		}
	}

	return ans;
}

• 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