oj.uz

Submission #206529

# Submission time Handle Problem Language Result Execution time Memory
206529 2020-03-03T17:26:48 Z BorisBarca Klasika (COCI20_klasika) C++14
110 / 110
 3308 ms 442140 KB 
#include <bits/stdc++.h>

using namespace std;

#define TRACE(x) cerr << #x << " " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<

typedef long long llint;

const int MAXN = 2e5 + 10;

struct Query {
  bool print;
  int x, y;
  Query() {}
  Query(bool print, int x, int y) : print(print), x(x), y(y) {}
};

struct Node {
  set<int> ids;
  Node *zero, *one;
  Node () {
    zero = one = NULL;
  }
} root;

int q, n, t;
int l[MAXN], r[MAXN], rxor[MAXN];

vector<pair<int, int>> v[MAXN];
vector<Query> Q;

void dfs(int node, int dad, int xval) {
  l[node] = ++t;
  rxor[node] = xval;
  for (const auto &p : v[node]) {
    int nxt = p.first;
    int w = p.second;
    if (nxt == dad) continue;
    dfs(nxt, node, xval ^ w);
  }
  r[node] = t;
}

void trie_add(Node *node, int bit, int val, int id) {
  node->ids.insert(id);
  if (bit < 0) return;
  if (val & (1 << bit)) {
    if (node->one == NULL) node->one = new Node();
    trie_add(node->one, bit - 1, val, id);
  } else {
    if (node->zero == NULL) node->zero = new Node();
    trie_add(node->zero, bit - 1, val, id);
  }
}

int trie_get(Node *node, int bit, int val, int from, int to) {
  if (bit < 0) return 0;
  if ((val & (1 << bit)) == 0) { // want 1
    if (node->one == NULL ||
        node->one->ids.lower_bound(from) == node->one->ids.upper_bound(to))
      return trie_get(node->zero, bit - 1, val, from, to);
    else
      return (1 << bit) + trie_get(node->one, bit - 1, val, from, to);
  } else { // want 0
    if (node->zero == NULL ||
        node->zero->ids.lower_bound(from) == node->zero->ids.upper_bound(to))
      return trie_get(node->one, bit - 1, val, from, to);
    else
      return (1 << bit) + trie_get(node->zero, bit - 1, val, from, to);
  }
}

int main(void) {
  int n = 1;
  scanf("%d", &q);
  for (int i = 0; i < q; ++i) {
    char s[10];
    scanf("%s", s);
    if (s[0] == 'A') {
      int x, y;
      scanf("%d%d", &x, &y); --x;
      Q.emplace_back(false, n, y);
      v[x].emplace_back(n, y);
      v[n].emplace_back(x, y);
      ++n;
    } else {
      int a, b;
      scanf("%d%d", &a, &b); --a; --b;
      Q.emplace_back(true, a, b);
    }
  }

  dfs(0, -1, 0);

  trie_add(&root, 30, 0, l[0]);
  int i = 1;
  for (const auto &qq : Q) {
    if (!qq.print)
      trie_add(&root, 30, rxor[qq.x], l[qq.x]);
    else
      printf("%d\n", trie_get(&root, 30, rxor[qq.x], l[qq.y], r[qq.y]));
    ++i;
  }

  return 0;
}

Compilation message

klasika.cpp: In function 'int main()':
klasika.cpp:78:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &q);
   ~~~~~^~~~~~~~~~
klasika.cpp:81:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", s);
     ~~~~~^~~~~~~~~
klasika.cpp:84:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d%d", &x, &y); --x;
       ~~~~~^~~~~~~~~~~~~~~~
klasika.cpp:91:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d%d", &a, &b); --a; --b;
       ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5240 KB Output is correct
