Submission #1240995

#TimeUsernameProblemLanguageResultExecution timeMemory
1240995kargneqNile (IOI24_nile)C++20
0 / 100
18 ms2632 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) { vector<long long> R(E.size(), 0); if (W.size() % 2 == 0) { long long valu = 0; for (int i : B) valu += (long long)i; for (int i = 0; i < R.size(); i++) { R[i] = valu; } } else { int min_diff_idx = 0; int prev_diff_val = 0; for (int i = 0; i < W.size(); i++) { if (A[i] - B[i] < prev_diff_val) { min_diff_idx = i; prev_diff_val = A[i] - B[i]; } } long long la_val = 0; for (int i = 0; i < W.size(); i++) { if (i == min_diff_idx) la_val += (long long)A[i]; else la_val += (long long)B[i]; } for (int i = 0; i < R.size(); i++) { R[i] = la_val; } } 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...