제출 #1245586

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1245586		alexaaa	나일강 (IOI24_nile)	C++20	0 / 100	2096 ms	3136 KiB

nile

#include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>
#include "nile.h"

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;
    vector<int> extra_cost;
    vector<int> ec_i(W.size());
    int sum = 0;
    for(int i = 0; W.size(); i++){
        sum += W[i];
    }
    iota(ec_i.begin(),ec_i.end(),0);
    
    for(int i = 0; i < W.size(); i++){
        extra_cost.push_back(A[i]-B[i]);
    }
    sort(ec_i.begin(),ec_i.end(),[&](int i, int j){
        if(extra_cost[i] == extra_cost[j]){
            return i<j;
        }
        else{
            return extra_cost[i] < extra_cost[j];
        }
    });
    for(int i = 0; i < E.size(); i++){
        int D = E[i];
        long long cost = 0;
        if(W.size()%2 == 0){
            for(int j = 0;j < W.size(); j++){
                cost+=B[j];
            }
            answer.push_back(cost);
        }
        else{
            int skip;
            if(sum == W.size()){
                skip = ec_i[0];
                for(int j = 0; j < W.size(); j++){
                    if(j == skip){
                        continue;
                    }
                    cost += B[j];
                }
                cost += A[skip];
                answer.push_back(cost);

            }
            else{
                if(D>= 2){
                    skip = ec_i[0];
                    for(int k = 0; k < W.size(); k++){
                        if(k == skip){
                            continue;
                        }
                        cost += B[k];
                    }
                    cost += A[skip];
                    answer.push_back(cost);
                    

                }
                else{
                    for(int e = 0; e < W.size();e++){
                        if(ec_i[e]%2 == 0){
                            skip = ec_i[e];
                            break;
                        }
                    }
                    
                    for(int l = 0; l < W.size(); l++){
                        if(l == skip){
                            continue;
                        }
                        cost += B[l];
                    }
                    cost += A[skip];
                    answer.push_back(cost);

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