Submission #770098

#	Time	Username	Problem	Language	Result	Execution time	Memory
770098		vjudge1	Klasika (COCI20_klasika)	C++17	Compilation error	0 ms	0 KiB

klasika

#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];

vector<vector<int>> nxt;

set<int> after[mx*30];

vi marked = {0};

vector<vi> queries;

int low[mx], high[mx];

int c = 0;

void dfs1(int node){
    high[node] = 1;
    low[node] = c++;
    for(pii adj : graph[node]){
        dfs1(adj.ff);
        high[node] += high[adj.ff];
    }
}

bool verif(int node, int l, int r){
    return 1;
    auto ind1 = after[node].lower_bound(l);
    if(ind1 == after[node].end())return 0;
    return (*(ind1) <= r);
}

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

void run_case(){
    int q;cin >> q;
    // Initialize
    int n = 0, cnt = 0;
    nxt.resize(1, vector<int>(2));
    int node = 0;
    after[node].insert(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];
        }
        after[node].insert(0);
    }
    marked[node] = 0;
    // construct tree
    for(int i = 0; i < q;i++){
        string type;cin >> type;
        if(type == "Add"){
            int x, y;cin >> x >> y;x--;
            n++;
            queries.pb({0, x , n, y});
            graph[x].pb({n, y});
            pf[n] = pf[x] ^ y;
        }
        else{
            int a, b;cin >> a >> b;a--;b--;
            queries.pb({1, a, b});
        }
    }
    // construct euler tour
    n++;
    dfs1(0);
    for(int i = 0; i <= cnt;i++){
        high[i] += low[i]-1;
    }
    //construct modified trie + answer queries
    for(int i = 0; i < q;i++){
        int type = queries[i][0];
        if(type==0){
            int x = queries[i][1], cur = queries[i][2];
            int node = 0;
            after[node].insert(low[cur]);
            for(int j = 30;j >= 0;j--){
                if((1 << j) & pf[cur]){
                    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];
                }
                after[node].insert(low[cur]);
            }
            marked[node] = low[cur];
        }
        else{
            int a = queries[i][1], b = queries[i][2];
            cout << solve(pf[a], low[b], high[b]) << endl;
        }
    }
}

int main(){
    init();
    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)
*/#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];

vector<vector<int>> nxt;

set<int> after[mx*30];

vi marked = {0};

vector<vi> queries;

int low[mx], high[mx];

int c = 0;

void dfs1(int node){
    high[node] = 1;
    low[node] = c++;
    for(pii adj : graph[node]){
        dfs1(adj.ff);
        high[node] += high[adj.ff];
    }
}

bool verif(int node, int l, int r){
    return 1;
    auto ind1 = after[node].lower_bound(l);
    if(ind1 == after[node].end())return 0;
    return (*(ind1) <= r);
}

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

