제출 #1210451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1210451		PagodePaiva	나일강 (IOI24_nile)	C++20	23 / 100	2093 ms	6764 KiB

nile

#include "nile.h"
#include<bits/stdc++.h>
#define c custo

using namespace std;

const int N = 200010;
long long dp[N];
long long custo[N];
long long w[N];

vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A,
                                       std::vector<int> B, std::vector<int> E) {
    int n = W.size();
    long long sum = 0;
    vector <array <int, 3>> ordenar;
    for(int i = 0;i < n;i++){
        ordenar.push_back({W[i], A[i], B[i]});
    }
    sort(ordenar.begin(), ordenar.end());
    for(int i = 0;i < n;i++){
        w[i+1] = ordenar[i][0];
        sum += (long long) (ordenar[i][1]);
        custo[i+1] = ordenar[i][1] - ordenar[i][2];
    }
    vector <long long> resposta;
    for(auto d : E){
        long long mn = c[1], soma = c[1];
        int tam = 1;
        long long res = 0;
        for(int i = 2;i <= n;i++){
            if(w[i] - w[i-1] > d){
                res += soma - (tam%2 == 1 ? mn : 0);
                soma = c[i];
                mn = c[i];
                tam = 1;
            }
            else{
                soma += c[i];
                tam++;
                mn = min(mn, c[i]);
            }
        }
        res += soma - (tam%2 == 1 ? mn : 0);
        resposta.push_back(sum-res);
    }
    return resposta;
}

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