#include <bits/stdc++.h>
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define x first
#define y second
#define nl "\n"
using namespace std;
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair <int, int> pii;
const int N = (int)1e6 + 7;
const int M = (int)5e6 + 7;
const ll MOD = (ll)1e9 + 7;
const int inf = (int)1e9 + 7;
const ll INF = (ll)3e18 + 7;
pii dir[] = {{-1, -1}, {1, 1}, {-1, 1}, {1, -1}};
int n, q, y[N];
bool cmp(pii l, pii r) {
return l.y < r.y;
}
void solve() {
cin >> n >> q;
vector<pii> e;
for(int i = 1; i <= n; ++i)
cin >> y[i];
for(int i = 1; i < n; ++i) {
if(y[i] <= y[i+1]) e.pb({y[i], y[i+1]});
else e.pb({y[i+1], y[i]});
}
sort(all(e), cmp);
while(q--) {
char tp;
cin >> tp;
int c, d;
if(tp == '1') {
cin >> c >> d;
y[c] = d;
} else {
cin >> d;
pii o = {-inf, d};
int p = lower_bound(all(e), o) - e.begin();
cout << sz(e) - p << nl;
}
}
}
signed main() {
ios_base::sync_with_stdio(NULL);
cin.tie(0);
cout.tie(0);
int test = 1;
//cin >> test;
for(int i = 1; i <= test; ++i) {
//cout << "Case " << i << ": ";
solve();
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
