제출 #441429

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
441429		SorahISA	사탕 분배 (IOI21_candies)	C++17	8 / 100	125 ms	8888 KiB

candies

#include "candies.h"
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

// #define int long long
// #define double long double
using pii = pair<int, int>;
template<typename T>
using Prior = std::priority_queue<T>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define eb emplace_back
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)

namespace {

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

} /// end of namespace

vector<int> distribute_candies(vector<int> C, vector<int> L, vector<int> R, vector<int> V) {
    int N = C.size(), Q = V.size();
    
    vector<int64_t> s(N+1, 0);
    for (int i = 0; i < Q; ++i) s[L[i]] += V[i], s[R[i]+1] -= V[i];
    partial_sum(ALL(s), begin(s));
    s.resize(N);
    for (int i = 0; i < N; ++i) s[i] = min(s[i], (int64_t)C[i]);
    return vector<int>(ALL(s));
}

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