oj.uz

답안 #770005

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770005 2023-06-30T16:23:05 Z vjudge1 Klasika (COCI20_klasika) C++17
33 / 110
 5000 ms 9040 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "C:\GCC\debug.h"
#else
#define debug(...) void(42)
#endif

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int q;
  cin >> q;

  vector<vector<int>> adj(q + 1);
  vector<int> pref(q + 1);

  auto Add = [&](int x, int y, int w) {
    adj[x].push_back(y);
    pref[y] = pref[x] ^ w;
  };

  int cnt = 1;

  for (int i = 0; i < q; i++) {
    string type;
    cin >> type;

    if (type == "Add") {
      int x, w;
      cin >> x >> w;
      --x;
      Add(x, cnt, w);
      ++cnt;
    } else {
      int a, b;
      cin >> a >> b;
      --a, --b;

      int res = 0;
      
      function<void(int, bool)> Dfs = [&](int u, bool insideSubtree) {
        bool isOk = insideSubtree;
        if (u == b) {
          isOk = true;
        }

        if (isOk) {
          res = max(res, pref[a] ^ pref[u]);
        }
        for (auto v : adj[u]) {
          Dfs(v, isOk);
        }
      };

      Dfs(0, false);
      cout << res << '\n';
    }
  }
  return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 5 ms 468 KB Output is correct
16 Correct 4 ms 468 KB Output is correct
17 Correct 3 ms 332 KB Output is correct
18 Correct 4 ms 332 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 4 ms 420 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 3 ms 340 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5049 ms 9040 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 5 ms 340 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 5 ms 468 KB Output is correct
16 Correct 4 ms 468 KB Output is correct
17 Correct 3 ms 332 KB Output is correct
18 Correct 4 ms 332 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 4 ms 420 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Execution timed out 5049 ms 9040 KB Time limit exceeded
26 Halted 0 ms 0 KB -