oj.uz

Submission #930137

# Submission time Handle Problem Language Result Execution time Memory
930137 2024-02-18T16:20:14 Z duckindog Klasika (COCI20_klasika) C++14
110 / 110
 536 ms 302476 KB 
#include<bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
const int N = 2e5 + 10;
int n;
struct Query {
  int a, t;
  Query(int a = 0, int t = 0) : a(a), t(t) {}
};
vector<Query> Q[N];

struct trie {
  int maxBit = 30;
  int it;
  vector<array<int, 2>> nwt;
  vector<int> t;

  void add(int val, int time) {
    int g = 0;
    for (int j = maxBit; j >= 1; --j) {
      int bit = (val >> j - 1 & 1);

      while (nwt.size() <= g) nwt.push_back(array<int, 2>());

      if (!nwt[g][bit]) nwt[g][bit] = ++it;
      g = nwt[g][bit];

      while (t.size() <= it) t.push_back(N);
      t[g] = min(t[g], time);
    }
  }
  int get(int val, int time) {
    int g = 0;
    int ret = 0;
    for (int j = maxBit; j >= 1; --j) {
      while (nwt.size() <= g) nwt.push_back(array<int, 2>());
      while (t.size() <= it) t.push_back(N);
      int bit = (val >> j - 1 & 1);

      if (nwt[g][!bit] && t[nwt[g][!bit]] <= time) {
        ret |= (1 << j - 1);
        g = nwt[g][!bit];
      } else g = nwt[g][bit];

    }
    return ret;
  }

  void clear() {
    nwt.clear();
    t.clear();
  }

} node[N];

vector<pii> ad[N];
int d[N], t[N];
int answer[N];

int it;
int st[N], ed[N], mask[N];

void dfs(int u, int pre = 0) {
  mask[st[u] = ++it] = u;
  int best = 0;
  for (const auto& duck : ad[u]) {
    int v, w; tie(v, w) = duck;
    if (v == pre) continue;
    dfs(v, u);
    if (!best || node[v].nwt.size() > node[best].nwt.size()) best = v;
  }

  swap(node[u], node[best]);
  for (const auto& duck : ad[u]) {
    int v, w; tie(v, w) = duck;
    if (v == pre || v == best) continue;

    for (int i = st[v]; i <= ed[v]; ++i) node[u].add(d[mask[i]], t[mask[i]]);
    node[v].clear();
  }
  node[u].add(d[u], t[u]);
  for (const auto& duck : Q[u]) {
    int a = duck.a, time = duck.t;
    answer[time] = node[u].get(d[a], time);
  }

  ed[u] = it;
}

int32_t main() {
  cin.tie(0)->sync_with_stdio(0);

  if (fopen("klasika.in.3g", "r")) {
    freopen("duck.inp", "r", stdin);
    freopen("duck.out", "w", stdout);
  }

  cin >> n;
  int cnt = 1;
  for (int i = 1; i <= n; ++i) {
    string ty;
    int x, y;
    cin >> ty >> x >> y;
    if (ty == "Add") {
      cnt += 1;
      ad[x].push_back({cnt, y});
      ad[cnt].push_back({x, y});
      d[cnt] = (d[x] ^ y);
      t[cnt] = i;
    } else {
      Q[y].push_back(Query(x, i));
    }
  }

  memset(answer, -1, sizeof answer);
  dfs(1);
  for (int i = 1; i <= n; ++i)
    if (answer[i] != -1) cout << answer[i] << "\n";
}

Compilation message

klasika.cpp: In member function 'void trie::add(int, int)':
klasika.cpp:23:27: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   23 |       int bit = (val >> j - 1 & 1);
      |                         ~~^~~
klasika.cpp:25:25: warning: comparison of integer expressions of different signedness: 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |       while (nwt.size() <= g) nwt.push_back(array<int, 2>());
      |              ~~~~~~~~~~~^~~~
klasika.cpp:30:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |       while (t.size() <= it) t.push_back(N);
      |              ~~~~~~~~~^~~~~
klasika.cpp: In member function 'int trie::get(int, int)':
klasika.cpp:38:25: warning: comparison of integer expressions of different signedness: 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |       while (nwt.size() <= g) nwt.push_back(array<int, 2>());
      |              ~~~~~~~~~~~^~~~
klasika.cpp:39:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |       while (t.size() <= it) t.push_back(N);
      |              ~~~~~~~~~^~~~~
klasika.cpp:40:27: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   40 |       int bit = (val >> j - 1 & 1);
      |                         ~~^~~
klasika.cpp:43:24: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   43 |         ret |= (1 << j - 1);
      |                      ~~^~~
