제출 #1278217

#제출 시각아이디문제언어결과실행 시간메모리
1278217GoBananas69Nile (IOI24_nile)C++20
0 / 100
64 ms4140 KiB
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
typedef long long ll;
using namespace std;

// subtask 1
vector<ll> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e) {
    ll q = e.size();
    ll n = w.size();

    vector<ll> ans(q);
    for (ll _ = 0; _ < q; ++_) {
        // {a[i], b[i]}
        vector<pair<ll, ll>> v(n);
        for (ll i = 0; i < n; ++i) v[i] = {a[i], b[i]};
        // for (auto &p : v) cout << p.first << ' ' << p.second << '\n';
        sort(v.begin(), v.end());
        ll res = 0;
        for (ll i = 1; i < n; i += 2) res += (v[i].second + v[i - 1].second);
        if (n & 1) res += v[0].first;
        ans[_] = res;
    }
    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...