# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334278 | ChrisT | Snake Escaping (JOI18_snake_escaping) | C++17 | 1865 ms | 65536 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;
int val[1 << 20], sum1[1 << 20], sum2[1 << 20], nmask[1 << 6];
vector<int> pre[1 << 20];
char str[25];
int main() { //nut
int n,q;
scanf ("%d %d",&n,&q);
for (int i = 0; i < (1 << n); i++) {
char ch; scanf (" %c",&ch);
sum2[((1 << n) - 1) ^ i] = sum1[i] = val[i] = ch - '0';
}
for (int i = 0; i < n; i++) {
for (int mask = 0; mask < (1 << n); mask++) if (mask >> i & 1) {
sum1[mask] += sum1[mask ^ (1 << i)];
sum2[mask] += sum2[mask ^ (1 << i)];
}
}
for (int mask = 0; mask < (1 << n); mask++) if (__builtin_popcount(mask) <= n/3) {
vector<int> pos;
for (int i = 0; i < n; i++) if (mask >> i & 1) pos.push_back(i);
for (int mask2 = 0; mask2 < (1 << (int)pos.size()); mask2++) {
int nmask = 0;
for (int i = 0; i < (int)pos.size(); i++) if (mask2 >> i & 1) nmask |= (1 << pos[i]);
pre[mask].push_back(nmask);
}
}
while (q--) {
scanf ("%s",str);
reverse(str,str+n);
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... |