Submission #126930

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
126930	2019-07-08 16:03:16	EntityIT	Snake Escaping (JOI18_snake_escaping)	C++14	100 / 100	1070 ms	39284 KiB

snake_escaping

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
const int MAX_L = 20;
int L, q, sum[2][1 << MAX_L];
string s;
bool checkBit (int _a, int _bit) { return (_a >> _bit) & 1; }
int main () {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//    freopen("test.INP", "r", stdin);
    cin >> L >> q >> s;
    for (int i = 0; i < (1 << L); ++i) sum[0][i] = sum[1][i] = s[i] - '0';
    for (int i = 0; i < L; ++i) {
        for (int j = 0; j < (1 << L); ++j) {
            if (checkBit(j, i) ) sum[0][j] += sum[0][j ^ (1 << i)];
            else sum[1][j] += sum[1][j ^ (1 << i)];
        }
    }
    while (q --) {
        string t; cin >> t; reverse(t.begin(), t.end() );
        int maskQ = 0, maskO1 = 0, maskO0 = 0;
        for (int i = 0; i < L; ++i) {
            if (t[i] == '?') maskQ |= (1 << i);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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