Submission #866553

#TimeUsernameProblemLanguageResultExecution timeMemory
866553vjudge1Catfish Farm (IOI22_fish)C++17
3 / 100
1070 ms26772 KiB
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long// !
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define F first
#define S second
const int MAXN = 1e5 + 3;

ll max_weights(int n, int m, vector<int> X, std::vector<int> Y, vector<int> W) {
	// dp[i][j], for i'th column just before the j'th element
	vector<pair<int, int>> pos[n+1];
	for (int i = 0; i < m; i++){
		pos[X[i]+1].push_back({Y[i], W[i]});
	}
	vector<vector<ll>> dp(n+1);
	for (int i = 0; i <= n; i++){
		pos[i].push_back({MAXN, 0});
		sort(all(pos[i]));
		dp[i].resize(sz(pos[i]), 0ll);
	}
	for (int i = 1; i <= n; i++){
		for (int j = 0; j < sz(dp[i]); j++){
			ll& me = dp[i][j];
			ll cnt = 0;
			for (int k = sz(dp[i - 1]) - 1; k >= 0; k--){
				if (pos[i-1][k].F <= pos[i][j].F-1) cnt += pos[i-1][k].S;
				me = max(me, cnt + dp[i-1][k]);
			}
		}
	}
	ll ans = 0;
	for (auto it : dp[n]){
		ans = max(ans, it);
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...