# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1175864 | dosts | Snake Escaping (JOI18_snake_escaping) | C++20 | 482 ms | 34344 KiB |
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define sp << " " <<
using namespace std;
const int N = 1e4+1,MOD = 1e9+7,inf = 1e18;
void solve() {
int n,q;
cin >> n >> q;
int lim = (1<<n);
string dizi;
cin >> dizi;
vi a(lim);
for (int i = 0;i<lim;i++) a[i] = dizi[i]-'0';
vi sos(a),super(a);
for (int i = 0;i<n;i++) {
for (int j = 0;j<lim;j++) {
if (j&(1<<i)) sos[j]+=sos[j^(1<<i)];
else super[j] += super[j^(1<<i)];
}
}
while (q--) {
string s;
# | 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... |