Submission #1238577

#TimeUsernameProblemLanguageResultExecution timeMemory
1238577chinesegenius69420Catfish Farm (IOI22_fish)C++20
6 / 100
48 ms8008 KiB
#include <bits/stdc++.h>
#include "fish.h"

using namespace std;

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
    long long ans = 0, der = 0, izq = 0;
	vector<int> izquierda(N, 0), derecha(N, 0);
	for(int i = 0; i < M; i++){
		if(X[i] == 0){
			izquierda[Y[i]] = W[i];
			izq += W[i];
			continue;
		}
		derecha[Y[i]] = W[i];
		der += W[i];
	}
	if(N > 2){
		for(const int &x : derecha){
			ans += x;
		}
		long long aux = ans;
		for(int i = 0; i < N; i++){
			aux += izquierda[i];
			aux -= derecha[i];
			ans = max(aux, ans);
		}
		return ans;
	}
    return max(der, izq);
}
#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...