# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1124141 | Zero_OP | The Xana coup (BOI21_xanadu) | C++17 | 374 ms | 60096 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int N, c[MAX];
vector<int> adj[MAX];
namespace subtask1{
bool check(){
return N <= 20;
}
int msk[MAX];
void solve(){
int base = 0;
for(int i = 0; i < N; ++i){
base ^= c[i] * (1 << i);
}
for(int i = 0; i < N; ++i){
msk[i] = (1 << i);
for(auto j : adj[i]) msk[i] |= (1 << j);
}
int ans = N + 1;
for(int mask = 0; mask < (1 << N); ++mask){
int cur = base;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |