# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110100 | popovicirobert | Snake Escaping (JOI18_snake_escaping) | C++14 | 2058 ms | 36492 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 lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44
using namespace std;
int dp[2][1 << 20];
string str;
void bktQ(int p, vector <int> &bit, int cnf, int &ans) {
if(p == bit.size()) {
ans += str[cnf] - '0';
}
else {
bktQ(p + 1, bit, cnf, ans);
bktQ(p + 1, bit, cnf + (1 << bit[p]), ans);
}
}
void bkt(int p, vector <int> &bit, int cnf, int &ans, int cnt, bool t) {
if(p == bit.size()) {
if(cnt & 1) {
ans -= dp[t][cnf];
}
else {
ans += dp[t][cnf];
}
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... |