# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784638 | borisAngelov | Snowball (JOI21_ho_t2) | 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>
using namespace std;
const int maxn = 200005;
const long long inf = 1e18;
int n, q;
long long a[maxn];
vector<pair<long long, int>> intervals;
long long ans[maxn];
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main()
{
fastIO();
cin >> n >> q;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
}
a[0] = -inf;
a[n + 1] = +inf;
for (int i = 1; i <= n + 1; ++i)
{
intervals.push_back(make_pair(a[i] - a[i - 1], i - 1));
}
sort(intervals.begin(), intervals.end());
long long l = 0
long long r = 0;
long long sum = 0;
int ptr = 0;
for (int i = 1; i <= q; ++i)
{
long long power;
cin >> power;
sum += power;
l = min(l, sum);
r = max(r, sum);
while (r - l >= intervals[ptr].first)
{
if (power > 0)
{
ans[intervals[ptr].second] += intervals[ptr].first + l;
ans[intervals[ptr].second + 1] -= l;
}
else
{
ans[intervals[ptr].second] += r;
ans[intervals[ptr].second + 1] += intervals[ptr].first - r;
}
++ptr;
}
}
while (ptr < intervals.size())
{
ans[intervals[ptr].second] += r;
ans[intervals[ptr].second + 1] -= l;
++ptr;
}
for (int i = 1; i <= n; ++i)
{
cout << ans[i] << "\n";
}
return 0;
}