2 Correct 10 ms 5240 KB Output is correct
3 Correct 8 ms 5496 KB Output is correct
4 Correct 10 ms 5500 KB Output is correct
5 Correct 8 ms 5112 KB Output is correct
6 Correct 8 ms 5368 KB Output is correct
7 Correct 9 ms 5368 KB Output is correct
8 Correct 11 ms 5624 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 8 ms 5368 KB Output is correct
11 Correct 10 ms 5496 KB Output is correct
12 Correct 9 ms 5496 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5240 KB Output is correct
2 Correct 10 ms 5240 KB Output is correct
3 Correct 8 ms 5496 KB Output is correct
4 Correct 10 ms 5500 KB Output is correct
5 Correct 8 ms 5112 KB Output is correct
6 Correct 8 ms 5368 KB Output is correct
7 Correct 9 ms 5368 KB Output is correct
8 Correct 11 ms 5624 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 8 ms 5368 KB Output is correct
11 Correct 10 ms 5496 KB Output is correct
12 Correct 9 ms 5496 KB Output is correct
13 Correct 12 ms 6520 KB Output is correct
14 Correct 14 ms 7800 KB Output is correct
15 Correct 15 ms 9080 KB Output is correct
16 Correct 17 ms 10232 KB Output is correct
17 Correct 11 ms 6392 KB Output is correct
18 Correct 14 ms 7672 KB Output is correct
19 Correct 16 ms 9080 KB Output is correct
20 Correct 21 ms 10104 KB Output is correct
21 Correct 12 ms 6392 KB Output is correct
22 Correct 14 ms 7668 KB Output is correct
23 Correct 17 ms 8956 KB Output is correct
24 Correct 19 ms 10080 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1286 ms 122640 KB Output is correct
2 Correct 1906 ms 233560 KB Output is correct
3 Correct 2442 ms 337200 KB Output is correct
4 Correct 2945 ms 441552 KB Output is correct
5 Correct 1016 ms 123400 KB Output is correct
6 Correct 1685 ms 229784 KB Output is correct
7 Correct 2281 ms 331300 KB Output is correct
8 Correct 2988 ms 433284 KB Output is correct
9 Correct 1059 ms 123032 KB Output is correct
10 Correct 1750 ms 230656 KB Output is correct
11 Correct 2339 ms 333664 KB Output is correct
12 Correct 2924 ms 435228 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5240 KB Output is correct
2 Correct 10 ms 5240 KB Output is correct
3 Correct 8 ms 5496 KB Output is correct
4 Correct 10 ms 5500 KB Output is correct
5 Correct 8 ms 5112 KB Output is correct
6 Correct 8 ms 5368 KB Output is correct
7 Correct 9 ms 5368 KB Output is correct
8 Correct 11 ms 5624 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 8 ms 5368 KB Output is correct
11 Correct 10 ms 5496 KB Output is correct
12 Correct 9 ms 5496 KB Output is correct
13 Correct 12 ms 6520 KB Output is correct
14 Correct 14 ms 7800 KB Output is correct
15 Correct 15 ms 9080 KB Output is correct
16 Correct 17 ms 10232 KB Output is correct
17 Correct 11 ms 6392 KB Output is correct
18 Correct 14 ms 7672 KB Output is correct
19 Correct 16 ms 9080 KB Output is correct
20 Correct 21 ms 10104 KB Output is correct
21 Correct 12 ms 6392 KB Output is correct
22 Correct 14 ms 7668 KB Output is correct
23 Correct 17 ms 8956 KB Output is correct
24 Correct 19 ms 10080 KB Output is correct
25 Correct 1286 ms 122640 KB Output is correct
26 Correct 1906 ms 233560 KB Output is correct
27 Correct 2442 ms 337200 KB Output is correct
28 Correct 2945 ms 441552 KB Output is correct
29 Correct 1016 ms 123400 KB Output is correct
30 Correct 1685 ms 229784 KB Output is correct
31 Correct 2281 ms 331300 KB Output is correct
32 Correct 2988 ms 433284 KB Output is correct
33 Correct 1059 ms 123032 KB Output is correct
34 Correct 1750 ms 230656 KB Output is correct
35 Correct 2339 ms 333664 KB Output is correct
36 Correct 2924 ms 435228 KB Output is correct
37 Correct 1790 ms 126564 KB Output is correct
38 Correct 2465 ms 233468 KB Output is correct
39 Correct 2929 ms 340132 KB Output is correct
40 Correct 3149 ms 442140 KB Output is correct
41 Correct 1848 ms 123852 KB Output is correct
42 Correct 2581 ms 229572 KB Output is correct
43 Correct 3080 ms 331624 KB Output is correct
44 Correct 3228 ms 432424 KB Output is correct
45 Correct 2035 ms 123352 KB Output is correct
46 Correct 2893 ms 230308 KB Output is correct
47 Correct 3293 ms 332356 KB Output is correct
48 Correct 3308 ms 434848 KB Output is correct