# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1166930 | PagodePaiva | Distributing Candies (IOI21_candies) | C++20 | 5093 ms | 9800 KiB |
#include "candies.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 200010;
long long pref[N][2];
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v){
int n = c.size(), q = l.size();
for(int i = 0;i < q;i++){
for(int j = l[i];j <= r[i];j++){
pref[j][0] += v[i];
pref[j][0] = min(pref[j][0], (long long) c[j]);
pref[j][0] = max(pref[j][0], 0LL);
}
}
vector <int> s;
for(int i = 0;i < n;i++)
s.push_back(pref[i][0]);
return s;
}
# | 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... |