# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135181 | duality | Snake Escaping (JOI18_snake_escaping) | C++11 | 2036 ms | 35832 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 mp make_pair
#define pb push_back
typedef long long int LLI;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
int H = 7;
char S[(1 << 20)+1],T[21];
struct query { int m1,m2,i; };
query queries[1000000];
int pow3[21];
int ans[1000000];
int num[1594323];
int sum[1594323];
int main() {
int i,j;
int L,Q;
scanf("%d %d %s",&L,&Q,S);
H = min(H,L);
for (i = 0; i < Q; i++) {
scanf("%s",T),queries[i].i = i;
reverse(T,T+H),reverse(T+H,T+L);
for (j = 0; j < H; j++) {
if (T[j] == '0') queries[i].m1 |= (1 << (2*j));
else if (T[j] == '1') queries[i].m1 |= (1 << (2*j+1));
else queries[i].m1 |= (1 << (2*j)) | (1 << (2*j+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... |