Submission #1243036

#	Time	Username	Problem	Language	Result	Execution time	Memory
1243036		alexaaa	Nile (IOI24_nile)	C++20	0 / 100	18 ms	2632 KiB

nile

#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;


std::vector<long long> calculate_costs(
std::vector<int> W, std::vector<int> A,
std::vector<int> B, std::vector<int> E){
    vector<long long> answer;
    long long total = 0;
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<>> queue;

    if(W.size()%2 == 0){
        for(int i = 0;i < W.size(); i++){
            total += B[i];
        }

    }
    else{
        auto s = min_element(A.begin(),A.end());
        int min = *s;
        for(int i = 0;i < W.size(); i++){
            if(A[i] != min){
                total += B[i];
            }
            else{
                queue.push({B[i],i});
            }

            
        }
        if(!queue.empty()){
            while(queue.size() > 1){
                int cost = queue.top().first;
                queue.pop();
                total += cost;
            }
            int index = queue.top().second;
            queue.pop();
            total += A[index];
        }

    }
    answer.assign(E.size(),total);
    return answer;


}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 0 / 13
• Subtask 3: 0 / 17
• Subtask 4: 0 / 11
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15
• Subtask 7: 0 / 18