# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1042009 | PM1 | ZIGZAG (INOI20_zigzag) | C++17 | 2047 ms | 3652 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 fr first
#define sc second
#define ll long long
const int mxn=3e5+5,szz=(1<<20);
ll n,q,a[mxn];
int main(){
cin>>n>>q;
for(int i=1;i<=n;i++){
cin>>a[i];
}
while(q--){
int l,r,z;
char ty;
cin>>ty;
if(ty=='\\')
cin>>ty;
cin>>l>>r;
if(ty=='+'){
cin>>z;
for(int i=l;i<=r;i++)
a[i]+=z;
}
else if(ty=='?'){
ll ans=0,last,cnt=0;
for(int i=l;i<=r;i++){
if(cnt==0){
ans++;
cnt++;
}
else if(a[i-1]==a[i]){
cnt=1;
}
else if(cnt>1){
if(a[i-2]<=a[i-1] && a[i-1]>a[i]){
ans+=cnt+1;
cnt++;
}
else if(a[i-2]>=a[i-1] && a[i-1]<a[i]){
ans+=cnt+1;
cnt++;
}
else{
ans+=2;
cnt=2;
}
}
else{
ans+=2;
cnt++;
}
}
cout<<ans<<'\n';
}
else{
for(int i=l;i<=r;i++)
a[i]*=-1;
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |