# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146180 | imeimi2000 | Intergalactic ship (IZhO19_xorsum) | C++17 | 982 ms | 6996 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long llong;
const int mod = 1e9 + 7;
int n, q;
int A[1001];
struct _qs {
int l, r, x;
void scan() {
cin >> l >> r >> x;
}
} qs[100000];
int P2[100001];
int cnt[1001][1001];
int S[7][1002];
int solve(int a, int b) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= i; ++j) {
cnt[j][i] = 0;
}
}
for (int it = 0; it < q; ++it) {
_qs i = qs[it];
bool b1 = (i.x >> a) & 1, b2 = (i.x >> b) & 1;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |