# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72944 | 2018-08-27T09:30:11 Z | win11905 | Simple game (IZhO17_game) | C++11 | 7 ms | 3944 KB |
#include <bits/stdc++.h> using namespace std; #define pii pair<int, int> #define x first #define y second #define all(x) x.begin(), x.end() const int N = 1e5+5; const int MX = 1e6; int n, m, A[N]; vector<int> coor; vector<pii> que; int t[MX]; int get(int x) { return upper_bound(all(coor), x) - coor.begin(); } void update(int x, int v) { for(; x <= MX; x += x & -x) t[x-1] += v; } int query(int x) { int v = 0; for(; x; x -= x & -x) v += t[x-1]; return v; } int main() { scanf("%d %d", &n, &m); for(int i = 1; i <= n; ++i) scanf("%d", A+i); for(int i = 1; i < n; ++i) { update(min(A[i], A[i+1]), 1); update(1 + max(A[i], A[i+1]), -1); } for(int i = 0, a, b, c; i < m; ++i) { scanf("%d %d", &a, &b); if(a == 1) { scanf("%d", &c); if(b != 1) { update(min(A[b], A[b-1]), -1); update(1 + max(A[b], A[b-1]), 1); A[b] = c; update(min(A[b], A[b-1]), 1); update(1 + max(A[b], A[b-1]), -1); } if(b != MX) { update(min(A[b], A[b+1]), -1); update(1 + max(A[b], A[b+1]), 1); A[b] = c; update(min(A[b], A[b+1]), 1); update(1 + max(A[b], A[b+1]), -1); } } else printf("%d\n", query(b)); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 376 KB | Output is correct |
2 | Incorrect | 7 ms | 3944 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 376 KB | Output is correct |
2 | Incorrect | 7 ms | 3944 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 376 KB | Output is correct |
2 | Incorrect | 7 ms | 3944 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |