# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
476495 | keta_tsimakuridze | Snake Escaping (JOI18_snake_escaping) | C++14 | 1186 ms | 47436 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>
#define f first
#define s second
////#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 1048576 + 5, mod = 1e9 + 7; // !
int t,dp1[2][N],dp2[2][N],L,q,cnt[N];
main(){
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin >> L >> q;
string s;
cin >> s;
for(int i = 0; i < (1 << L); i++) {
dp1[0][i] = s[i] - '0';
dp2[0][i] = s[i] - '0';
}
for(int j = 0; j < L; j++) {
for(int i = 0; i < (1 << L); i++) {
dp1[1][i] = dp1[0][i];
if((1 << j) & i) dp1[1][i] += dp1[1][i ^ (1 << j)];
}
swap(dp1[0],dp1[1]);
}
for(int j = 0; j < L; j++) {
for(int i = (1 << L) - 1; i >= 0; i--) {
dp2[1][i] = dp2[0][i];
if(!((1 << j) & i)) dp2[1][i] += dp2[1][i ^ (1 << j)];
}
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... |