# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291042 | PeppaPig | "The Lyuboyn" code (IZhO19_lyuboyn) | C++14 | 602 ms | 7704 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 19;
int n, k, t, s;
mt19937 rng(time(NULL));
void print(int val) {
vector<int> vec;
for(int i = 0; i < n; i++, val >>= 1)
vec.emplace_back(val & 1);
reverse(vec.begin(), vec.end());
for(int x : vec) printf("%d", x);
printf("\n");
}
int chk[N], ans[N];
vector<int> base;
bool is_basis() {
vector<int> mat(base.begin(), base.begin() + n);
for(int i = n - 1; ~i; i--) {
int val = -1;
for(int x : mat) if(x >> i & 1) val = x;
if(val == -1) return false;
for(int &x : mat) if(x != val && (x >> i & 1))
x ^= val;
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |