# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
213511 | AQT | Snake Escaping (JOI18_snake_escaping) | C++14 | 1884 ms | 40188 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.
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#pragma GCC target "sse,sse2,sse3,sse4,abm,avx,mmx,popcnt,tune=native"
#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, t;
int ret;
vector<short> v;
vector<short> k;
/*
void rec(int n){
if(n == -1){
if(2 == t){
ret += arr[msk];
}
else{
const short c = ((__builtin_popcount(msk)&1)<<1)-1;
ret += pre[1-t][msk]*c;
}
return;
}
msk <<= 1;
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... |