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 <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <bitset>
#include <vector>
typedef long long llong;
const int MAXN = 100000 + 10;
int n, q;
int a[MAXN];
void solve()
{
for (int i = 1 ; i <= n ; ++i)
{
int qType, pos, val;
std::cin >> qType;
if (qType == 1)
{
std::cin >> pos >> a[pos];
continue;
}
int count = 0;
std::cin >> val;
for (int j = 2 ; j <= n ; ++j)
{
if ((a[j] >= val) ^ (a[j - 1] >= val))
{
count++;
}
}
std::cout << count << '\n';
}
}
void input()
{
std::cin >> n >> q;
for (int i = 1 ; i <= n ; ++i)
{
std::cin >> a[i];
}
}
void fastIOI()
{
std::ios_base :: sync_with_stdio(0);
std::cout.tie(nullptr);
std::cin.tie(nullptr);
}
int main()
{
fastIOI();
input();
solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |