# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210493 | SamAnd | Snake Escaping (JOI18_snake_escaping) | C++17 | 653 ms | 38520 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;
const int N = 22, Q = 1000006;
int n, qq;
char a[(1 << N)];
bool so(const char a[], const char b[])
{
for (int i = 1; i <= n; ++i)
{
if (a[i] != b[i])
return a[i] < b[i];
}
return false;
}
struct ban
{
int i;
char u[N];
};
bool operator<(const ban& a, const ban& b)
{
return so(a.u, b.u);
}
ban b[Q];
int* t[N];
int ans[Q];
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... |