Submission #751674

#	Time	Username	Problem	Language	Result	Execution time	Memory
751674		Halym2007	Catfish Farm (IOI22_fish)	C++17	0 / 100	25 ms	5580 KiB

fish

#include <bits/stdc++.h>
#define ff first
#define ss second
#define sz size()
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 300005;
ll a[102][102];
ll max_weights(int N, int M, vector <int> X, vector <int> Y, vector <int> W) {
	ll mx = 0;
	if (N > 2) {
		for (int i = 0; i < M; ++i) {
			a[X[i]][Y[i]] = W[i];
		}
		vector <ll> kl (N + 1, 0);
		for (int i = N - 1; i >= 0; i--) {
			kl[i] = max (kl[i + 1], a[1][i]);
		}
		for (int i = 1; i < N; ++i) {
			mx = max (mx, a[0][i] + kl[i + 1]);
			mx = max (mx, a[1][i]);
		}
		return (ll)mx;
	}
	for (int i = 0; i < M; ++i) {
		if (Y[i]) mx = max (mx, (ll)W[i]);
	}
	return (ll)mx;
}


// int main () {
// 	cout << max_weights (4, 4, {0, 0, 1, 1}, {0, 1, 2, 3}, {3, 2, 5, 7});
// }

• 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