oj.uz

Submission #507294

# Submission time Handle Problem Language Result Execution time Memory
507294 2022-01-12T10:40:44 Z MilosMilutinovic Simple game (IZhO17_game) C++14
0 / 100
 5 ms 6476 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

int st[N * 4];

void modify(int node, int l, int r, int ll, int rr, int x) {
  if (l > r || l > rr || r < ll) return;
  if (ll <= l && r <= rr) {
    st[node] += x;
    return;
  }
  int mid = l + r >> 1;
  modify(node * 2, l, mid, ll, rr, x);
  modify(node * 2 + 1, mid + 1, r, ll, rr, x);
}

int get(int node, int l, int r, int x) {
  if (l == r) return st[node];
  int mid = l + r >> 1;
  if (x <= mid) return st[node] + get(node * 2, l, mid, x);
  else return st[node] + get(node * 2 + 1, mid + 1, r, x);
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  vector<int> h(n);
  for (int i = 0; i < n; i++) {
    cin >> h[i];
  }
  auto Add = [&](int i) {
    if (i < 0) return;
    int L = min(h[i], h[i + 1]);
    int R = max(h[i], h[i + 1]);
    modify(1, 1, N, L, R, 1);
  };
  auto Rem = [&](int i) {
    if (i < 0) return;
    int L = min(h[i], h[i + 1]);
    int R = max(h[i], h[i + 1]);
    modify(1, 1, N, L, R, -1);
  };
  for (int i = 0; i + 1 < n; i++) {
    Add(i);
  }
  while (q--) {
    int foo;
    cin >> foo;
    if (foo == 1) {
      int pos, val;
      cin >> pos >> val;
      --pos;
      Rem(pos);
      Rem(pos - 1);
      h[pos] = val;
      Add(pos);
      Add(pos - 1);
    } else {
      int H;
      cin >> H;
      cout << get(1, 1, N, H) << '\n';
    }
  }
  return 0;
}

Compilation message

game.cpp: In function 'void modify(int, int, int, int, int, int)':
game.cpp:15:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   15 |   int mid = l + r >> 1;
      |             ~~^~~
game.cpp: In function 'int get(int, int, int, int)':
game.cpp:22:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |   int mid = l + r >> 1;
      |             ~~^~~

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 5 ms 6476 KB Output is correct
3 Correct 4 ms 6348 KB Output is correct
4 Incorrect 4 ms 6476 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 5 ms 6476 KB Output is correct
3 Correct 4 ms 6348 KB Output is correct
4 Incorrect 4 ms 6476 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 5 ms 6476 KB Output is correct
3 Correct 4 ms 6348 KB Output is correct
4 Incorrect 4 ms 6476 KB Output isn't correct
5 Halted 0 ms 0 KB -