oj.uz

Submission #391449

# Submission time Handle Problem Language Result Execution time Memory
391449 2021-04-18T19:05:33 Z iANikzad Snake Escaping (JOI18_snake_escaping) C++14
58 / 100
 2000 ms 19652 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 3 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 3 ms 324 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 3 ms 324 KB Output is correct
11 Correct 1887 ms 10444 KB Output is correct
12 Correct 1937 ms 8760 KB Output is correct
13 Correct 1906 ms 7956 KB Output is correct
14 Correct 1876 ms 8064 KB Output is correct
15 Execution timed out 2012 ms 9032 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 3 ms 324 KB Output is correct
11 Correct 1887 ms 10444 KB Output is correct
12 Correct 1937 ms 8760 KB Output is correct
13 Correct 1906 ms 7956 KB Output is correct
14 Correct 1876 ms 8064 KB Output is correct
15 Execution timed out 2012 ms 9032 KB Time limit exceeded
16 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 3 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 3 ms 324 KB Output is correct
11 Correct 183 ms 19468 KB Output is correct
12 Correct 155 ms 19528 KB Output is correct
13 Correct 155 ms 19488 KB Output is correct
14 Correct 211 ms 19472 KB Output is correct
15 Correct 156 ms 19556 KB Output is correct
16 Correct 201 ms 19508 KB Output is correct
17 Correct 184 ms 19408 KB Output is correct
18 Correct 142 ms 19652 KB Output is correct
19 Correct 145 ms 19372 KB Output is correct
20 Correct 155 ms 19544 KB Output is correct
21 Correct 177 ms 19500 KB Output is correct
22 Correct 211 ms 19428 KB Output is correct
23 Correct 163 ms 19432 KB Output is correct
24 Correct 166 ms 19520 KB Output is correct
25 Correct 212 ms 19532 KB Output is correct
26 Correct 142 ms 19300 KB Output is correct
27 Correct 154 ms 19504 KB Output is correct
28 Correct 147 ms 19404 KB Output is correct
29 Correct 155 ms 19404 KB Output is correct
30 Correct 173 ms 19424 KB Output is correct
31 Correct 157 ms 19588 KB Output is correct
32 Correct 205 ms 19496 KB Output is correct
33 Correct 186 ms 19464 KB Output is correct
34 Correct 137 ms 19408 KB Output is correct
35 Correct 175 ms 19500 KB Output is correct
36 Correct 174 ms 19428 KB Output is correct
37 Correct 176 ms 19500 KB Output is correct
38 Correct 171 ms 19472 KB Output is correct
39 Correct 172 ms 19412 KB Output is correct
40 Correct 171 ms 19428 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 3 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 3 ms 324 KB Output is correct
11 Correct 1887 ms 10444 KB Output is correct
12 Correct 1937 ms 8760 KB Output is correct
13 Correct 1906 ms 7956 KB Output is correct
14 Correct 1876 ms 8064 KB Output is correct
15 Execution timed out 2012 ms 9032 KB Time limit exceeded
16 Halted 0 ms 0 KB -