제출 #441780

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
441780		baluteshih	사탕 분배 (IOI21_candies)	C++17	0 / 100	127 ms	7348 KiB

candies

#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = c.size();
    vector<int> rt(n + 1, 0);
    for (int i = 0; i < SZ(l); ++i)
        rt[l[i]] += v[i], rt[r[i] + 1] -= v[i];
    rt.pop_back();
    for (int i = 1; i < n; ++i)
        rt[i] += rt[i - 1];
    for (int i = 0; i < n; ++i)
        rt[i] = min(rt[i], c[i]);
    return rt;
}

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