klasika.cpp: In function 'int32_t main()':
klasika.cpp:96:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |     freopen("duck.inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp:97:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |     freopen("duck.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23896 KB Output is correct
2 Correct 5 ms 23900 KB Output is correct
3 Correct 6 ms 24012 KB Output is correct
4 Correct 5 ms 24564 KB Output is correct
5 Correct 7 ms 23900 KB Output is correct
6 Correct 5 ms 24156 KB Output is correct
7 Correct 5 ms 24184 KB Output is correct
8 Correct 5 ms 24152 KB Output is correct
9 Correct 5 ms 23900 KB Output is correct
10 Correct 5 ms 24156 KB Output is correct
11 Correct 6 ms 24156 KB Output is correct
12 Correct 6 ms 24156 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23896 KB Output is correct
2 Correct 5 ms 23900 KB Output is correct
3 Correct 6 ms 24012 KB Output is correct
4 Correct 5 ms 24564 KB Output is correct
5 Correct 7 ms 23900 KB Output is correct
6 Correct 5 ms 24156 KB Output is correct
7 Correct 5 ms 24184 KB Output is correct
8 Correct 5 ms 24152 KB Output is correct
9 Correct 5 ms 23900 KB Output is correct
10 Correct 5 ms 24156 KB Output is correct
11 Correct 6 ms 24156 KB Output is correct
12 Correct 6 ms 24156 KB Output is correct
13 Correct 7 ms 24408 KB Output is correct
14 Correct 7 ms 24668 KB Output is correct
15 Correct 7 ms 24840 KB Output is correct
16 Correct 7 ms 25220 KB Output is correct
17 Correct 7 ms 24668 KB Output is correct
18 Correct 10 ms 25540 KB Output is correct
19 Correct 8 ms 25692 KB Output is correct
20 Correct 8 ms 26072 KB Output is correct
21 Correct 7 ms 24412 KB Output is correct
22 Correct 7 ms 24924 KB Output is correct
23 Correct 7 ms 25180 KB Output is correct
24 Correct 7 ms 25372 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 51008 KB Output is correct
2 Correct 135 ms 66168 KB Output is correct
3 Correct 164 ms 74972 KB Output is correct
4 Correct 161 ms 103364 KB Output is correct
5 Correct 180 ms 90804 KB Output is correct
6 Correct 270 ms 157872 KB Output is correct
7 Correct 399 ms 218532 KB Output is correct
8 Correct 518 ms 301024 KB Output is correct
9 Correct 131 ms 64184 KB Output is correct
10 Correct 183 ms 96932 KB Output is correct
11 Correct 225 ms 123420 KB Output is correct
12 Correct 287 ms 165280 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23896 KB Output is correct
2 Correct 5 ms 23900 KB Output is correct
3 Correct 6 ms 24012 KB Output is correct
4 Correct 5 ms 24564 KB Output is correct
5 Correct 7 ms 23900 KB Output is correct
6 Correct 5 ms 24156 KB Output is correct
7 Correct 5 ms 24184 KB Output is correct
8 Correct 5 ms 24152 KB Output is correct
9 Correct 5 ms 23900 KB Output is correct
10 Correct 5 ms 24156 KB Output is correct
11 Correct 6 ms 24156 KB Output is correct
12 Correct 6 ms 24156 KB Output is correct
13 Correct 7 ms 24408 KB Output is correct
14 Correct 7 ms 24668 KB Output is correct
15 Correct 7 ms 24840 KB Output is correct
16 Correct 7 ms 25220 KB Output is correct
17 Correct 7 ms 24668 KB Output is correct
18 Correct 10 ms 25540 KB Output is correct
19 Correct 8 ms 25692 KB Output is correct
20 Correct 8 ms 26072 KB Output is correct
21 Correct 7 ms 24412 KB Output is correct
22 Correct 7 ms 24924 KB Output is correct
23 Correct 7 ms 25180 KB Output is correct
24 Correct 7 ms 25372 KB Output is correct
25 Correct 110 ms 51008 KB Output is correct
26 Correct 135 ms 66168 KB Output is correct
27 Correct 164 ms 74972 KB Output is correct
28 Correct 161 ms 103364 KB Output is correct
29 Correct 180 ms 90804 KB Output is correct
30 Correct 270 ms 157872 KB Output is correct
31 Correct 399 ms 218532 KB Output is correct
32 Correct 518 ms 301024 KB Output is correct
33 Correct 131 ms 64184 KB Output is correct
34 Correct 183 ms 96932 KB Output is correct
35 Correct 225 ms 123420 KB Output is correct
36 Correct 287 ms 165280 KB Output is correct
37 Correct 141 ms 51320 KB Output is correct
38 Correct 190 ms 71072 KB Output is correct
39 Correct 180 ms 79932 KB Output is correct
40 Correct 197 ms 107968 KB Output is correct
41 Correct 200 ms 97504 KB Output is correct
42 Correct 332 ms 170796 KB Output is correct
43 Correct 426 ms 216276 KB Output is correct
44 Correct 536 ms 302476 KB Output is correct
45 Correct 152 ms 66172 KB Output is correct
46 Correct 227 ms 97572 KB Output is correct
47 Correct 246 ms 123740 KB Output is correct
48 Correct 299 ms 167352 KB Output is correct