답안 #844600

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
844600	2023-09-05T14:29:42 Z	vjudge1	Klasika (COCI20_klasika)	C++17	컴파일 오류	0 ms	0 KB

klasika

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define int long long
 
const int MAXN = 2e5 + 5;

#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    #define OPEN freopen(".in", "r", stdin); \
                 freopen(".out", "w", stdout);
#else
    #define OPEN void(23);
#endif

vector <pair <int, int>> adj[MAXN];
vector <pair <int, int>> radj[MAXN];
int cnt = 2;
int FindAns(int a, int b)
{
    vector <bool> sub(cnt + 5);
    function <void(int)> dfsSub = [&](int node) -> void
    {
        //cerr << node << " ";
        sub[node] = true;
        for(auto &[child, w] : adj[node]) 
            dfsSub(child);

        return;
    };

    dfsSub(b);

    int ans = 0;
    function <void(int, int, int)> dfs = [&](int node, int par, int sum) -> void
    {
        if(sub[node]) ans = max(ans, sum);
        for(auto &[child, w] : adj[node])
            if(child != par) 
                dfs(child, node, sum ^ w);

        for(auto &[child, w] : radj[node])
            if(child != par) 
                dfs(child, node, sum ^ w);
    };

    dfs(a, 0, 0);

    return ans;
}

void solve1(int q, vector <tuple <string, int, int>> &queries)
{
    for(int i = 1; i <= q; i++)
    {
        auto &[str, a, b] = queries[i -1];
        if(str[0] == 'A')
        {
            adj[a].emplace_back(cnt, b);
            radj[cnt].emplace_back(a, b);
            cnt++;
        }
        else
        {
            cout << FindAns(a, b) << "\n";
        }
    }

    return;
}

struct Trie
{
    vector <pair <int, int>> tree(2, {-1, -1});
    int cnt = 2;
    void add(int x, int node = 1, int bit = 32)
    {
        if(x & 1)
        {
            if(tree[node].r == -1) tree[node].r = cnt++, tree.emplace_back({-1, -1});
            add(x / 2, tree[node].r, bit -1);
        }
        else
        {
            if(tree[node].l == -1) tree[node].l = cnt++, tree.emplace_back({-1, -1});
            add(x / 2, tree[node].l, bit -1);
        }
    }

    int query(int x, int node = 1, int bit = 32)
    {
        if(x & 1)
        {
            if(tree[node].l != -1) return (1 << bit) + query(x / 2, tree[node].l, bit -1);
            else return query(x / 2, tree[node].r, bit -1);
        }
        else
        {
            if(tree[node].r != -1) return (1 << bit) + query(x / 2, tree[node].r, bit -1);
            else return query(x / 2, tree[node].l, bit -1);
        }
    }
};

void solve2(int q, vector <tuple <string, int, int>> &queries)
{
    Trie trie;
    vector <int> dists(2);
    dists[1] = 0;
    for(int i = 1; i <= q; i++)
    {
        auto &[str, a, b] = queries[i -1];
        if(str[0] == 'A')
        {
            dists.emplace_back(dists[a] ^ b);
            trie.add(dists[a] ^ b);
            cnt++;
        }
        else
        {
            cout << trie.query(dists[a]) << "\n";
        }
    }
}

int32_t main()
{
    OPEN;

    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int q; cin >> q;
    vector <tuple <string, int, int>> queries(q);
    for(auto &[a, b, c] : queries) cin >> a >> b >> c;

    bool ok = true;
    for(auto &[a, b, c] : queries) ok &= c == 1;

    if(c == 1) solve2(q, queries);
    else solve1(q, queries);
}

Compilation message

klasika.cpp:75:35: error: expected identifier before numeric constant
   75 |     vector <pair <int, int>> tree(2, {-1, -1});
      |                                   ^
klasika.cpp:75:35: error: expected ',' or '...' before numeric constant
klasika.cpp: In member function 'void Trie::add(long long int, long long int, long long int)':
klasika.cpp:81:20: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
   81 |             if(tree[node].r == -1) tree[node].r = cnt++, tree.emplace_back({-1, -1});
      |                    ^
klasika.cpp:81:40: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
   81 |             if(tree[node].r == -1) tree[node].r = cnt++, tree.emplace_back({-1, -1});
      |                                        ^
klasika.cpp:81:58: error: invalid use of member function 'std::vector<std::pair<long long int, long long int> > Trie::tree(int)' (did you forget the '()' ?)
   81 |             if(tree[node].r == -1) tree[node].r = cnt++, tree.emplace_back({-1, -1});
      |                                                          ^~~~
klasika.cpp:81:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   81 |             if(tree[node].r == -1) tree[node].r = cnt++, tree.emplace_back({-1, -1});
      |             ^~
klasika.cpp:81:84: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   81 |             if(tree[node].r == -1) tree[node].r = cnt++, tree.emplace_back({-1, -1});
      |                                                                                    ^
klasika.cpp:81:84: error: expected primary-expression before ')' token
klasika.cpp:82:28: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
   82 |             add(x / 2, tree[node].r, bit -1);
      |                            ^
klasika.cpp:86:20: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
   86 |             if(tree[node].l == -1) tree[node].l = cnt++, tree.emplace_back({-1, -1});
      |                    ^
klasika.cpp:86:40: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
   86 |             if(tree[node].l == -1) tree[node].l = cnt++, tree.emplace_back({-1, -1});
      |                                        ^
klasika.cpp:86:58: error: invalid use of member function 'std::vector<std::pair<long long int, long long int> > Trie::tree(int)' (did you forget the '()' ?)
   86 |             if(tree[node].l == -1) tree[node].l = cnt++, tree.emplace_back({-1, -1});
      |                                                          ^~~~
klasika.cpp:86:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   86 |             if(tree[node].l == -1) tree[node].l = cnt++, tree.emplace_back({-1, -1});
      |             ^~
klasika.cpp:86:84: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   86 |             if(tree[node].l == -1) tree[node].l = cnt++, tree.emplace_back({-1, -1});
      |                                                                                    ^
klasika.cpp:86:84: error: expected primary-expression before ')' token
klasika.cpp:87:28: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
   87 |             add(x / 2, tree[node].l, bit -1);
      |                            ^
klasika.cpp: In member function 'long long int Trie::query(long long int, long long int, long long int)':
klasika.cpp:95:20: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
   95 |             if(tree[node].l != -1) return (1 << bit) + query(x / 2, tree[node].l, bit -1);
      |                    ^
klasika.cpp:95:73: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
   95 |             if(tree[node].l != -1) return (1 << bit) + query(x / 2, tree[node].l, bit -1);
      |                                                                         ^
klasika.cpp:96:42: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
   96 |             else return query(x / 2, tree[node].r, bit -1);
      |                                          ^
klasika.cpp:100:20: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
  100 |             if(tree[node].r != -1) return (1 << bit) + query(x / 2, tree[node].r, bit -1);
      |                    ^
klasika.cpp:100:73: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
  100 |             if(tree[node].r != -1) return (1 << bit) + query(x / 2, tree[node].r, bit -1);
      |                                                                         ^
klasika.cpp:101:42: error: invalid types '<unresolved overloaded function type>[long long int]' for array subscript
  101 |             else return query(x / 2, tree[node].l, bit -1);
      |                                          ^
klasika.cpp: In function 'int32_t main()':
klasika.cpp:141:8: error: 'c' was not declared in this scope
  141 |     if(c == 1) solve2(q, queries);
      |        ^