# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
530357 | toilaai132 | Distributing Candies (IOI21_candies) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O2")
#include<bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define si (ll)(1e6 + 9)
#define mod (ll)(1e9 + 7)
#define multiTest unsigned ll numTest; for (cin >> numTest; numTest--;)
#define el cout << "\n"
using namespace std;
vector<int> distribute_candies(vector<int> C, vector<int> L, vector<int> R, vector<int> V) {
int N = C.size(), Q = V.size();
vector<int> s(N, 0);
for (int i = 0; i < Q; ++ i) for (int j = L[i]; j <= R[i]; ++ j) s[j] = max(0, min(C[j], s[j] + V[i]));
return s;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}