| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1242318 | nibert | Distributing Candies (IOI21_candies) | C++20 | 5092 ms | 7240 KiB |
#include <vector>
#include <algorithm>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
int n = c.size(), q = r.size();
vector<int> prefix(n);
for (int i =0; i < q; i++){
int left = l[i], right = r[i], value = v[i];
if (v[i] > 0){
for(int idx = l[i]; idx <= r[i]; idx++){
prefix[idx] = min(c[idx], prefix[idx]+v[i]);
}
} else{
for(int idx = l[i]; idx <= r[i]; idx++){
prefix[idx] = max(0, prefix[idx]+v[i]);
}
}
}
return prefix;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
