# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883512 | nguyentunglam | 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.
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
#define int long long
using namespace std;
const int N = 1e5 + 10;
vector<int> event[N];
vector<long long> distribute_candies (vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
vector<long long> p;
int n = c.size();
for(int i = 0; i < n; i++) {
event[i].push_back(1e9);
event[i].push_back(-1e9);
}
for(int i = 0; i < v.size(); i++)
{
for(int j = l[i]; j <= r[i]; j++)
{
event[j].push_back(v[i]);
}
}
for(int i = 0; i < n; i++)
{
long long sum = 0, border = 0;
vector<long long> pref;
for(int &j : event[i]) {
sum += j;
pref.push_back(sum);
}
long long mx = -1e18, mn = 1e18;
for(int j = pref.size() - 1; j >= 0; j--)
{
if (pref[j] < mn && mx - pref[j] > c[i]) {
border = mx - c[i];
break;
}
if (pref[j] > mx && pref[j] - mn > c[i]) {
border = mn;
break;
}
mn = min(mn, pref[j]);
mx = max(mx, pref[j]);
}
p.push_back(sum - border);
}
return p;
}
#ifdef ngu
int32_t main() {
freopen ("task.inp", "r", stdin);
freopen ("task.out", "w", stdout);
int n, q; cin >> n >> q;
vector<int> c(n), l(q), r(q), v(q);
for(int i = 0; i < n; i++) cin >> c[i];
for(int i = 0; i < q; i++) cin >> l[i] >> r[i] >> v[i];
vector<long long> ans = distribute_candies(c, l, r, v);
for(long long &j : ans) cout << j << " ";
}
#endif // ngu