| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370078 | enzy | Distributing Candies (IOI21_candies) | C++20 | 5093 ms | 7336 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>val(n);
for(int i=0;i<q;i++){
for(int j=l[i];j<=r[i];j++){
if(v[i]<0) val[j]=max(0,val[j]+v[i]);
else val[j]=min(c[j],val[j]+v[i]);
}
}
return val;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
