# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94283 | Kastanda | Simple game (IZhO17_game) | C++11 | 106 ms | 10872 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;
const int N = 1e5 + 10, MXN = 1e6 + 9;
int n, q, A[N], L[MXN], G[MXN];
inline void AddL(int i, int val)
{
for (i ++; i < MXN; i += i & -i)
L[i] += val;
}
inline int GetL(int i)
{
int ret = 0;
for (i ++; i; i -= i & -i)
ret += L[i];
return (ret);
}
inline void AddG(int i, int val)
{
for (i = MXN - i - 1; i < MXN; i += i & -i)
G[i] += val;
}
inline int GetG(int i)
{
int ret = 0;
for (i = MXN - i - 1; i; i -= i & - i)
ret += G[i];
return (ret);
}
int main()
{
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (int i = 1; i < n; i++)
{
AddL(max(A[i], A[i + 1]), 1);
AddG(min(A[i], A[i + 1]), 1);
}
for (; q; q --)
{
int t, a, b;
scanf("%d%d", &t, &a);
if (t == 2)
{
printf("%d\n", n - 1 - (GetL(a - 1) + GetG(a + 1)));
continue;
}
scanf("%d", &b);
if (a > 1)
{
AddL(max(A[a], A[a - 1]), -1);
AddG(min(A[a], A[a - 1]), -1);
}
if (a < n)
{
AddL(max(A[a], A[a + 1]), -1);
AddG(min(A[a], A[a + 1]), -1);
}
A[a] = b;
if (a > 1)
{
AddL(max(A[a], A[a - 1]), 1);
AddG(min(A[a], A[a - 1]), 1);
}
if (a < n)
{
AddL(max(A[a], A[a + 1]), 1);
AddG(min(A[a], A[a + 1]), 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... |