Submission #287528

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
287528	2020-08-31T19:00:43 Z	Leonardo_Paes	Snake Escaping (JOI18_snake_escaping)	C++17	5 / 100	2000 ms	5760 KB

snake_escaping

#include <bits/stdc++.h>
using namespace std;
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int l, q;
    cin >> l >> q;
    vector<int> v((1<<l));
    for(int i=0; i<(1<<l); i++){
        char a;
        cin >> a;
        v[i] = a - '0';
    }
    while(q--){
        string s;
        cin >> s;
        int ans = 0;
        for(int mask=0; mask<(1<<l); mask++){
            bool ok = true;
            for(int i=0; i<l; i++) if(s[i] != '?' and (s[i] - '0') != ((mask&(1<<(l-i-1))) ? 1 : 0)) ok = false;
            if(ok) ans += v[mask];
        }
        cout << ans << "\n";
    }
    return 0;
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	384 KB	Output is correct
2	Correct	18 ms	384 KB	Output is correct
3	Correct	16 ms	384 KB	Output is correct
4	Correct	17 ms	384 KB	Output is correct
5	Correct	20 ms	384 KB	Output is correct
6	Correct	17 ms	384 KB	Output is correct
7	Correct	17 ms	384 KB	Output is correct
8	Correct	18 ms	384 KB	Output is correct
9	Correct	14 ms	384 KB	Output is correct
10	Correct	18 ms	384 KB	Output is correct

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	384 KB	Output is correct
2	Correct	18 ms	384 KB	Output is correct
3	Correct	16 ms	384 KB	Output is correct
4	Correct	17 ms	384 KB	Output is correct
5	Correct	20 ms	384 KB	Output is correct
6	Correct	17 ms	384 KB	Output is correct
7	Correct	17 ms	384 KB	Output is correct
8	Correct	18 ms	384 KB	Output is correct
9	Correct	14 ms	384 KB	Output is correct
10	Correct	18 ms	384 KB	Output is correct
11	Execution timed out	2086 ms	2516 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #3

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	384 KB	Output is correct
2	Correct	18 ms	384 KB	Output is correct
3	Correct	16 ms	384 KB	Output is correct
4	Correct	17 ms	384 KB	Output is correct
5	Correct	20 ms	384 KB	Output is correct
6	Correct	17 ms	384 KB	Output is correct
7	Correct	17 ms	384 KB	Output is correct
8	Correct	18 ms	384 KB	Output is correct
9	Correct	14 ms	384 KB	Output is correct
10	Correct	18 ms	384 KB	Output is correct
11	Execution timed out	2086 ms	2516 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	384 KB	Output is correct
2	Correct	18 ms	384 KB	Output is correct
3	Correct	16 ms	384 KB	Output is correct
4	Correct	17 ms	384 KB	Output is correct
5	Correct	20 ms	384 KB	Output is correct
6	Correct	17 ms	384 KB	Output is correct
7	Correct	17 ms	384 KB	Output is correct
8	Correct	18 ms	384 KB	Output is correct
9	Correct	14 ms	384 KB	Output is correct
10	Correct	18 ms	384 KB	Output is correct
11	Execution timed out	2080 ms	5760 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	384 KB	Output is correct
2	Correct	18 ms	384 KB	Output is correct
3	Correct	16 ms	384 KB	Output is correct
4	Correct	17 ms	384 KB	Output is correct
5	Correct	20 ms	384 KB	Output is correct
6	Correct	17 ms	384 KB	Output is correct
7	Correct	17 ms	384 KB	Output is correct
8	Correct	18 ms	384 KB	Output is correct
9	Correct	14 ms	384 KB	Output is correct
10	Correct	18 ms	384 KB	Output is correct
11	Execution timed out	2086 ms	2516 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-