제출 #609536

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

candies

#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli long long int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "

#define MAX 200000
#define LIM 1000000001

lli n,q;
int a;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) {

    n = c.size();
    q = r.size();
    vector<int> arr;
    vector<lli> acu;
    arr.resize(n,0);
    acu.resize(n+2,0);

    rep(i,0,q-1) {
        acu[l[i]] += v[i];
        acu[r[i]+1] -= v[i];
    }
    lli sum = 0;
    rep(i,0,n-1) {
        sum += acu[i];
        if (sum > LIM) a = LIM;
        else a = sum;
        arr[i] = min(a,c[i]);
    }

    return arr;
}

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