oj.uz

답안 #770071

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770071 2023-06-30T18:02:02 Z vjudge1 Klasika (COCI20_klasika) C++17
66 / 110
 5000 ms 323300 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];

vi graph[mx];

vector<vector<int>> nxt;
int n;
vector<vi> after = {vi()};

vector<vi> queries;

int low[mx], high[mx];

int c = 0, ans = 0, a = 0;

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

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

bool verif(int node, int l, int r){
    if(l == 0 && r == n-1)return 1;
    int ind1 = lower_bound(all(after[node]), l) - after[node].begin();
    int ind2 = upper_bound(all(after[node]), r) - after[node].begin();
    if(ind2 == 0){
        return 0;
    }
    ind2--;
    if(ind1 <= ind2){
        return 1;
    }
    return 0;
}

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
    n = 0;
    int cnt = 0;
    nxt.resize(1, vector<int>(2));
    int node = 0;
    after[node].pb(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});
                after.push_back(vi());
            }
            node = nxt[node][1];
        }
        else{
            if(nxt[node][0] == 0){
                nxt[node][0] = ++cnt;
                nxt.push_back({0, 0});
                after.push_back(vi());
            }
            node = nxt[node][0];
        }
        after[node].pb(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);
            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 < n;i++){
        high[i] += low[i]-1;
        graph[i].clear();
    }
    //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;
            graph[x].pb(cur);
            after[node].pb(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});
                        after.push_back(vi());
                    }
                    node = nxt[node][1];
                }
                else{
                    if(nxt[node][0] == 0){
                        nxt[node][0] = ++cnt;
                        nxt.push_back({0, 0});
                        after.push_back(vi());
                    }
                    node = nxt[node][0];
                }
                after[node].pb(low[cur]);
            }
        }
        else{
            a = queries[i][1];
            int b = queries[i][2];
            if(b != 0){
                ans = 0;
                dfs(b);
                cout << ans << endl;
            }
            else if(b == 0)cout << solve(pf[a], 0, n-1) << endl;
            //else 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

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 3 ms 5204 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 3 ms 5332 KB Output is correct
4 Correct 3 ms 5472 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5272 KB Output is correct
7 Correct 3 ms 5332 KB Output is correct
8 Correct 3 ms 5460 KB Output is correct
9 Correct 2 ms 5212 KB Output is correct
10 Correct 3 ms 5332 KB Output is correct
11 Correct 3 ms 5332 KB Output is correct
12 Correct 3 ms 5460 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 3 ms 5332 KB Output is correct
4 Correct 3 ms 5472 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5272 KB Output is correct
7 Correct 3 ms 5332 KB Output is correct
8 Correct 3 ms 5460 KB Output is correct
9 Correct 2 ms 5212 KB Output is correct
10 Correct 3 ms 5332 KB Output is correct
11 Correct 3 ms 5332 KB Output is correct
12 Correct 3 ms 5460 KB Output is correct
13 Correct 7 ms 6288 KB Output is correct
14 Correct 7 ms 7372 KB Output is correct
15 Correct 7 ms 8136 KB Output is correct
16 Correct 8 ms 9668 KB Output is correct
17 Correct 4 ms 6288 KB Output is correct
18 Correct 5 ms 7372 KB Output is correct
19 Correct 6 ms 8004 KB Output is correct
20 Correct 7 ms 8828 KB Output is correct
21 Correct 4 ms 6288 KB Output is correct
22 Correct 5 ms 7372 KB Output is correct
23 Correct 10 ms 8004 KB Output is correct
24 Correct 7 ms 8772 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 93376 KB Output is correct
2 Correct 458 ms 169680 KB Output is correct
3 Correct 535 ms 222444 KB Output is correct
4 Correct 638 ms 323300 KB Output is correct
5 Correct 324 ms 91008 KB Output is correct
6 Correct 492 ms 164732 KB Output is correct
7 Correct 587 ms 215552 KB Output is correct
8 Correct 687 ms 313344 KB Output is correct
9 Correct 377 ms 91100 KB Output is correct
10 Correct 486 ms 165804 KB Output is correct
11 Correct 627 ms 217660 KB Output is correct
12 Correct 670 ms 315128 KB Output is correct

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 3 ms 5332 KB Output is correct
4 Correct 3 ms 5472 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5272 KB Output is correct
7 Correct 3 ms 5332 KB Output is correct
8 Correct 3 ms 5460 KB Output is correct
9 Correct 2 ms 5212 KB Output is correct
10 Correct 3 ms 5332 KB Output is correct
11 Correct 3 ms 5332 KB Output is correct
12 Correct 3 ms 5460 KB Output is correct
13 Correct 7 ms 6288 KB Output is correct
14 Correct 7 ms 7372 KB Output is correct
15 Correct 7 ms 8136 KB Output is correct
16 Correct 8 ms 9668 KB Output is correct
17 Correct 4 ms 6288 KB Output is correct
18 Correct 5 ms 7372 KB Output is correct
19 Correct 6 ms 8004 KB Output is correct
20 Correct 7 ms 8828 KB Output is correct
21 Correct 4 ms 6288 KB Output is correct
22 Correct 5 ms 7372 KB Output is correct
23 Correct 10 ms 8004 KB Output is correct
24 Correct 7 ms 8772 KB Output is correct
25 Correct 338 ms 93376 KB Output is correct
26 Correct 458 ms 169680 KB Output is correct
27 Correct 535 ms 222444 KB Output is correct
28 Correct 638 ms 323300 KB Output is correct
29 Correct 324 ms 91008 KB Output is correct
30 Correct 492 ms 164732 KB Output is correct
31 Correct 587 ms 215552 KB Output is correct
32 Correct 687 ms 313344 KB Output is correct
33 Correct 377 ms 91100 KB Output is correct
34 Correct 486 ms 165804 KB Output is correct
35 Correct 627 ms 217660 KB Output is correct
36 Correct 670 ms 315128 KB Output is correct
37 Execution timed out 5060 ms 60184 KB Time limit exceeded
38 Halted 0 ms 0 KB -