제출 #1308015

#제출 시각아이디문제언어결과실행 시간메모리
1308015felirivera나일강 (IOI24_nile)C++20
0 / 100
18 ms3372 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; vector<ll> calculate_costs( vector<int> W, vector<int> A, vector<int> B, vector<int> E ){ vector<ll> ans(B.begin(), B.end()); if (W.size() % 2 != 0) { ll dif = LLONG_MAX; int idx = 0; for (int i = 0; i < (int)W.size(); i++) { if ((ll)A[i] - B[i] < dif) { dif = (ll)A[i] - B[i]; idx = i; } } ans[idx] = A[idx]; } return ans; }
#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...