# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996396 | yanb | Snake Escaping (JOI18_snake_escaping) | C++14 | 352 ms | 32452 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;
#define int long long
#define pii pair<long long, long long>
#define t3i tuple<long long, long long, long long>
int build(vector<int> &tri, vector<int> &ans, string &tox, int l, int q) {
int v = 0;
for (int i = 0; i < l; i++) {
v *= 3;
v += tri[i];
}
if (ans[v] != -1) return ans[v];
bool ok = 0;
for (int i = 0; i < l; i++) {
if (tri[i] == 2) {
int cans = 0;
tri[i] = 0;
cans += build(tri, ans, tox, l, q);
tri[i] = 1;
cans += build(tri, ans, tox, l, q);
tri[i] = 2;
ans[v] = cans;
ok = 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... |