oj.uz

Submission #475648

# Submission time Handle Problem Language Result Execution time Memory
475648 2021-09-23T15:03:06 Z Alex_tz307 Deda (COCI17_deda) C++17
0 / 140
 230 ms 7236 KB 
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f

using namespace std;

struct SegTree {
  int Size;
  vector<int> tree;

  SegTree(int n) {
    Size = 1;
    while (Size < n) {
      Size <<= 1;
    }
    tree.resize(Size << 1, INF);
  }

  void update(int x, int lx, int rx, int pos, int val) {
    if (lx == rx) {
      tree[x] = val;
      cout << lx << ' ' << pos << ' ' << val << endl;
      return;
    }
    int mid = (lx + rx) >> 1, lSon = x << 1, rSon = x << 1 | 1;
    if (pos <= mid) {
      update(lSon, lx, mid, pos, val);
    } else {
      update(rSon, mid + 1, rx, pos, val);
    }
    tree[x] = min(tree[lSon], tree[rSon]);
  }

  int query(int x, int lx, int rx, int pos, int val) {
    if (lx == rx) {
      return lx;
    }
    int mid = (lx + rx) >> 1, lSon = x << 1, rSon = x << 1 | 1, ans = -1;
    if (pos <= mid && tree[lSon] <= val) {
      ans = query(lSon, lx, mid, pos, val);
    }
    if (ans == -1 && tree[rSon] <= val) {
      return query(rSon, mid + 1, rx, pos, val);
    }
    return ans;
  }
};

void test_case() {
  int n, q;
  cin >> n >> q;
  SegTree tree(n);
  for (int i = 1; i <= q; ++i) {
    char op;
    int x, pos;
    cin >> op >> x >> pos;
    if (op == 'M') {
      tree.update(1, 1, n, pos, x);
    } else {
      cout << tree.query(1, 1, n, pos, x) << '\n';
    }
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int T = 1;
  for (int tc = 1; tc <= T; ++tc) {
    test_case();
  }
  return 0;
}

Subtask #1
0 / 140.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Incorrect 4 ms 332 KB Output isn't correct
4 Incorrect 91 ms 3716 KB Output isn't correct
5 Incorrect 230 ms 6276 KB Output isn't correct
6 Incorrect 205 ms 7236 KB Output isn't correct
7 Incorrect 169 ms 7208 KB Output isn't correct