# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288137 | bensonlzl | "The Lyuboyn" code (IZhO19_lyuboyn) | C++14 | 228 ms | 15952 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;
int N, K, T, S;
string st;
int usable[1000005];
vector<int> kdiff, ans;
void dfs(int x){
usable[x] = 0;
ans.push_back(x);
for (auto it : kdiff){
if (usable[x ^ it]){
dfs(x ^ it);
return;
}
}
}
string intToString(int x){
string r;
for (int i = 0; i < N; ++i){
r = ((x & (1 << i)) ? '1' : '0') + r;
}
return r;
}
int main(){
ios_base::sync_with_stdio(false);
# | 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... |