oj.uz

답안 #930199

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930199 2024-02-19T00:49:31 Z duckindog Klasika (COCI20_klasika) C++17
110 / 110
 522 ms 297348 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 it;
  vector<array<int, 2>> nwt;
  vector<int> t;

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 21600 KB Output is correct
2 Correct 12 ms 21692 KB Output is correct
3 Correct 11 ms 21608 KB Output is correct
4 Correct 11 ms 21592 KB Output is correct
5 Correct 12 ms 21608 KB Output is correct
6 Correct 11 ms 21608 KB Output is correct
7 Correct 11 ms 21608 KB Output is correct
8 Correct 12 ms 21608 KB Output is correct
9 Correct 13 ms 21708 KB Output is correct
10 Correct 11 ms 21608 KB Output is correct
11 Correct 11 ms 21608 KB Output is correct
12 Correct 11 ms 21752 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 21600 KB Output is correct
2 Correct 12 ms 21692 KB Output is correct
3 Correct 11 ms 21608 KB Output is correct
4 Correct 11 ms 21592 KB Output is correct
5 Correct 12 ms 21608 KB Output is correct
6 Correct 11 ms 21608 KB Output is correct
7 Correct 11 ms 21608 KB Output is correct
8 Correct 12 ms 21608 KB Output is correct
9 Correct 13 ms 21708 KB Output is correct
10 Correct 11 ms 21608 KB Output is correct
11 Correct 11 ms 21608 KB Output is correct
12 Correct 11 ms 21752 KB Output is correct
13 Correct 12 ms 21864 KB Output is correct
14 Correct 13 ms 22308 KB Output is correct
15 Correct 13 ms 22412 KB Output is correct
16 Correct 13 ms 22676 KB Output is correct
17 Correct 13 ms 22120 KB Output is correct
18 Correct 13 ms 22632 KB Output is correct
19 Correct 13 ms 23392 KB Output is correct
20 Correct 14 ms 23780 KB Output is correct
21 Correct 12 ms 21964 KB Output is correct
22 Correct 13 ms 22376 KB Output is correct
23 Correct 13 ms 22756 KB Output is correct
24 Correct 13 ms 22888 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 118 ms 48428 KB Output is correct
2 Correct 156 ms 65340 KB Output is correct
3 Correct 155 ms 75016 KB Output is correct
4 Correct 176 ms 105456 KB Output is correct
5 Correct 174 ms 89000 KB Output is correct
6 Correct 286 ms 159004 KB Output is correct
7 Correct 386 ms 217044 KB Output is correct
8 Correct 522 ms 295584 KB Output is correct
9 Correct 138 ms 59516 KB Output is correct
10 Correct 186 ms 93576 KB Output is correct
11 Correct 252 ms 121224 KB Output is correct
12 Correct 280 ms 163700 KB Output is correct

Subtask #4
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 21600 KB Output is correct
2 Correct 12 ms 21692 KB Output is correct
3 Correct 11 ms 21608 KB Output is correct
4 Correct 11 ms 21592 KB Output is correct
5 Correct 12 ms 21608 KB Output is correct
6 Correct 11 ms 21608 KB Output is correct
7 Correct 11 ms 21608 KB Output is correct
8 Correct 12 ms 21608 KB Output is correct
9 Correct 13 ms 21708 KB Output is correct
10 Correct 11 ms 21608 KB Output is correct
11 Correct 11 ms 21608 KB Output is correct
12 Correct 11 ms 21752 KB Output is correct
13 Correct 12 ms 21864 KB Output is correct
14 Correct 13 ms 22308 KB Output is correct
15 Correct 13 ms 22412 KB Output is correct
16 Correct 13 ms 22676 KB Output is correct
17 Correct 13 ms 22120 KB Output is correct
18 Correct 13 ms 22632 KB Output is correct
19 Correct 13 ms 23392 KB Output is correct
20 Correct 14 ms 23780 KB Output is correct
21 Correct 12 ms 21964 KB Output is correct
22 Correct 13 ms 22376 KB Output is correct
23 Correct 13 ms 22756 KB Output is correct
24 Correct 13 ms 22888 KB Output is correct
25 Correct 118 ms 48428 KB Output is correct
26 Correct 156 ms 65340 KB Output is correct
27 Correct 155 ms 75016 KB Output is correct
28 Correct 176 ms 105456 KB Output is correct
29 Correct 174 ms 89000 KB Output is correct
30 Correct 286 ms 159004 KB Output is correct
31 Correct 386 ms 217044 KB Output is correct
32 Correct 522 ms 295584 KB Output is correct
33 Correct 138 ms 59516 KB Output is correct
34 Correct 186 ms 93576 KB Output is correct
35 Correct 252 ms 121224 KB Output is correct
36 Correct 280 ms 163700 KB Output is correct
37 Correct 136 ms 47008 KB Output is correct
38 Correct 170 ms 66932 KB Output is correct
39 Correct 204 ms 76916 KB Output is correct
40 Correct 194 ms 105796 KB Output is correct
41 Correct 196 ms 92536 KB Output is correct
42 Correct 298 ms 164804 KB Output is correct
43 Correct 417 ms 213776 KB Output is correct
44 Correct 487 ms 297348 KB Output is correct
45 Correct 159 ms 60936 KB Output is correct
46 Correct 208 ms 94656 KB Output is correct
47 Correct 240 ms 121980 KB Output is correct
48 Correct 296 ms 164592 KB Output is correct