oj.uz

Submission #197958

# Submission time Handle Problem Language Result Execution time Memory
197958 2020-01-24T12:09:39 Z model_code Klasika (COCI20_klasika) C++17
110 / 110
 3973 ms 438096 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 6 ms 5240 KB Output is correct
2 Correct 7 ms 5240 KB Output is correct
3 Correct 7 ms 5496 KB Output is correct
4 Correct 7 ms 5496 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 7 ms 5368 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 8 ms 5624 KB Output is correct
9 Correct 7 ms 5240 KB Output is correct
10 Correct 7 ms 5368 KB Output is correct
11 Correct 7 ms 5500 KB Output is correct
12 Correct 7 ms 5496 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 7 ms 5240 KB Output is correct
3 Correct 7 ms 5496 KB Output is correct
4 Correct 7 ms 5496 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 7 ms 5368 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 8 ms 5624 KB Output is correct
9 Correct 7 ms 5240 KB Output is correct
10 Correct 7 ms 5368 KB Output is correct
11 Correct 7 ms 5500 KB Output is correct
12 Correct 7 ms 5496 KB Output is correct
13 Correct 11 ms 6392 KB Output is correct
14 Correct 14 ms 7800 KB Output is correct
15 Correct 16 ms 9080 KB Output is correct
16 Correct 18 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 8952 KB Output is correct
20 Correct 18 ms 10104 KB Output is correct
21 Correct 11 ms 6392 KB Output is correct
22 Correct 14 ms 7672 KB Output is correct
23 Correct 16 ms 8952 KB Output is correct
24 Correct 18 ms 10108 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1297 ms 122732 KB Output is correct
2 Correct 2095 ms 230228 KB Output is correct
3 Correct 2606 ms 333676 KB Output is correct
4 Correct 3223 ms 437684 KB Output is correct
5 Correct 1191 ms 120672 KB Output is correct
6 Correct 2045 ms 226376 KB Output is correct
7 Correct 2910 ms 327940 KB Output is correct
8 Correct 3710 ms 429464 KB Output is correct
9 Correct 1136 ms 120220 KB Output is correct
10 Correct 1935 ms 227308 KB Output is correct
11 Correct 2630 ms 330264 KB Output is correct
12 Correct 3349 ms 431188 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 7 ms 5240 KB Output is correct
3 Correct 7 ms 5496 KB Output is correct
4 Correct 7 ms 5496 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 7 ms 5368 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 8 ms 5624 KB Output is correct
9 Correct 7 ms 5240 KB Output is correct
10 Correct 7 ms 5368 KB Output is correct
11 Correct 7 ms 5500 KB Output is correct
12 Correct 7 ms 5496 KB Output is correct
13 Correct 11 ms 6392 KB Output is correct
14 Correct 14 ms 7800 KB Output is correct
15 Correct 16 ms 9080 KB Output is correct
16 Correct 18 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 8952 KB Output is correct
20 Correct 18 ms 10104 KB Output is correct
21 Correct 11 ms 6392 KB Output is correct
22 Correct 14 ms 7672 KB Output is correct
23 Correct 16 ms 8952 KB Output is correct
24 Correct 18 ms 10108 KB Output is correct
25 Correct 1297 ms 122732 KB Output is correct
26 Correct 2095 ms 230228 KB Output is correct
27 Correct 2606 ms 333676 KB Output is correct
28 Correct 3223 ms 437684 KB Output is correct
29 Correct 1191 ms 120672 KB Output is correct
30 Correct 2045 ms 226376 KB Output is correct
31 Correct 2910 ms 327940 KB Output is correct
32 Correct 3710 ms 429464 KB Output is correct
33 Correct 1136 ms 120220 KB Output is correct
34 Correct 1935 ms 227308 KB Output is correct
35 Correct 2630 ms 330264 KB Output is correct
36 Correct 3349 ms 431188 KB Output is correct
37 Correct 2195 ms 123060 KB Output is correct
38 Correct 2979 ms 229916 KB Output is correct
39 Correct 3375 ms 336120 KB Output is correct
40 Correct 3784 ms 438096 KB Output is correct
41 Correct 2256 ms 120624 KB Output is correct
42 Correct 2978 ms 225928 KB Output is correct
43 Correct 3485 ms 327864 KB Output is correct
44 Correct 3973 ms 428684 KB Output is correct
45 Correct 2330 ms 120220 KB Output is correct
46 Correct 3206 ms 226868 KB Output is correct
47 Correct 3486 ms 328604 KB Output is correct
48 Correct 3735 ms 431008 KB Output is correct