Submission #1020705

#TimeUsernameProblemLanguageResultExecution timeMemory
1020705Blistering_BarnaclesDistributing Candies (IOI21_candies)C++17
8 / 100
77 ms12892 KiB
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = c.size(), q = (int)l.size();
    vector<int> a(n);
    vector<int64_t> pref(n + 1);
    for(int i = 0; i < q; i++){
        pref[l[i]] += v[i];
        pref[r[i] + 1] -= v[i];
    }
    for(int i = 0; i < n; i++){
        pref[i + 1] += pref[i];
        a[i] = min(pref[i], (int64_t)c[i]);
    }
    return a;
}
#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...