# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
213505 | AQT | Snake Escaping (JOI18_snake_escaping) | C++14 | 2100 ms | 15736 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, L, Q;
short arr[1<<20];
int pre[2][1<<20];
short cnt[3];
int msk;
vector<int> lst;
vector<short> v;
void rec(int n){
if(n == -1){
lst.emplace_back(msk);
return;
}
msk <<= 1;
if(v[n] == 2){
rec(n-1);
msk |= 1;
rec(n-1);
}
else{
msk |= v[n];
rec(n-1);
}
msk >>= 1;
}
# | 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... |