# include<bits/stdc++.h>
#define in freopen ("measurement.in", "r", stdin);
#define out freopen("measurement.out", "w", stdout);
#define ll long long
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std ;
long long const N = 1e6 + 7;
long long N1 = 1e9 + 7;
double long k = 0;
int a[N], dp[N];
int main( ){
//in out
speed ;
ll TJK = 1 ;
// cin >> TJK ;
while( TJK -- ){
int n, m;
cin >> n >> m;
for ( int i = 1; i <= n; i++ ) {
cin >> a[i];
}
for ( int i = 2; i <= n; i++ ) {
int l = a[i - 1], r = a[i];
if ( l > r ) {
swap( l, r );
}
dp[l]++;
dp[r + 1]--;
}
for ( int i = 1; i < N; i++ ) {
dp[i] += dp[i - 1];
}
vector < pair < int, pair < int, int > > > vc;
int s2 = 1;
for ( int i = 1; i <= m; i++ ) {
int t;
cin >> t;
if ( t == 2 ) {
int h, cnt = 0;
cin >> h;
vc.push_back( { 2, { h, 0 } } );
}
else {
int pos, val;
cin >> pos >> val;
vc.push_back( { 1, { pos, val } } );
s2 = 0;
}
}
if ( s2 ) {
for ( int i = 0; i < m; i++ ) {
int h = vc[i].second.first;
cout << dp[h] << '\n';
}
return 0;
}
for ( int i = 0; i < m; i++ ) {
int t = vc[i].first;
if ( t == 2 ) {
int h = vc[i].second.first, cnt = 0;
for ( int i = 2; i <= n; i++ ) {
if ( (a[i - 1] < h && a[i] > h) || (a[i - 1] > h && a[i] < h) ) {
cnt++;
}
}
cout << cnt << '\n';
}
else {
int pos = vc[i].se.fi, val = vc[i].se.se;
a[pos] = val;
}
}
}
}
Compilation message
game.cpp: In function 'int main()':
game.cpp:45:24: warning: unused variable 'cnt' [-Wunused-variable]
45 | int h, cnt = 0;
| ^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4204 KB |
Output is correct |
2 |
Correct |
8 ms |
4332 KB |
Output is correct |
3 |
Correct |
9 ms |
4332 KB |
Output is correct |
4 |
Correct |
9 ms |
4332 KB |
Output is correct |
5 |
Correct |
7 ms |
4332 KB |
Output is correct |
6 |
Correct |
7 ms |
4332 KB |
Output is correct |
7 |
Correct |
5 ms |
4332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4204 KB |
Output is correct |
2 |
Correct |
8 ms |
4332 KB |
Output is correct |
3 |
Correct |
9 ms |
4332 KB |
Output is correct |
4 |
Correct |
9 ms |
4332 KB |
Output is correct |
5 |
Correct |
7 ms |
4332 KB |
Output is correct |
6 |
Correct |
7 ms |
4332 KB |
Output is correct |
7 |
Correct |
5 ms |
4332 KB |
Output is correct |
8 |
Correct |
43 ms |
7140 KB |
Output is correct |
9 |
Correct |
51 ms |
8160 KB |
Output is correct |
10 |
Correct |
54 ms |
8196 KB |
Output is correct |
11 |
Correct |
38 ms |
7032 KB |
Output is correct |
12 |
Correct |
61 ms |
7904 KB |
Output is correct |
13 |
Correct |
48 ms |
8032 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4204 KB |
Output is correct |
2 |
Correct |
8 ms |
4332 KB |
Output is correct |
3 |
Correct |
9 ms |
4332 KB |
Output is correct |
4 |
Correct |
9 ms |
4332 KB |
Output is correct |
5 |
Correct |
7 ms |
4332 KB |
Output is correct |
6 |
Correct |
7 ms |
4332 KB |
Output is correct |
7 |
Correct |
5 ms |
4332 KB |
Output is correct |
8 |
Correct |
43 ms |
7140 KB |
Output is correct |
9 |
Correct |
51 ms |
8160 KB |
Output is correct |
10 |
Correct |
54 ms |
8196 KB |
Output is correct |
11 |
Correct |
38 ms |
7032 KB |
Output is correct |
12 |
Correct |
61 ms |
7904 KB |
Output is correct |
13 |
Correct |
48 ms |
8032 KB |
Output is correct |
14 |
Execution timed out |
1046 ms |
8032 KB |
Time limit exceeded |
15 |
Halted |
0 ms |
0 KB |
- |