oj.uz

Submission #258422

# Submission time Handle Problem Language Result Execution time Memory
258422 2020-08-05T22:58:41 Z ipaljak Klasika (COCI20_klasika) C++14
110 / 110
 3163 ms 441760 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 4 ms 5248 KB Output is correct
2 Correct 4 ms 5248 KB Output is correct
3 Correct 4 ms 5504 KB Output is correct
4 Correct 4 ms 5504 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 3 ms 5248 KB Output is correct
7 Correct 4 ms 5376 KB Output is correct
8 Correct 4 ms 5632 KB Output is correct
9 Correct 3 ms 5248 KB Output is correct
10 Correct 3 ms 5376 KB Output is correct
11 Correct 4 ms 5504 KB Output is correct
12 Correct 4 ms 5632 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5248 KB Output is correct
2 Correct 4 ms 5248 KB Output is correct
3 Correct 4 ms 5504 KB Output is correct
4 Correct 4 ms 5504 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 3 ms 5248 KB Output is correct
7 Correct 4 ms 5376 KB Output is correct
8 Correct 4 ms 5632 KB Output is correct
9 Correct 3 ms 5248 KB Output is correct
10 Correct 3 ms 5376 KB Output is correct
11 Correct 4 ms 5504 KB Output is correct
12 Correct 4 ms 5632 KB Output is correct
13 Correct 7 ms 6528 KB Output is correct
14 Correct 9 ms 7808 KB Output is correct
15 Correct 10 ms 9088 KB Output is correct
16 Correct 14 ms 10240 KB Output is correct
17 Correct 9 ms 6400 KB Output is correct
18 Correct 10 ms 7808 KB Output is correct
19 Correct 11 ms 8960 KB Output is correct
20 Correct 12 ms 10112 KB Output is correct
21 Correct 8 ms 6528 KB Output is correct
22 Correct 9 ms 7680 KB Output is correct
23 Correct 11 ms 8960 KB Output is correct
24 Correct 12 ms 10112 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 962 ms 125460 KB Output is correct
2 Correct 1566 ms 233596 KB Output is correct
3 Correct 1989 ms 337060 KB Output is correct
4 Correct 2419 ms 441636 KB Output is correct
5 Correct 908 ms 123424 KB Output is correct
6 Correct 1600 ms 229748 KB Output is correct
7 Correct 2206 ms 331360 KB Output is correct
8 Correct 2729 ms 433144 KB Output is correct
9 Correct 978 ms 122908 KB Output is correct
10 Correct 1758 ms 230392 KB Output is correct
11 Correct 2290 ms 333560 KB Output is correct
12 Correct 2899 ms 434852 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5248 KB Output is correct
2 Correct 4 ms 5248 KB Output is correct
3 Correct 4 ms 5504 KB Output is correct
4 Correct 4 ms 5504 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 3 ms 5248 KB Output is correct
7 Correct 4 ms 5376 KB Output is correct
8 Correct 4 ms 5632 KB Output is correct
9 Correct 3 ms 5248 KB Output is correct
10 Correct 3 ms 5376 KB Output is correct
11 Correct 4 ms 5504 KB Output is correct
12 Correct 4 ms 5632 KB Output is correct
13 Correct 7 ms 6528 KB Output is correct
14 Correct 9 ms 7808 KB Output is correct
15 Correct 10 ms 9088 KB Output is correct
16 Correct 14 ms 10240 KB Output is correct
17 Correct 9 ms 6400 KB Output is correct
18 Correct 10 ms 7808 KB Output is correct
19 Correct 11 ms 8960 KB Output is correct
20 Correct 12 ms 10112 KB Output is correct
21 Correct 8 ms 6528 KB Output is correct
22 Correct 9 ms 7680 KB Output is correct
23 Correct 11 ms 8960 KB Output is correct
24 Correct 12 ms 10112 KB Output is correct
25 Correct 962 ms 125460 KB Output is correct
26 Correct 1566 ms 233596 KB Output is correct
27 Correct 1989 ms 337060 KB Output is correct
28 Correct 2419 ms 441636 KB Output is correct
29 Correct 908 ms 123424 KB Output is correct
30 Correct 1600 ms 229748 KB Output is correct
31 Correct 2206 ms 331360 KB Output is correct
32 Correct 2729 ms 433144 KB Output is correct
33 Correct 978 ms 122908 KB Output is correct
34 Correct 1758 ms 230392 KB Output is correct
35 Correct 2290 ms 333560 KB Output is correct
36 Correct 2899 ms 434852 KB Output is correct
37 Correct 1783 ms 126464 KB Output is correct
38 Correct 2528 ms 233376 KB Output is correct
39 Correct 2892 ms 339748 KB Output is correct
40 Correct 3163 ms 441760 KB Output is correct
41 Correct 1647 ms 123940 KB Output is correct
42 Correct 2308 ms 229540 KB Output is correct
43 Correct 3102 ms 331464 KB Output is correct
44 Correct 3069 ms 432532 KB Output is correct
45 Correct 1920 ms 123332 KB Output is correct
46 Correct 2890 ms 230400 KB Output is correct
47 Correct 2624 ms 332192 KB Output is correct
48 Correct 3073 ms 434892 KB Output is correct