oj.uz

Submission #1106003

# Submission time Handle Problem Language Result Execution time Memory
1106003 2024-10-28T17:43:57 Z 0x34c Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 609 ms 65536 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define endl '\n'
#define int ll

using namespace std;

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int L, Q;
    cin >> L >> Q;

    string s;
    cin >> s;

    // in bm0, 1 = ?; in bm1, 0 = ?
    vector<vector<int>> bm0(1 << L, vector<int>(L + 1, 0)), bm1(1 << L, vector<int>(L + 1, 0));
    vector<int> val(1 << L, 0);
    for (int i = 0; i < s.size(); i++)
    {
        val[i] = s[i] - '0';
        bm0[i][0] = bm1[i][0] = val[i];
    }

    for (int j = 1; j <= L; j++)
        for (int i = 0; i < (1 << L); i++)
        {
            if (i & (1 << (j - 1)))
            {
                bm0[i][j] = bm0[i][j - 1] + bm0[i ^ (1 << (j - 1))][j - 1];
                bm1[i][j] = bm1[i][j - 1];
            }
            else
            {
                bm0[i][j] = bm0[i][j - 1];
                bm1[i][j] = bm1[i][j - 1] + bm1[i ^ (1 << (j - 1))][j - 1];
            }
        }

    while (Q--)
    {
        string t;
        cin >> t;

        int sz = t.size() - 1;

        int cnt_0 = 0, cnt_1 = 0, cnt_q = 0;
        vector<int> p0, p1, pq;
        for (int i = 0; i < t.size(); i++)
            if (t[i] == '0')
            {
                cnt_0++;
                p0.push_back(i);
            }
            else if (t[i] == '1')
            {
                cnt_1++;
                p1.push_back(i);
            }
            else
            {
                cnt_q++;
                pq.push_back(i);
            }

        int mn = min({cnt_0, cnt_1, cnt_q});
        if (mn == cnt_q)
        {
            int bit = 0;
            for (int j = 0; j < t.size(); j++)
            {
                if (t[j] == '1')
                    bit |= (1 << (sz - j));
            }

            int res = 0;
            for (int add = 0; add < (1 << cnt_q); add++)
            {
                int bit2 = bit;
                for (int j = 0; j < cnt_q; j++)
                {
                    if (add & (1 << j))
                        bit2 |= (1 << (sz - pq[j]));
                }

                res += val[bit2];
            }

            cout << res << endl;
        }
        else if (mn == cnt_0)
        {
            // we do PIE
            int bit = 0;
            for (int j = 0; j < t.size(); j++)
            {
                if (t[j] == '1')
                    bit |= (1 << (sz - j));
            }

            int res = 0;
            for (int add = 0; add < (1 << cnt_0); add++)
            {
                int bit2 = bit;
                int cnt = __builtin_popcountll(add);
                for (int j = 0; j < cnt_0; j++)
                {
                    if (add & (1 << j))
                        bit2 |= (1 << (sz - p0[j]));
                }

                res += (cnt % 2 == 1 ? -1 : 1) * bm1[bit2][L];
            }

            cout << res << endl;
        }
        else
        {
            // we do PIE too
            int bit = 0;
            for (int j = 0; j < t.size(); j++)
            {
                if (t[j] == '1' || t[j] == '?')
                    bit |= (1 << (sz - j));
            }

            int res = 0;
            for (int add = 0; add < (1 << cnt_1); add++)
            {
                int bit2 = bit;
                int cnt = __builtin_popcountll(add);
                for (int j = 0; j < cnt_1; j++)
                {
                    if (add & (1 << j))
                        bit2 ^= (1 << (sz - p1[j]));
                }

                res += (cnt % 2 == 1 ? -1 : 1) * bm0[bit2][L];
            }

            cout << res << endl;
        }
    }
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:23:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for (int i = 0; i < s.size(); i++)
      |                     ~~^~~~~~~~~~
snake_escaping.cpp:53:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         for (int i = 0; i < t.size(); i++)
      |                         ~~^~~~~~~~~~
snake_escaping.cpp:74:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |             for (int j = 0; j < t.size(); j++)
      |                             ~~^~~~~~~~~~
