oj.uz

답안 #1106004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1106004 2024-10-28T17:44:47 Z 0x34c Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 591 ms 65536 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define endl '\n'

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_popcount(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_popcount(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:22:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for (int i = 0; i < s.size(); i++)
      |                     ~~^~~~~~~~~~
snake_escaping.cpp:52:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         for (int i = 0; i < t.size(); i++)
      |                         ~~^~~~~~~~~~
snake_escaping.cpp:73:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |             for (int j = 0; j < t.size(); j++)
      |                             ~~^~~~~~~~~~
snake_escaping.cpp:98:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |             for (int j = 0; j < t.size(); j++)
      |                             ~~^~~~~~~~~~
snake_escaping.cpp:124:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |             for (int j = 0; j < t.size(); j++)
      |                             ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 644 KB Output is correct
4 Correct 2 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 604 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 760 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 644 KB Output is correct
4 Correct 2 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 604 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 760 KB Output is correct
11 Correct 304 ms 4652 KB Output is correct
12 Correct 318 ms 4168 KB Output is correct
13 Correct 386 ms 3400 KB Output is correct
14 Correct 361 ms 3400 KB Output is correct
15 Correct 343 ms 4432 KB Output is correct
16 Correct 415 ms 3664 KB Output is correct
17 Correct 418 ms 3568 KB Output is correct
18 Correct 207 ms 5704 KB Output is correct
19 Correct 288 ms 2616 KB Output is correct
20 Correct 313 ms 4168 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 644 KB Output is correct
4 Correct 2 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 604 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 760 KB Output is correct
11 Correct 304 ms 4652 KB Output is correct
12 Correct 318 ms 4168 KB Output is correct
13 Correct 386 ms 3400 KB Output is correct
14 Correct 361 ms 3400 KB Output is correct
15 Correct 343 ms 4432 KB Output is correct
16 Correct 415 ms 3664 KB Output is correct
17 Correct 418 ms 3568 KB Output is correct
18 Correct 207 ms 5704 KB Output is correct
19 Correct 288 ms 2616 KB Output is correct
20 Correct 313 ms 4168 KB Output is correct
21 Correct 352 ms 5704 KB Output is correct
22 Correct 410 ms 6024 KB Output is correct
23 Correct 517 ms 4936 KB Output is correct
24 Correct 480 ms 4840 KB Output is correct
25 Correct 438 ms 6740 KB Output is correct
26 Correct 565 ms 5192 KB Output is correct
27 Correct 574 ms 5136 KB Output is correct
28 Correct 204 ms 7688 KB Output is correct
29 Correct 330 ms 3708 KB Output is correct
30 Correct 403 ms 6012 KB Output is correct
31 Correct 507 ms 5808 KB Output is correct
32 Correct 591 ms 5704 KB Output is correct
33 Correct 416 ms 4680 KB Output is correct
34 Correct 522 ms 4868 KB Output is correct
35 Correct 555 ms 5192 KB Output is correct
36 Correct 202 ms 3876 KB Output is correct
37 Correct 369 ms 5704 KB Output is correct
38 Correct 374 ms 3896 KB Output is correct
39 Correct 483 ms 5080 KB Output is correct
40 Correct 479 ms 4680 KB Output is correct

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 644 KB Output is correct
4 Correct 2 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 604 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 760 KB Output is correct
11 Runtime error 51 ms 65536 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 644 KB Output is correct
4 Correct 2 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 604 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 760 KB Output is correct
11 Correct 304 ms 4652 KB Output is correct
12 Correct 318 ms 4168 KB Output is correct
13 Correct 386 ms 3400 KB Output is correct
14 Correct 361 ms 3400 KB Output is correct
15 Correct 343 ms 4432 KB Output is correct
16 Correct 415 ms 3664 KB Output is correct
17 Correct 418 ms 3568 KB Output is correct
18 Correct 207 ms 5704 KB Output is correct
19 Correct 288 ms 2616 KB Output is correct
20 Correct 313 ms 4168 KB Output is correct
21 Correct 352 ms 5704 KB Output is correct
22 Correct 410 ms 6024 KB Output is correct
23 Correct 517 ms 4936 KB Output is correct
24 Correct 480 ms 4840 KB Output is correct
25 Correct 438 ms 6740 KB Output is correct
26 Correct 565 ms 5192 KB Output is correct
27 Correct 574 ms 5136 KB Output is correct
28 Correct 204 ms 7688 KB Output is correct
29 Correct 330 ms 3708 KB Output is correct
30 Correct 403 ms 6012 KB Output is correct
31 Correct 507 ms 5808 KB Output is correct
32 Correct 591 ms 5704 KB Output is correct
33 Correct 416 ms 4680 KB Output is correct
34 Correct 522 ms 4868 KB Output is correct
35 Correct 555 ms 5192 KB Output is correct
36 Correct 202 ms 3876 KB Output is correct
37 Correct 369 ms 5704 KB Output is correct
38 Correct 374 ms 3896 KB Output is correct
39 Correct 483 ms 5080 KB Output is correct
40 Correct 479 ms 4680 KB Output is correct
41 Runtime error 51 ms 65536 KB Execution killed with signal 9
42 Halted 0 ms 0 KB -