제출 #1220681

#제출 시각아이디문제언어결과실행 시간메모리
1220681cjoaNile (IOI24_nile)C++20
0 / 100
17 ms3140 KiB
#include "nile.h" #include <vector> #include <algorithm> 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: W[i] = 1 const int N = W.size(); long long base_cost = 0; for (int i = 0; i < N; i++) base_cost += B[i]; const int Q = (int)E.size(); int min_extra_cost = 0; if (N % 2 != 0) { vector<int> extra_cost(N); for (int i = 0; i < N; ++i) extra_cost[i] = A[i] - B[i]; min_extra_cost = *min_element(extra_cost.begin(), extra_cost.end()); } std::vector<long long> R(Q, 0); for (int j = 0; j < Q; ++j) R[j] = base_cost - min_extra_cost; 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...