Submission #223310

#	Time	Username	Problem	Language	Result	Execution time	Memory
223310		dantoh000	Klasika (COCI20_klasika)	C++14	0 / 110	587 ms	3448 KiB

klasika

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10, LOG_A = 30;
int k;
int basis[LOG_A];
int num[N];
int sz;
int ct = 0;
void insertVector(int mask) {
	for (int i = 0; i < LOG_A; i++) {
		if ((mask & 1 << i) == 0) continue;
		if (!basis[i]) {
			basis[i] = mask;
			++sz;
			return;
		}
		mask ^= basis[i];
	}
}
int maxxor(int cur){
    for (int i = LOG_A; i >= 0; i--){
        if ((cur & 1<<i) == 0){
            if (basis[i]){
                cur ^= basis[i];
            }
        }
    }
    return cur;
}

int main() {
	int q;
	cin >> q;

	while (q--) {
        string Q;
        int a,b;
		cin >> Q >> a >> b;
		if (Q == "Add"){
            num[++ct] = num[a]^b;
            insertVector(num[ct]);
		}
        else if (Q == "Query"){
            printf("%d\n",maxxor(num[a]));
        }
	}

	return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 22
• Subtask 3: 0 / 33
• Subtask 4: 0 / 44