Submission #1021454

#TimeUsernameProblemLanguageResultExecution timeMemory
1021454WaelDistributing Candies (IOI21_candies)C++17
8 / 100
76 ms13392 KiB
#include "candies.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
using i64 = long long;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = c.size();
    int q = v.size();

    vector<i64> pref(n);
    for (int j = 0; j < q; ++j) {
        pref[l[j]] += v[j];
        if (r[j] + 1 < n) {
            pref[r[j] + 1] -= v[j];
        }
    }

    vector<int> s(n);
    for (int i = 0; i < n; ++i) {
        if (i) {
            pref[i] += pref[i - 1];
        }
        s[i] = min((i64)c[i], pref[i]);
    }

    return s;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...