Submission #1222431

#TimeUsernameProblemLanguageResultExecution timeMemory
1222431chinesegenius69420나일강 (IOI24_nile)C++20
0 / 100
18 ms2628 KiB
#include "nile.h" #include <bits/stdc++.h> typedef long long ll; using namespace std; vector<ll> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e) { int n = w.size(); ll sumb = accumulate(b.begin(), b.end(), 0); if(n % 2){ ll minans = 1e17; for(int i = 0; i < n; i++){ minans = min(minans, sumb - b[i] + a[i]); } vector<ll> ans(e.size(), minans); return ans; } return vector<ll>(e.size(), sumb); }
#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...