Submission #1320261

#TimeUsernameProblemLanguageResultExecution timeMemory
1320261unknownNile (IOI24_nile)C++20
6 / 100
22 ms3348 KiB
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
	long long total = accumulate(B.begin(), B.end(), 0LL);
	int N = W.size();
	vector<long long> X(N);
	for (int i = 0; i < N; i++) {
		X[i] = A[i] - B[i];
	}
	if (N % 2 == 1) {
		total = total + *min_element(X.begin(), X.end());
	}
	int Q = E.size();
	vector<long long> R(Q, total);
	return R;
}
#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...