# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531543 | amunduzbaev | Snowball (JOI21_ho_t2) | C++17 | 120 ms | 16912 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;
#define ar array
#define int long long
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
int n, q; cin>>n>>q;
vector<int> x(n), p(q), is(q);
for(int i=0;i<n;i++) cin>>x[i];
for(int i=0;i<q;i++){
cin>>p[i];
is[i] = (p[i] > 0);
if(i) p[i] += p[i-1];
}
vector<int> mn(q, 0), mx(q, 0);
for(int i=0;i<q;i++){
if(i) mn[i] = mn[i-1], mx[i] = mx[i-1];
mn[i] = min(mn[i], p[i]);
mx[i] = max(mx[i], p[i]);
}
vector<int> res(n);
for(int i=1;i<n;i++){
int l = 0, r = q;
auto check = [&](int t){
return (x[i-1] + mx[t] <= x[i] + mn[t]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |