Submission #1210654

#TimeUsernameProblemLanguageResultExecution timeMemory
1210654NicolaikrobCatfish Farm (IOI22_fish)C++17
6 / 100
50 ms8516 KiB
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W) {
	ll s = 0, s1 = 0;
	vector<vector<int>> G(2, vector<int> (n, 0));
	for(int i = 0; i < m; i++) {
		s += W[i];
		if(X[i]%2) {
			s1 += W[i];
			G[1][Y[i]] = W[i];
		}
		else {
			G[0][Y[i]] = W[i];
		}
	}
	if(n == 2) return max(s1, s-s1);
	ll ans = s1;
	for(int i = 0; i < n; i++) {
		s1 += G[0][i]-G[1][i];
		ans = max(ans, s1);
	}
	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...