# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1175626 | TrendBattles | Snake Escaping (JOI18_snake_escaping) | C++17 | 144 ms | 5704 KiB |
#include <bits/stdc++.h>
using namespace std;
using lli = long long int;
#define INFILE "snake.inp"
#define OUTFILE "snake.out"
namespace SUBTASK_small_L {
void main(int L, int Q, string digits) {
vector <int> pow_3(L + 1);
pow_3[0] = 1;
for (int i = 1; i <= L; ++i) {
pow_3[i] = pow_3[i - 1] * 3;
}
const int M = pow_3[L];
vector <int> mask_3(1 << L);
vector <int> finale(M);
for (int m = 1; m < (1 << L); ++m) {
int p = m & -m;
mask_3[m] = mask_3[m ^ p] + pow_3[__builtin_ctz(p)];
}
for (int m = 0; m < (1 << L); ++m) {
int x = digits[m] - '0';
for (int p = 0; p < (1 << L); ++p) {
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... |