oj.uz

Submission #391450

# Submission time Handle Problem Language Result Execution time Memory
391450 2021-04-18T19:06:20 Z iANikzad Snake Escaping (JOI18_snake_escaping) C++14
65 / 100
 2000 ms 10996 KB 
#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define F first
#define S second
#define debug(x) cerr<<#x<<" :"<<x<<"\n"
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define FAST ios_base::sync_with_stdio(false), cin.tie(), cout.tie();
//#define int long long

typedef long long ll;
typedef long double ld;

const int maxn = 20;
const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const int mlog = 20;
const int SQ = 400;

int sos[1 << 20], rsos[1 << 20];

string s, k;
int l, q;
int a, b, c;

int32_t main()
{
    FAST;

    cin >> l >> q >> s;

    for(int i = 0; i < (1 << l); i++)
        sos[i] = s[i] - '0', rsos[i] = s[(1 << l) - i - 1] - '0';

    for(int i = 0; i < l; i++) 
        for(int mask = 0; mask < (1 << l); mask++)
            if(mask & (1 << i))
                sos[mask] += sos[mask ^ (1 << i)], rsos[mask] += rsos[mask ^ (1 << i)];

    while(q--)
    {
        cin >> k;
        reverse(all(k));

        a = b = c = 0;
        int ans = 0, base = 0, mask = 0;

        for(int i = 0; i < l; i++)
        {
            if(k[i] == '?') a++;
            if(k[i] == '0') b++;
            if(k[i] == '1') c++;
        }

        if(a < 7)
        {
            for(int i = 0; i < l; i++)
            {
                if (k[i] == '?') mask += 1 << i;
                else if (k[i] == '1') base += 1 << i;
            }

            for (int i = mask; i; i = mask & (i - 1)) ans += s[i | base] - '0';
            ans += s[base] - '0';
        }
        else if(b < 7)
        {
            for(int i = 0; i < l; i++)
            {
                if (k[i] == '0') mask += 1 << i;
                else if (k[i] == '?') base += 1 << i;
            }

            for (int i = mask; i; i = mask & (i - 1)) ans += ((b - __builtin_popcount(i)) & 1 ? -1 : 1) * rsos[i | base];
            ans += (b & 1 ? -1 : 1) * rsos[base];
         
        }
        else
        {
            for(int i = 0; i < l; i++)
            {
                if (k[i] == '1') mask += 1 << i;
                else if (k[i] == '?') base += 1 << i;
            }

            for (int i = mask; i; i = mask & (i - 1)) ans += ((c - __builtin_popcount(i)) & 1 ? -1 : 1) * sos[i | base];
            ans += (c & 1 ? -1 : 1) * sos[base];

        }

        cout << ans << "\n";
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 244 KB Output is correct
10 Correct 3 ms 332 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 244 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 1868 ms 4424 KB Output is correct
12 Correct 1929 ms 4072 KB Output is correct
13 Correct 1842 ms 3140 KB Output is correct
14 Correct 1860 ms 3312 KB Output is correct
15 Correct 1947 ms 4240 KB Output is correct
16 Correct 1911 ms 8296 KB Output is correct
17 Correct 1900 ms 8316 KB Output is correct
18 Correct 1779 ms 10072 KB Output is correct
19 Correct 1847 ms 7064 KB Output is correct
20 Correct 1906 ms 8960 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 244 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 1868 ms 4424 KB Output is correct
12 Correct 1929 ms 4072 KB Output is correct
13 Correct 1842 ms 3140 KB Output is correct
14 Correct 1860 ms 3312 KB Output is correct
15 Correct 1947 ms 4240 KB Output is correct
16 Correct 1911 ms 8296 KB Output is correct
17 Correct 1900 ms 8316 KB Output is correct
18 Correct 1779 ms 10072 KB Output is correct
19 Correct 1847 ms 7064 KB Output is correct
20 Correct 1906 ms 8960 KB Output is correct
21 Correct 1934 ms 10804 KB Output is correct
22 Execution timed out 2040 ms 10996 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 244 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 134 ms 9808 KB Output is correct
12 Correct 156 ms 9828 KB Output is correct
13 Correct 140 ms 9804 KB Output is correct
14 Correct 162 ms 9808 KB Output is correct
15 Correct 143 ms 9976 KB Output is correct
16 Correct 198 ms 9792 KB Output is correct
17 Correct 159 ms 9808 KB Output is correct
18 Correct 125 ms 10064 KB Output is correct
19 Correct 130 ms 9812 KB Output is correct
20 Correct 135 ms 9832 KB Output is correct
21 Correct 153 ms 9912 KB Output is correct
22 Correct 162 ms 9748 KB Output is correct
23 Correct 135 ms 9796 KB Output is correct
24 Correct 142 ms 9968 KB Output is correct
25 Correct 168 ms 9792 KB Output is correct
26 Correct 126 ms 9700 KB Output is correct
27 Correct 131 ms 9796 KB Output is correct
28 Correct 130 ms 9704 KB Output is correct
29 Correct 139 ms 9808 KB Output is correct
30 Correct 144 ms 9920 KB Output is correct
31 Correct 132 ms 9808 KB Output is correct
32 Correct 169 ms 9832 KB Output is correct
33 Correct 165 ms 9808 KB Output is correct
34 Correct 124 ms 9700 KB Output is correct
35 Correct 149 ms 9816 KB Output is correct
36 Correct 156 ms 9884 KB Output is correct
37 Correct 152 ms 10064 KB Output is correct
38 Correct 149 ms 9828 KB Output is correct
39 Correct 152 ms 9804 KB Output is correct
40 Correct 148 ms 9828 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 244 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 1868 ms 4424 KB Output is correct
12 Correct 1929 ms 4072 KB Output is correct
13 Correct 1842 ms 3140 KB Output is correct
14 Correct 1860 ms 3312 KB Output is correct
15 Correct 1947 ms 4240 KB Output is correct
16 Correct 1911 ms 8296 KB Output is correct
17 Correct 1900 ms 8316 KB Output is correct
18 Correct 1779 ms 10072 KB Output is correct
19 Correct 1847 ms 7064 KB Output is correct
20 Correct 1906 ms 8960 KB Output is correct
21 Correct 1934 ms 10804 KB Output is correct
22 Execution timed out 2040 ms 10996 KB Time limit exceeded
23 Halted 0 ms 0 KB -