제출 #1243605

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1243605		Arturgo	사탕 분배 (IOI21_candies)	C++20	0 / 100	5089 ms	8768 KiB

candies

#include "candies.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> distribute_candies(vector<int> bornes, vector<int> debs, vector<int> fins, vector<int> ajouts) {
    vector<int> final(bornes.size(), -1);

    for(int pos = 0;pos < (int)bornes.size();pos++) {
        vector<long long> cumul = {0};

        for(int iOperation = 0;iOperation < (int)ajouts.size();iOperation++) {
            if(debs[iOperation] <= pos && pos <= fins[iOperation]) {
                cumul.push_back(cumul.back() + ajouts[iOperation]);
            }
        }

        auto itMax = max_element(cumul.begin(), cumul.end());
        auto itMinAvant = min_element(cumul.begin(), itMax + 1);
        auto itMinApres = min_element(itMax, cumul.end());

        long long valMax = *itMax - *itMinAvant;
        long long valMin = *itMinApres - *itMinAvant;
        long long total = cumul.back() - *itMinAvant;
        long long delta = max(0ll, valMax - bornes[pos]);
        
        if(valMin - delta >= 0) {
            final[pos] = cumul.back() - delta;
        } else {
            final[pos] = min<long long>(bornes[pos], total - valMin);
        }
        
    }

    return final;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 8
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33