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>
#define f0(i, n) for(int i(0); i < (n); i++)
#define f1(i, n) for(int i(1); i <= n; i++)
using namespace std;
typedef long long ll;
const int N = 100002;
int n, q, a[N];
void solve(){
int h; cin >> h;
int res = 0;
f1(i, n - 1){
if(a[i] < h && a[i + 1] > h) res++;
if(a[i] > h && a[i + 1] < h) res++;
}
cout << res << endl;
}
int main(){
ios_base::sync_with_stdio(0);
cin >> n >> q;
f1(i, n) cin >> a[i];
while(q--){
int type; cin >> type;
if(type==2) solve();
else{
int i, x; cin >> i >> x;
a[i] = x;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |