# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115988 | oolimry | Snake Escaping (JOI18_snake_escaping) | C++14 | 1709 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 value[200000];
unordered_map<string,int> memo;
int n , q;
int dp(string s){
if(memo.find(s) != memo.end()) return memo[s];
for(int i = 0;i < n;i++){
if(s[i] == '?'){
string s0 = s;
string s1 = s;
s0[i] = '0';
s1[i] = '1';
int ans = dp(s0) + dp(s1);
//cout << s << " " << ans << "\n";
memo[s] = ans;
return ans;
}
}
int v = 0;
for(int i = 0;i < n;i++){
v *= 2;
if(s[i] == '1') v++;
}
//cout << s << " " << value[v] << "\n";
memo[s] = value[v];
return value[v];
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... |