| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370079 | enzy | Distributing Candies (IOI21_candies) | C++20 | 45 ms | 9300 KiB |
#include "candies.h"
#include<bits/stdc++.h>
#define ll long long
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<ll>d(n+1);
for(int i=0;i<q;i++){
d[l[i]]+=v[i];
d[r[i]+1]-=v[i];
}
ll sum=0;
vector<int>resp;
for(int i=0;i<n;i++){
sum+=d[i];
ll at=min(sum,(ll)c[i]);
resp.push_back((int)(at));
}
return resp;
}
| # | 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... | ||||
