제출 #441424

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
441424		SorahISA	사탕 분배 (IOI21_candies)	C++17	3 / 100	5080 ms	7876 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<int> s(N, 0);
    for (int i = 0; i < Q; ++i) {
        for (int j = L[i]; j <= R[i]; ++j) s[j] = max(0, min(C[j], s[j] + V[i]));
    }
    return s;
}

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