| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1201512 | HappyCapybara | Distributing Candies (IOI21_candies) | C++17 | 47 ms | 7236 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 = l.size();
vector<int> res(n+1, 0);
for (int i=0; i<q; i++){
res[l[i]] += v[i];
res[r[i]+1] -= v[i];
}
for (int i=1; i<n; i++) res[i] += res[i-1];
for (int i=0; i<n; i++) res[i] = min(c[i], res[i]);
return res;
}| # | 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... | ||||