snake_escaping.cpp:99:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |             for (int j = 0; j < t.size(); j++)
      |                             ~~^~~~~~~~~~
snake_escaping.cpp:125:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |             for (int j = 0; j < t.size(); j++)
      |                             ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 316 ms 15228 KB Output is correct
12 Correct 346 ms 14920 KB Output is correct
13 Correct 407 ms 14152 KB Output is correct
14 Correct 401 ms 14408 KB Output is correct
15 Correct 357 ms 15432 KB Output is correct
16 Correct 412 ms 14400 KB Output is correct
17 Correct 448 ms 14408 KB Output is correct
18 Correct 225 ms 16400 KB Output is correct
19 Correct 312 ms 13432 KB Output is correct
20 Correct 321 ms 14916 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 316 ms 15228 KB Output is correct
12 Correct 346 ms 14920 KB Output is correct
13 Correct 407 ms 14152 KB Output is correct
14 Correct 401 ms 14408 KB Output is correct
15 Correct 357 ms 15432 KB Output is correct
16 Correct 412 ms 14400 KB Output is correct
17 Correct 448 ms 14408 KB Output is correct
18 Correct 225 ms 16400 KB Output is correct
19 Correct 312 ms 13432 KB Output is correct
20 Correct 321 ms 14916 KB Output is correct
21 Correct 374 ms 20552 KB Output is correct
22 Correct 458 ms 20740 KB Output is correct
23 Correct 521 ms 19784 KB Output is correct
24 Correct 491 ms 19528 KB Output is correct
25 Correct 446 ms 21576 KB Output is correct
26 Correct 561 ms 20064 KB Output is correct
27 Correct 540 ms 20040 KB Output is correct
28 Correct 210 ms 22648 KB Output is correct
29 Correct 338 ms 18504 KB Output is correct
30 Correct 413 ms 20664 KB Output is correct
31 Correct 542 ms 20552 KB Output is correct
32 Correct 609 ms 20452 KB Output is correct
33 Correct 437 ms 19536 KB Output is correct
34 Correct 536 ms 19436 KB Output is correct
35 Correct 571 ms 20044 KB Output is correct
36 Correct 212 ms 18504 KB Output is correct
37 Correct 391 ms 20640 KB Output is correct
38 Correct 392 ms 18504 KB Output is correct
39 Correct 496 ms 19688 KB Output is correct
40 Correct 514 ms 19612 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Runtime error 46 ms 65536 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 316 ms 15228 KB Output is correct
12 Correct 346 ms 14920 KB Output is correct
13 Correct 407 ms 14152 KB Output is correct
14 Correct 401 ms 14408 KB Output is correct
15 Correct 357 ms 15432 KB Output is correct
16 Correct 412 ms 14400 KB Output is correct
17 Correct 448 ms 14408 KB Output is correct
18 Correct 225 ms 16400 KB Output is correct
19 Correct 312 ms 13432 KB Output is correct
20 Correct 321 ms 14916 KB Output is correct
21 Correct 374 ms 20552 KB Output is correct
22 Correct 458 ms 20740 KB Output is correct
23 Correct 521 ms 19784 KB Output is correct
24 Correct 491 ms 19528 KB Output is correct
25 Correct 446 ms 21576 KB Output is correct
26 Correct 561 ms 20064 KB Output is correct
27 Correct 540 ms 20040 KB Output is correct
28 Correct 210 ms 22648 KB Output is correct
29 Correct 338 ms 18504 KB Output is correct
30 Correct 413 ms 20664 KB Output is correct
31 Correct 542 ms 20552 KB Output is correct
32 Correct 609 ms 20452 KB Output is correct
33 Correct 437 ms 19536 KB Output is correct
34 Correct 536 ms 19436 KB Output is correct
35 Correct 571 ms 20044 KB Output is correct
36 Correct 212 ms 18504 KB Output is correct
37 Correct 391 ms 20640 KB Output is correct
38 Correct 392 ms 18504 KB Output is correct
39 Correct 496 ms 19688 KB Output is correct
40 Correct 514 ms 19612 KB Output is correct
41 Runtime error 46 ms 65536 KB Execution killed with signal 9
42 Halted 0 ms 0 KB -