oj.uz

답안 #930138

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930138 2024-02-18T16:22:00 Z duckindog Klasika (COCI20_klasika) C++14
110 / 110
 514 ms 299296 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 23900 KB Output is correct
2 Correct 7 ms 23900 KB Output is correct
3 Correct 6 ms 24156 KB Output is correct
4 Correct 7 ms 24156 KB Output is correct
5 Correct 6 ms 23900 KB Output is correct
6 Correct 6 ms 24156 KB Output is correct
7 Correct 7 ms 24024 KB Output is correct
8 Correct 7 ms 24152 KB Output is correct
9 Correct 6 ms 24012 KB Output is correct
10 Correct 7 ms 24156 KB Output is correct
11 Correct 7 ms 24156 KB Output is correct
12 Correct 7 ms 24156 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 23900 KB Output is correct
2 Correct 7 ms 23900 KB Output is correct
3 Correct 6 ms 24156 KB Output is correct
4 Correct 7 ms 24156 KB Output is correct
5 Correct 6 ms 23900 KB Output is correct
6 Correct 6 ms 24156 KB Output is correct
7 Correct 7 ms 24024 KB Output is correct
8 Correct 7 ms 24152 KB Output is correct
9 Correct 6 ms 24012 KB Output is correct
10 Correct 7 ms 24156 KB Output is correct
11 Correct 7 ms 24156 KB Output is correct
12 Correct 7 ms 24156 KB Output is correct
13 Correct 7 ms 24408 KB Output is correct
14 Correct 8 ms 24668 KB Output is correct
15 Correct 10 ms 24948 KB Output is correct
16 Correct 8 ms 25224 KB Output is correct
17 Correct 9 ms 24664 KB Output is correct
18 Correct 9 ms 25180 KB Output is correct
19 Correct 9 ms 25796 KB Output is correct
20 Correct 9 ms 26072 KB Output is correct
21 Correct 8 ms 24572 KB Output is correct
22 Correct 8 ms 24944 KB Output is correct
23 Correct 9 ms 25180 KB Output is correct
24 Correct 9 ms 25444 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 52136 KB Output is correct
2 Correct 140 ms 70612 KB Output is correct
3 Correct 159 ms 81912 KB Output is correct
4 Correct 181 ms 115348 KB Output is correct
5 Correct 177 ms 88592 KB Output is correct
6 Correct 301 ms 162284 KB Output is correct
7 Correct 395 ms 216100 KB Output is correct
8 Correct 500 ms 296628 KB Output is correct
9 Correct 132 ms 60568 KB Output is correct
10 Correct 183 ms 96164 KB Output is correct
11 Correct 240 ms 121420 KB Output is correct
12 Correct 281 ms 165072 KB Output is correct

Subtask #4
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 23900 KB Output is correct
2 Correct 7 ms 23900 KB Output is correct
3 Correct 6 ms 24156 KB Output is correct
4 Correct 7 ms 24156 KB Output is correct
5 Correct 6 ms 23900 KB Output is correct
6 Correct 6 ms 24156 KB Output is correct
7 Correct 7 ms 24024 KB Output is correct
8 Correct 7 ms 24152 KB Output is correct
9 Correct 6 ms 24012 KB Output is correct
10 Correct 7 ms 24156 KB Output is correct
11 Correct 7 ms 24156 KB Output is correct
12 Correct 7 ms 24156 KB Output is correct
13 Correct 7 ms 24408 KB Output is correct
14 Correct 8 ms 24668 KB Output is correct
15 Correct 10 ms 24948 KB Output is correct
16 Correct 8 ms 25224 KB Output is correct
17 Correct 9 ms 24664 KB Output is correct
18 Correct 9 ms 25180 KB Output is correct
19 Correct 9 ms 25796 KB Output is correct
20 Correct 9 ms 26072 KB Output is correct
21 Correct 8 ms 24572 KB Output is correct
22 Correct 8 ms 24944 KB Output is correct
23 Correct 9 ms 25180 KB Output is correct
24 Correct 9 ms 25444 KB Output is correct
25 Correct 117 ms 52136 KB Output is correct
26 Correct 140 ms 70612 KB Output is correct
27 Correct 159 ms 81912 KB Output is correct
28 Correct 181 ms 115348 KB Output is correct
29 Correct 177 ms 88592 KB Output is correct
30 Correct 301 ms 162284 KB Output is correct
31 Correct 395 ms 216100 KB Output is correct
32 Correct 500 ms 296628 KB Output is correct
33 Correct 132 ms 60568 KB Output is correct
34 Correct 183 ms 96164 KB Output is correct
35 Correct 240 ms 121420 KB Output is correct
36 Correct 281 ms 165072 KB Output is correct
37 Correct 137 ms 50164 KB Output is correct
38 Correct 165 ms 73876 KB Output is correct
39 Correct 183 ms 83868 KB Output is correct
40 Correct 205 ms 114932 KB Output is correct
41 Correct 194 ms 92620 KB Output is correct
42 Correct 301 ms 165672 KB Output is correct
43 Correct 387 ms 213580 KB Output is correct
44 Correct 514 ms 299296 KB Output is correct
45 Correct 158 ms 61500 KB Output is correct
46 Correct 208 ms 96776 KB Output is correct
47 Correct 247 ms 122112 KB Output is correct
48 Correct 295 ms 165428 KB Output is correct