oj.uz

답안 #446202

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
446202 2021-07-21T09:03:17 Z Karliver Klasika (COCI20_klasika) C++14
33 / 110
 276 ms 138196 KB 
	
 #include <bits/stdc++.h>
 
 #define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
 #define all(v) (v).begin(), (v).end()
 using namespace  std;
 #define forn(i,n) for (int i = 0; i < (n); ++i)
 #define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
 using ll = long long;
 int mod = (ll)1e9 + 7;
 #define PI acos(-1)
 typedef pair<int, int> pairs;
 
 const int INF = 1e9 + 1;
 const int N = 2e5 + 100;
 const double eps = 1e-7;
 
 template <class T> using V = vector<T>;  
 template <class T> using VV = V<V<T>>;  
 
 template <typename XPAX>
 void ckma(XPAX &x, XPAX y) {
     x = (x < y ? y : x);
 }
 template <typename XPAX>
 void ckmi(XPAX &x, XPAX y) {
     x = (x > y ? y : x);
 }
 void __print(int x) {cerr << x;}
 void __print(long x) {cerr << x;}
 void __print(long long x) {cerr << x;}
 void __print(unsigned x) {cerr << x;}
 void __print(unsigned long x) {cerr << x;}
 void __print(unsigned long long x) {cerr << x;}
 void __print(float x) {cerr << x;}
 void __print(double x) {cerr << x;}
 void __print(long double x) {cerr << x;}
 void __print(char x) {cerr << '\'' << x << '\'';}
 void __print(const char *x) {cerr << '\"' << x << '\"';}
 void __print(const string &x) {cerr << '\"' << x << '\"';}
 void __print(bool x) {cerr << (x ? "true" : "false");}
 
 template<typename T, typename V>
 void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
 template<typename T>
 void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
 void _print() {cerr << "]\n";}
 template <typename T, typename... V>
 void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
 #define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
 int q;
 V<int> g[N];
 int ls = 1, ks = 1, ptr = 0;
 int tin[N], tout[N], t[N * 16][2];
 int cost[N];
 string s[N];
 set<int> mem[N];
 int a[N], b[N];
 void dfs(int x) {
    tin[x] = ++ptr;
    for(auto c : g[x]) {
        dfs(c);
    }
    tout[x] = ptr;
}
void add(int x, int y) {
    int now = 1;
    for(int i = 30;~i;--i) {
        int g = (x >> i & 1);
        if(!t[now][g])
            t[now][g] = ++ks;

        now = t[now][g];
        mem[now].insert(y);
    }
}
int qur(int x, int l, int r) {
    int now = 1;
    int ret = 0;

    for(int i = 30;i >= 0;--i) {
        int g = (x >> i & 1);
        int inv =  t[now][g ^ 1];
        bool ok = 1;
        auto it = mem[inv].lower_bound(l);
        if(it == mem[inv].end() || *it > r)
            ok = 0;

        if(ok) {
            ret += 1 << i;
            now = inv;
        }
        else {
            now = t[now][g];
        }
    }
    return ret;
}


    

 void solve() {
 
 
 	cin >> q;
    memset(t, 0, sizeof(t));

   
    for(int i = 1;i <= q;++i) {
        cin >> s[i];
        if(s[i] == "Add") {
            cin >> a[i] >> b[i];
            ++ls;
            cost[ls] = cost[a[i]] ^ b[i];

            g[a[i]].push_back(ls);
            a[i] = ls;
        }
        else cin >> a[i] >> b[i];
    }
    dfs(1);

    add(0, tin[1]);

    for(int i = 1;i <= q;++i) {
        if(s[i] == "Add")
            add(cost[a[i]], tin[a[i]]);
        else cout << qur(cost[a[i]], tin[b[i]], tout[b[i]]) << '\n';
    }
    debug(ls);

 
 
 }
 void test_case() {
     int t;
     cin >> t;
     forn(p, t) {
 
         //cout << "Case #" << p + 1 << ": ";
         solve();
     }
 }
 int main() {
 
     ios::sync_with_stdio(false);
     cin.tie(0);
 
     solve();
 
 }

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 45764 KB Output is correct
2 Correct 26 ms 45840 KB Output is correct
3 Correct 27 ms 45908 KB Output is correct
4 Correct 26 ms 45908 KB Output is correct
5 Correct 27 ms 45820 KB Output is correct
6 Correct 27 ms 45820 KB Output is correct
7 Correct 27 ms 45968 KB Output is correct
8 Correct 26 ms 45984 KB Output is correct
9 Correct 26 ms 45772 KB Output is correct
10 Correct 26 ms 45892 KB Output is correct
11 Correct 26 ms 45900 KB Output is correct
12 Correct 27 ms 45900 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 45764 KB Output is correct
2 Correct 26 ms 45840 KB Output is correct
3 Correct 27 ms 45908 KB Output is correct
4 Correct 26 ms 45908 KB Output is correct
5 Correct 27 ms 45820 KB Output is correct
6 Correct 27 ms 45820 KB Output is correct
7 Correct 27 ms 45968 KB Output is correct
8 Correct 26 ms 45984 KB Output is correct
9 Correct 26 ms 45772 KB Output is correct
10 Correct 26 ms 45892 KB Output is correct
11 Correct 26 ms 45900 KB Output is correct
12 Correct 27 ms 45900 KB Output is correct
13 Correct 29 ms 46432 KB Output is correct
14 Correct 31 ms 47068 KB Output is correct
15 Correct 32 ms 47716 KB Output is correct
16 Correct 34 ms 48192 KB Output is correct
17 Correct 29 ms 46292 KB Output is correct
18 Correct 30 ms 47052 KB Output is correct
19 Correct 32 ms 47632 KB Output is correct
20 Correct 33 ms 48156 KB Output is correct
21 Correct 30 ms 46404 KB Output is correct
22 Correct 30 ms 46964 KB Output is correct
23 Correct 32 ms 47520 KB Output is correct
24 Correct 33 ms 48076 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 276 ms 138196 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 45764 KB Output is correct
2 Correct 26 ms 45840 KB Output is correct
3 Correct 27 ms 45908 KB Output is correct
4 Correct 26 ms 45908 KB Output is correct
5 Correct 27 ms 45820 KB Output is correct
6 Correct 27 ms 45820 KB Output is correct
7 Correct 27 ms 45968 KB Output is correct
8 Correct 26 ms 45984 KB Output is correct
9 Correct 26 ms 45772 KB Output is correct
10 Correct 26 ms 45892 KB Output is correct
11 Correct 26 ms 45900 KB Output is correct
12 Correct 27 ms 45900 KB Output is correct
13 Correct 29 ms 46432 KB Output is correct
14 Correct 31 ms 47068 KB Output is correct
15 Correct 32 ms 47716 KB Output is correct
16 Correct 34 ms 48192 KB Output is correct
17 Correct 29 ms 46292 KB Output is correct
18 Correct 30 ms 47052 KB Output is correct
19 Correct 32 ms 47632 KB Output is correct
20 Correct 33 ms 48156 KB Output is correct
21 Correct 30 ms 46404 KB Output is correct
22 Correct 30 ms 46964 KB Output is correct
23 Correct 32 ms 47520 KB Output is correct
24 Correct 33 ms 48076 KB Output is correct
25 Runtime error 276 ms 138196 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -