# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107675 | Saboon | Lamps (JOI19_lamps) | C++14 | 786 ms | 259016 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;
typedef long long ll;
const int maxn = 1e6 + 10;
int dp[maxn][65];
inline int mab(int fi, int se){
return fi + se * 4;
}
inline int transform(int x, int query){
if (query == 0)
return x;
else if (query == 1)
return 0;
else if (query == 2)
return 1;
else
return 1 ^ x;
}
inline int transfer(int q, int fi, int se){
q = transform(q, fi);
q = transform(q, se);
return q;
}
# | 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... |