Submission #1367289

#TimeUsernameProblemLanguageResultExecution timeMemory
1367289psigurdNile (IOI24_nile)C++17
6 / 100
14 ms2608 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;
    int n = w.size();
    ll SUM = 0;
    for (auto &p : b){
        SUM += p;
    }

    if (n % 2 == 1){
        ll MIN = 1000000000000000000;
        for (int i = 0; i < n; i++){
            ll diff = a[i] - b[i];
            MIN = min(MIN, diff);
        }
        SUM += MIN;
    }

    for (int i = 0; i < (int)e.size(); i++){
        ans.push_back(SUM);
    }
    return ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...