제출 #1304209

#제출 시각아이디문제언어결과실행 시간메모리
1304209TroySer나일강 (IOI24_nile)C++20
6 / 100
19 ms2612 KiB
#include "nile.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll INF = 1e18;

vector<ll> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {

    ll Q = (ll)E.size();
    ll N = (ll)A.size();

    ll aMin = INF;
    ll aMinInd = -1;
    ll bSum = 0;

    for (ll i = 0; i < N; i++) {
        if (A[i] - B[i] < aMin) {
            aMin = A[i] - B[i];
            aMinInd = i;
        }
        bSum += B[i];
    }

    vector<ll> R;
    if (N % 2) R.assign(Q, bSum + aMin);
    else R.assign(Q, bSum);

    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...