Submission #1241042

#TimeUsernameProblemLanguageResultExecution timeMemory
1241042kargneq나일강 (IOI24_nile)C++20
0 / 100
18 ms4164 KiB
#include <bits/stdc++.h> using namespace std; vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) { long long S = 0; int N = W.size(); vector<long long> C(N); for (int i = 0; i < N; i++) { S += B[i]; C[i] = A[i] - B[i]; } vector<long long> R(W.size(), 0); auto minc_pointer = min_element(C.begin(), C.end()); long long minC = *minc_pointer; int idx = distance(C.begin(), minc_pointer); for (int j = 0; j < E.size(); j++) { if (N % 2 == 0) { R[j] = S; } else { if (j == idx) R[j] = (S + minC); else R[j] = S; } } 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...