void run_case(){
    int q;cin >> q;
    // Initialize
    int n = 0, cnt = 0;
    nxt.resize(1, vector<int>(2));
    int node = 0;
    after[node].insert(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];
        }
        after[node].insert(0);
    }
    marked[node] = 0;
    // construct tree
    for(int i = 0; i < q;i++){
        string type;cin >> type;
        if(type == "Add"){
            int x, y;cin >> x >> y;x--;
            n++;
            queries.pb({0, x , n, y});
            graph[x].pb({n, y});
            pf[n] = pf[x] ^ y;
        }
        else{
            int a, b;cin >> a >> b;a--;b--;
            queries.pb({1, a, b});
        }
    }
    // construct euler tour
    n++;
    dfs1(0);
    for(int i = 0; i <= cnt;i++){
        high[i] += low[i]-1;
    }
    //construct modified trie + answer queries
    for(int i = 0; i < q;i++){
        int type = queries[i][0];
        if(type==0){
            int x = queries[i][1], cur = queries[i][2];
            int node = 0;
            after[node].insert(low[cur]);
            for(int j = 30;j >= 0;j--){
                if((1 << j) & pf[cur]){
                    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];
                }
                after[node].insert(low[cur]);
            }
            marked[node] = low[cur];
        }
        else{
            int a = queries[i][1], b = queries[i][2];
            cout << solve(pf[a], low[b], high[b]) << 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 (stderr)

klasika.cpp: In function 'void run_case()':
klasika.cpp:161:17: warning: unused variable 'x' [-Wunused-variable]
  161 |             int x = queries[i][1], cur = queries[i][2];
      |                 ^
klasika.cpp: At global scope:
klasika.cpp:220:4: error: redefinition of 'll gcd(ll, ll)'
  220 | ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
      |    ^~~
klasika.cpp:10:4: note: 'll gcd(ll, ll)' previously defined here
   10 | ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
      |    ^~~
klasika.cpp:221:4: error: redefinition of 'll lcm(ll, ll)'
  221 | ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
      |    ^~~
klasika.cpp:11:4: note: 'll lcm(ll, ll)' previously defined here
   11 | ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
      |    ^~~
klasika.cpp:222:5: error: redefinition of 'int dx [8]'
  222 | int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
      |     ^~
klasika.cpp:12:5: note: 'int dx [8]' previously defined here
   12 | int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
      |     ^~
klasika.cpp:223:5: error: redefinition of 'int dy [8]'
  223 | int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
      |     ^~
klasika.cpp:13:5: note: 'int dy [8]' previously defined here
   13 | int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
      |     ^~
klasika.cpp:241:6: error: redefinition of 'void usaco_problem()'
  241 | void usaco_problem(){
      |      ^~~~~~~~~~~~~
klasika.cpp:31:6: note: 'void usaco_problem()' previously defined here
   31 | void usaco_problem(){
      |      ^~~~~~~~~~~~~
klasika.cpp:246:6: error: redefinition of 'void init()'
  246 | void init(){
      |      ^~~~
klasika.cpp:36:6: note: 'void init()' previously defined here
   36 | void init(){
      |      ^~~~
klasika.cpp:256:11: error: redefinition of 'const int mx'
  256 | const int mx = 2e5+5;
      |           ^~
klasika.cpp:46:11: note: 'const int mx' previously defined here
   46 | const int mx = 2e5+5;
      |           ^~
klasika.cpp:257:11: error: redefinition of 'const int LOG'
  257 | const int LOG = 25;
      |           ^~~
klasika.cpp:47:11: note: 'const int LOG' previously defined here
   47 | const int LOG = 25;
      |           ^~~
klasika.cpp:258:11: error: redefinition of 'const int inf'
  258 | const int inf = 1e9;
      |           ^~~
klasika.cpp:48:11: note: 'const int inf' previously defined here
   48 | const int inf = 1e9;
      |           ^~~
klasika.cpp:259:10: error: redefinition of 'const ll mod'
  259 | const ll mod = 1e8;
      |          ^~~
klasika.cpp:49:10: note: 'const ll mod' previously defined here
   49 | const ll mod = 1e8;
      |          ^~~
klasika.cpp:261:5: error: redefinition of 'int pf [200005]'
  261 | int pf[mx];
      |     ^~
klasika.cpp:51:5: note: 'int pf [200005]' previously declared here
   51 | int pf[mx];
      |     ^~
klasika.cpp:263:5: error: redefinition of 'std::vector<std::pair<int, int> > graph [200005]'
  263 | vii graph[mx];
      |     ^~~~~
klasika.cpp:53:5: note: 'std::vector<std::pair<int, int> > graph [200005]' previously declared here
   53 | vii graph[mx];
      |     ^~~~~
klasika.cpp:265:21: error: redefinition of 'std::vector<std::vector<int> > nxt'
  265 | vector<vector<int>> nxt;
      |                     ^~~
klasika.cpp:55:21: note: 'std::vector<std::vector<int> > nxt' previously declared here
   55 | vector<vector<int>> nxt;
      |                     ^~~
klasika.cpp:267:10: error: redefinition of 'std::set<int> after [6000150]'
  267 | set<int> after[mx*30];
      |          ^~~~~
klasika.cpp:57:10: note: 'std::set<int> after [6000150]' previously declared here
   57 | set<int> after[mx*30];
      |          ^~~~~
klasika.cpp:269:4: error: redefinition of 'std::vector<int> marked'
  269 | vi marked = {0};
      |    ^~~~~~
klasika.cpp:59:4: note: 'std::vector<int> marked' previously declared here
   59 | vi marked = {0};
      |    ^~~~~~
klasika.cpp:271:12: error: redefinition of 'std::vector<std::vector<int> > queries'
  271 | vector<vi> queries;
      |            ^~~~~~~
klasika.cpp:61:12: note: 'std::vector<std::vector<int> > queries' previously declared here
   61 | vector<vi> queries;
      |            ^~~~~~~
klasika.cpp:273:5: error: redefinition of 'int low [200005]'
  273 | int low[mx], high[mx];
      |     ^~~
klasika.cpp:63:5: note: 'int low [200005]' previously declared here
   63 | int low[mx], high[mx];
      |     ^~~
klasika.cpp:273:14: error: redefinition of 'int high [200005]'
  273 | int low[mx], high[mx];
      |              ^~~~
klasika.cpp:63:14: note: 'int high [200005]' previously declared here
   63 | int low[mx], high[mx];
      |              ^~~~
klasika.cpp:275:5: error: redefinition of 'int c'
  275 | int c = 0;
      |     ^
klasika.cpp:65:5: note: 'int c' previously defined here
   65 | int c = 0;
      |     ^
klasika.cpp:277:6: error: redefinition of 'void dfs1(int)'
  277 | void dfs1(int node){
      |      ^~~~
klasika.cpp:67:6: note: 'void dfs1(int)' previously defined here
   67 | void dfs1(int node){
      |      ^~~~
klasika.cpp:286:6: error: redefinition of 'bool verif(int, int, int)'
  286 | bool verif(int node, int l, int r){
      |      ^~~~~
klasika.cpp:76:6: note: 'bool verif(int, int, int)' previously defined here
   76 | bool verif(int node, int l, int r){
      |      ^~~~~
klasika.cpp:293:5: error: redefinition of 'int solve(int, int, int)'
  293 | int solve(int x, int l, int r){
      |     ^~~~~
klasika.cpp:83:5: note: 'int solve(int, int, int)' previously defined here
   83 | int solve(int x, int l, int r){
      |     ^~~~~
klasika.cpp:319:6: error: redefinition of 'void run_case()'
  319 | void run_case(){
      |      ^~~~~~~~
klasika.cpp:109:6: note: 'void run_case()' previously defined here
  109 | void run_case(){
      |      ^~~~~~~~
klasika.cpp: In function 'void run_case()':
klasika.cpp:371:17: warning: unused variable 'x' [-Wunused-variable]
  371 |             int x = queries[i][1], cur = queries[i][2];
      |                 ^
klasika.cpp: At global scope:
klasika.cpp:402:5: error: redefinition of 'int main()'
  402 | int main(){
      |     ^~~~
klasika.cpp:192:5: note: 'int main()' previously defined here
  192 | int main(){
      |     ^~~~
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);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp: In function 'void usaco_problem()':
klasika.cpp:242:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  242 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp:243:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  243 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp: In function 'void init()':
klasika.cpp:249:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  249 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
klasika.cpp:251:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  251 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~