Submission #1227864

#TimeUsernameProblemLanguageResultExecution timeMemory
1227864racsosabeNile (IOI24_nile)C++20
0 / 100
17 ms2632 KiB
#include<bits/stdc++.h> #include "nile.h" using namespace::std; std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A, std::vector<int> B, std::vector<int> E) { // Subtask 1 const int n = W.size(); long long res = accumulate(B.begin(), B.end(), 0LL); if(n & 1) { int min_add = INT_MAX; for(int i = 0; i < n; i++) { min_add = min(min_add, A[i] - B[i]); } } const int q = E.size(); return vector<long long>(q, res); }
#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...