Submission #115988

#	Time	Username	Problem	Language	Result	Execution time	Memory
115988		oolimry	Snake Escaping (JOI18_snake_escaping)	C++14	12 / 100	1709 ms	65536 KiB

snake_escaping

#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];
}
int main()
{
    //freopen("i.txt","r",stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(0);


    cin >> n >> q;
    string s;
    cin >> s;
    for(int i = 0;i < s.length();i++){
        value[i] = s[i] - '0';
    }

    for(int qq = 0;qq < q;qq++){
        cin >> s;

        cout << dp(s) << "\n";
    }


    return 0;
}

Compilation message (stderr)

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:42:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < s.length();i++){
                   ~~^~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 53
• Subtask 5: 0 / 25