Submission #1339662

#TimeUsernameProblemLanguageResultExecution timeMemory
1339662kawhietDistributing Candies (IOI21_candies)C++20
8 / 100
60 ms8924 KiB
#include <bits/stdc++.h>
#include "candies.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 = l.size();
    vector<long long> p(n + 1);
    for (int i = 0; i < q; i++) {
        p[l[i]] += v[i];
        p[r[i] + 1] -= v[i];
    }
    for (int i = 1; i <= n; i++) {
        p[i] += p[i - 1];
    }
    vector<int> s(n);
    for (int i = 0; i < n; i++) {
        if (p[i] > c[i]) {
            s[i] = c[i];
        } else {
            s[i] = p[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...