Submission #785079

#TimeUsernameProblemLanguageResultExecution timeMemory
785079vjudge1Catfish Farm (IOI22_fish)C++17
0 / 100
72 ms14692 KiB
#include<bits/stdc++.h>
using namespace std;

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	array<long long, 2> ans{0, 0};
	for(int i = 0; i < M; ++i) ans[X[i]] += W[i];
	return max(ans[0], ans[1]);
}
#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...