Submission #958522

#TimeUsernameProblemLanguageResultExecution timeMemory
958522horiseunCatfish Farm (IOI22_fish)C++17
0 / 100
107 ms7252 KiB
#include <iostream>
#include <vector>
#include <algorithm>
#include "fish.h"
using namespace std;

#define ll long long

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	ll ans0 = 0, ans1 = 0;
	for (int i = 0; i < M; i++) {
		if (X[i]) ans1 += W[i];
		else ans0 += W[i];
	}
	return max(ans0, ans1);
}
#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...