| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 532486 | scottchou | Snowball (JOI21_ho_t2) | C++17 | 1 ms | 460 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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long LL;
int const N = 2e5 + 5;
LL a[N];
vector<LL> line, ans;
LL sum[N];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n, q;
cin >> n >> q;
for(int i = 0; i < n; i++){
cin >> a[i];
if(i != 0){
line.push_back(a[i] - a[i - 1]);
}
}
sort(line.begin(), line.end());
line.resize(unique(line.begin(), line.end()) - line.begin());
ans.resize(line.size());
LL nowx = 0, w, left = 0, right = 0, idx = 0;
for(int i = 0; i < q; i++){
cin >> w;
nowx += w;
if(nowx < 0)
left = max(left, -nowx);
else
right = max(right, nowx);
while(idx < line.size() && left + right >= line[idx]){
if(w < 0){
ans[idx] = right;
}else{
ans[idx] = line[idx] - left;
}
idx++;
}
}
sum[0] += left;
sum[n - 1] += right;
for(int i = 1; i < n; i++){
LL len = a[i] - a[i - 1];
LL lef = ans[lower_bound(line.begin(), line.end(), len) - line.begin()];
sum[i - 1] += lef;
sum[i] += len - lef;
}
for(int i = 0; i < n; i++){
cout << sum[i] << '\n';
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
