oj.uz

답안 #769987

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
769987 2023-06-30T15:45:14 Z vjudge1 Klasika (COCI20_klasika) C++17
66 / 110
 415 ms 178188 KB 
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pair<ll, ll>, null_type, less<pair<ll,ll>>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
////////////////////Only Clear Code//////////////////////////

void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}

void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}

const int mx = 2e5+5;
const int LOG = 25;
const int inf = 1e9;
const ll mod = 1e8;

int pf[mx];

vii graph[mx];

int ans = 0, a = 0;

vector<vector<int>> nxt;
vector<bool> marked = {false};

void dfs(int node){
    ans = max(ans, pf[a] ^ pf[node]);
    for(pii adj : graph[node]){
        dfs(adj.ff);
    }
}

vector<vi> queries;

int solve(int x){
    int ans = 0;
    int node = 0;
    for(int j = 30;j >= 0;j--){
        if((1 << j) & x){
            if(nxt[node][0] != 0){
                node = nxt[node][0];
                ans += (1 << j);
            }
            else if(nxt[node][1] != 0){
                node = nxt[node][1];
            }
        }
        else{
            if(nxt[node][1] != 0){
                node = nxt[node][1];
                ans += (1 << j);
            }
            else if(nxt[node][0] != 0){
                node = nxt[node][0];
            }
        }
    }
    return ans;
}

void run_case(){
    int q;cin >> q;
    int n = 0, cnt = 0;
    nxt.resize(1, vector<int>(2));
    int node = 0;
    for(int j = 30;j >= 0;j--){
        if((1 << j) & 0){
            if(nxt[node][1] == 0){
                nxt[node][1] = ++cnt;
                nxt.push_back({0, 0});
                marked.push_back(0);
            }
            node = nxt[node][1];
        }
        else{
            if(nxt[node][0] == 0){
                nxt[node][0] = ++cnt;
                nxt.push_back({0, 0});
                marked.push_back(0);
            }
            node = nxt[node][0];
        }
    }
    for(int i = 0; i < q;i++){
        string type;cin >> type;
        if(type == "Add"){
            int x, y;cin >> x >> y;x--;
            n++;
            graph[x].pb({n, y});
            pf[n] = pf[x] ^ y;
            int node = 0;
            for(int j = 30;j >= 0;j--){
                if((1 << j) & pf[n]){
                    if(nxt[node][1] == 0){
                        nxt[node][1] = ++cnt;
                        nxt.push_back({0, 0});
                        marked.push_back(0);
                    }
                    node = nxt[node][1];
                }
                else{
                    if(nxt[node][0] == 0){
                        nxt[node][0] = ++cnt;
                        nxt.push_back({0, 0});
                        marked.push_back(0);
                    }
                    node = nxt[node][0];
                }
            }
            marked[node] = 1;
        }
        else{
            int b;cin >> a >> b;a--;b--;
            //cout << a << " " << pf[a] << endl;
            if(q <= 2000){
                ans = 0, 
                dfs(b);
                cout << ans << endl;  
            }
            else cout << solve(pf[a]) << endl;   
        }
    }
}

int main(){
    speed;
    int t;
    //cin >> t;
    t = 1;
    while(t--){
        run_case();
    }
}

/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message

klasika.cpp: In function 'void usaco_problem()':
klasika.cpp:32:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp:33:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp: In function 'void init()':
klasika.cpp:39:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp:41:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 2 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5120 KB Output is correct
9 Correct 2 ms 5076 KB Output is correct
10 Correct 3 ms 5072 KB Output is correct
11 Correct 2 ms 5204 KB Output is correct
12 Correct 3 ms 5204 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 2 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5120 KB Output is correct
9 Correct 2 ms 5076 KB Output is correct
10 Correct 3 ms 5072 KB Output is correct
11 Correct 2 ms 5204 KB Output is correct
12 Correct 3 ms 5204 KB Output is correct
13 Correct 5 ms 5716 KB Output is correct
14 Correct 6 ms 6288 KB Output is correct
15 Correct 6 ms 6540 KB Output is correct
16 Correct 6 ms 7692 KB Output is correct
17 Correct 4 ms 5588 KB Output is correct
18 Correct 4 ms 6288 KB Output is correct
19 Correct 4 ms 6412 KB Output is correct
20 Correct 5 ms 6796 KB Output is correct
21 Correct 3 ms 5716 KB Output is correct
22 Correct 5 ms 6288 KB Output is correct
23 Correct 6 ms 6412 KB Output is correct
24 Correct 5 ms 6804 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 212 ms 48760 KB Output is correct
2 Correct 276 ms 93708 KB Output is correct
3 Correct 353 ms 106648 KB Output is correct
4 Correct 388 ms 178188 KB Output is correct
5 Correct 213 ms 50764 KB Output is correct
6 Correct 286 ms 92768 KB Output is correct
7 Correct 335 ms 105288 KB Output is correct
8 Correct 399 ms 176244 KB Output is correct
9 Correct 220 ms 50896 KB Output is correct
10 Correct 277 ms 92900 KB Output is correct
11 Correct 315 ms 105972 KB Output is correct
12 Correct 415 ms 176600 KB Output is correct

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 2 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5120 KB Output is correct
9 Correct 2 ms 5076 KB Output is correct
10 Correct 3 ms 5072 KB Output is correct
11 Correct 2 ms 5204 KB Output is correct
12 Correct 3 ms 5204 KB Output is correct
13 Correct 5 ms 5716 KB Output is correct
14 Correct 6 ms 6288 KB Output is correct
15 Correct 6 ms 6540 KB Output is correct
16 Correct 6 ms 7692 KB Output is correct
17 Correct 4 ms 5588 KB Output is correct
18 Correct 4 ms 6288 KB Output is correct
19 Correct 4 ms 6412 KB Output is correct
20 Correct 5 ms 6796 KB Output is correct
21 Correct 3 ms 5716 KB Output is correct
22 Correct 5 ms 6288 KB Output is correct
23 Correct 6 ms 6412 KB Output is correct
24 Correct 5 ms 6804 KB Output is correct
25 Correct 212 ms 48760 KB Output is correct
26 Correct 276 ms 93708 KB Output is correct
27 Correct 353 ms 106648 KB Output is correct
28 Correct 388 ms 178188 KB Output is correct
29 Correct 213 ms 50764 KB Output is correct
30 Correct 286 ms 92768 KB Output is correct
31 Correct 335 ms 105288 KB Output is correct
32 Correct 399 ms 176244 KB Output is correct
33 Correct 220 ms 50896 KB Output is correct
34 Correct 277 ms 92900 KB Output is correct
35 Correct 315 ms 105972 KB Output is correct
36 Correct 415 ms 176600 KB Output is correct
37 Incorrect 224 ms 51612 KB Output isn't correct
38 Halted 0 ms 0 KB -