# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
756354 | 1075508020060209tc | Snowball (JOI21_ho_t2) | C++14 | 557 ms | 18468 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 int long long
int n;int Q;
int xar[200005];
int adar[200005];
int psad[200005];
int mnad[200005];
int mxad[200005];
int lans[200005];
int rans[200005];
signed main(){
cin>>n>>Q;
for(int i=1;i<=n;i++){
cin>>xar[i];
}
for(int i=1;i<=Q;i++){
cin>>adar[i];
psad[i]=adar[i]+psad[i-1];
mnad[i]=min(mnad[i-1],psad[i]);
mxad[i]=max(mxad[i-1],psad[i]);
}
lans[1]=xar[1]+mnad[Q];
rans[n]=xar[n]+mxad[Q];
for(int i=1;i<=n-1;i++){
int l=0;int r=Q;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |