Submission #838760

#	Time	Username	Problem	Language	Result	Execution time	Memory
838760		ErJ	Distributing Candies (IOI21_candies)	C++17	0 / 100	88 ms	8176 KiB

candies

#include <vector>
#include <cmath>
#include <algorithm>
#include <iostream>

using namespace std;
typedef long long ll;

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

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