oj.uz

Submission #719226

# Submission time Handle Problem Language Result Execution time Memory
719226 2023-04-05T16:34:26 Z ssense Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 14812 KB 
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
//#pragma GCC optimize("Ofast")
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
//#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);}int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}//mesanu

int n, q;
string s;

int answer_C(string t, int qm)
{
    vector<int> pos;
    int base = 0;
    for(int i = 0; i < n; i++)
    {
        if(t[i] == '?')
        {
            pos.pb(i);
        }
        if(t[i] == '1')
        {
            base+=1<<i;
        }
    }
    int sum = 0;
    for(int i = 0; i < 1<<qm; i++)
    {
        int now = base;
        for(int j = 0; j < pos.size(); j++)
        {
            if(i & (1<<j))
            {
                now+=1<<pos[j];
            }
        }
        sum+=(s[now]-'0');
    }
    return sum;
}

int sub[(1<<20)+5];
int super[(1<<20)+5];

int answer_B(string t)
{
    vector<int> pos;
    int base = 0;
    for(int i = 0; i < n; i++)
    {
        if(t[i] == '1')
        {
            pos.pb(i);
        }
        if(t[i] == '?')
        {
            base+=1<<i;
        }
    }
    int sum = 0;
    int sz = pos.size();
    for(int mask = (1<<sz)-1; mask >= 0; mask--)
    {
        int now = base;
        for(int i = 0; i < pos.size(); i++)
        {
            if(mask & (1<<i))
            {
                now+=1<<pos[i];
            }
        }
        sum+=sub[now]*power(-1, sz-__builtin_popcount(mask), MOD);
    }
    return sum;
}

int answer_A(string t)
{
    vector<int> pos;
    int base = 0;
    for(int i = 0; i < n; i++)
    {
        if(t[i] == '0')
        {
            pos.pb(i);
        }
        if(t[i] == '1')
        {
            base+=1<<i;
        }
    }
    int sum = 0;
    int sz = pos.size();
    for(int mask = 0; mask < 1<<sz; mask++)
    {
        int now = base;
        for(int i = 0; i < pos.size(); i++)
        {
            if(mask & (1<<i))
            {
                now+=1<<pos[i];
            }
        }
        sum+=super[now]*power(-1, __builtin_popcount(mask), MOD);
    }
    return sum;
}

void solve()
{
    cin >> n >> q;
    cin >> s;
    for(int i = 0; i < 1<<n; i++)
    {
        sub[i] = (s[i]-'0');
        super[i] = (s[i]-'0');
    }
    for(int i = 0; i < n; i++)
    {
        for(int mask = 0; mask < 1<< n; mask++)
        {
            if(mask & 1<<i)
            {
                sub[mask]+=sub[mask^(1<<i)];
            }
        }
    }
    for(int i = n-1; i >= 0; i--)
    {
        for(int mask = (1<<n)-1; mask >= 0; mask--)
        {
            if(!(mask&(1<<i)))
            {
                super[mask]+=super[mask^(1<<i)];
            }
        }
    }
    while(q--)
    {
        string t;
        cin >> t;
        reverse(all(t));
        int qm = 0, ones = 0, zeros = 0;
        for(int i = 0; i < n; i++)
        {
            if(t[i] == '?'){qm++;}
            if(t[i] == '1'){ones++;}
            if(t[i] == '0'){zeros++;}
        }
        //cout << answer_A(t) << endl;
        if(ones == min({qm, ones, zeros}))
        {
            cout << answer_B(t) << endl;
        }
        else if(qm == min({qm, ones, zeros}))
        {
            cout << answer_C(t, qm) << endl;
        }
        else
        {
            cout << answer_A(t) << endl;
        }
    }
}

int32_t main(){
    startt
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}
/*
3 5
12345678
000
0??
1?0
?11
???
*/

Compilation message

snake_escaping.cpp: In function 'int answer_C(std::string, int)':
snake_escaping.cpp:45:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for(int j = 0; j < pos.size(); j++)
      |                        ~~^~~~~~~~~~~~
snake_escaping.cpp: In function 'int answer_B(std::string)':
snake_escaping.cpp:80:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for(int i = 0; i < pos.size(); i++)
      |                        ~~^~~~~~~~~~~~
snake_escaping.cpp: In function 'int answer_A(std::string)':
snake_escaping.cpp:112:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |         for(int i = 0; i < pos.size(); i++)
      |                        ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 263 ms 4348 KB Output is correct
12 Correct 303 ms 4060 KB Output is correct
13 Correct 376 ms 3152 KB Output is correct
14 Correct 496 ms 3268 KB Output is correct
15 Correct 364 ms 4308 KB Output is correct
16 Correct 463 ms 3484 KB Output is correct
17 Correct 436 ms 3432 KB Output is correct
18 Correct 202 ms 5300 KB Output is correct
19 Correct 246 ms 2256 KB Output is correct
20 Correct 287 ms 3972 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 263 ms 4348 KB Output is correct
12 Correct 303 ms 4060 KB Output is correct
13 Correct 376 ms 3152 KB Output is correct
14 Correct 496 ms 3268 KB Output is correct
15 Correct 364 ms 4308 KB Output is correct
16 Correct 463 ms 3484 KB Output is correct
17 Correct 436 ms 3432 KB Output is correct
18 Correct 202 ms 5300 KB Output is correct
19 Correct 246 ms 2256 KB Output is correct
20 Correct 287 ms 3972 KB Output is correct
21 Correct 299 ms 4360 KB Output is correct
22 Correct 373 ms 4672 KB Output is correct
23 Correct 533 ms 3656 KB Output is correct
24 Correct 722 ms 3336 KB Output is correct
25 Correct 484 ms 5412 KB Output is correct
26 Correct 606 ms 3916 KB Output is correct
27 Correct 569 ms 3840 KB Output is correct
28 Correct 223 ms 6408 KB Output is correct
29 Correct 315 ms 2328 KB Output is correct
30 Correct 329 ms 4592 KB Output is correct
31 Correct 580 ms 4376 KB Output is correct
32 Correct 725 ms 4316 KB Output is correct
33 Correct 423 ms 3436 KB Output is correct
34 Correct 596 ms 3380 KB Output is correct
35 Correct 586 ms 3784 KB Output is correct
36 Correct 219 ms 2392 KB Output is correct
37 Correct 341 ms 4424 KB Output is correct
38 Correct 342 ms 2404 KB Output is correct
39 Correct 526 ms 3624 KB Output is correct
40 Correct 574 ms 3388 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 73 ms 9800 KB Output is correct
12 Correct 85 ms 9828 KB Output is correct
13 Correct 124 ms 9800 KB Output is correct
14 Correct 166 ms 9824 KB Output is correct
15 Correct 76 ms 9868 KB Output is correct
16 Correct 139 ms 9804 KB Output is correct
17 Correct 131 ms 9816 KB Output is correct
18 Correct 81 ms 10032 KB Output is correct
19 Correct 87 ms 9672 KB Output is correct
20 Correct 135 ms 9836 KB Output is correct
21 Correct 98 ms 9864 KB Output is correct
22 Correct 144 ms 9804 KB Output is correct
23 Correct 95 ms 9812 KB Output is correct
24 Correct 182 ms 9856 KB Output is correct
25 Correct 141 ms 9928 KB Output is correct
26 Correct 65 ms 9684 KB Output is correct
27 Correct 99 ms 9800 KB Output is correct
28 Correct 69 ms 9728 KB Output is correct
29 Correct 92 ms 9836 KB Output is correct
30 Correct 116 ms 9796 KB Output is correct
31 Correct 81 ms 9804 KB Output is correct
32 Correct 147 ms 9876 KB Output is correct
33 Correct 134 ms 9780 KB Output is correct
34 Correct 62 ms 9732 KB Output is correct
35 Correct 123 ms 9828 KB Output is correct
36 Correct 119 ms 9796 KB Output is correct
37 Correct 105 ms 9928 KB Output is correct
38 Correct 120 ms 9752 KB Output is correct
39 Correct 152 ms 9804 KB Output is correct
40 Correct 108 ms 9816 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 263 ms 4348 KB Output is correct
12 Correct 303 ms 4060 KB Output is correct
13 Correct 376 ms 3152 KB Output is correct
14 Correct 496 ms 3268 KB Output is correct
15 Correct 364 ms 4308 KB Output is correct
16 Correct 463 ms 3484 KB Output is correct
17 Correct 436 ms 3432 KB Output is correct
18 Correct 202 ms 5300 KB Output is correct
19 Correct 246 ms 2256 KB Output is correct
20 Correct 287 ms 3972 KB Output is correct
21 Correct 299 ms 4360 KB Output is correct
22 Correct 373 ms 4672 KB Output is correct
23 Correct 533 ms 3656 KB Output is correct
24 Correct 722 ms 3336 KB Output is correct
25 Correct 484 ms 5412 KB Output is correct
26 Correct 606 ms 3916 KB Output is correct
27 Correct 569 ms 3840 KB Output is correct
28 Correct 223 ms 6408 KB Output is correct
29 Correct 315 ms 2328 KB Output is correct
30 Correct 329 ms 4592 KB Output is correct
31 Correct 580 ms 4376 KB Output is correct
32 Correct 725 ms 4316 KB Output is correct
33 Correct 423 ms 3436 KB Output is correct
34 Correct 596 ms 3380 KB Output is correct
35 Correct 586 ms 3784 KB Output is correct
36 Correct 219 ms 2392 KB Output is correct
37 Correct 341 ms 4424 KB Output is correct
38 Correct 342 ms 2404 KB Output is correct
39 Correct 526 ms 3624 KB Output is correct
40 Correct 574 ms 3388 KB Output is correct
41 Correct 73 ms 9800 KB Output is correct
42 Correct 85 ms 9828 KB Output is correct
43 Correct 124 ms 9800 KB Output is correct
44 Correct 166 ms 9824 KB Output is correct
45 Correct 76 ms 9868 KB Output is correct
46 Correct 139 ms 9804 KB Output is correct
47 Correct 131 ms 9816 KB Output is correct
48 Correct 81 ms 10032 KB Output is correct
49 Correct 87 ms 9672 KB Output is correct
50 Correct 135 ms 9836 KB Output is correct
51 Correct 98 ms 9864 KB Output is correct
52 Correct 144 ms 9804 KB Output is correct
53 Correct 95 ms 9812 KB Output is correct
54 Correct 182 ms 9856 KB Output is correct
55 Correct 141 ms 9928 KB Output is correct
56 Correct 65 ms 9684 KB Output is correct
57 Correct 99 ms 9800 KB Output is correct
58 Correct 69 ms 9728 KB Output is correct
59 Correct 92 ms 9836 KB Output is correct
60 Correct 116 ms 9796 KB Output is correct
61 Correct 81 ms 9804 KB Output is correct
62 Correct 147 ms 9876 KB Output is correct
63 Correct 134 ms 9780 KB Output is correct
64 Correct 62 ms 9732 KB Output is correct
65 Correct 123 ms 9828 KB Output is correct
66 Correct 119 ms 9796 KB Output is correct
67 Correct 105 ms 9928 KB Output is correct
68 Correct 120 ms 9752 KB Output is correct
69 Correct 152 ms 9804 KB Output is correct
70 Correct 108 ms 9816 KB Output is correct
71 Correct 634 ms 14752 KB Output is correct
72 Correct 605 ms 14812 KB Output is correct
73 Correct 1134 ms 13364 KB Output is correct
74 Execution timed out 2065 ms 12648 KB Time limit exceeded
75 Halted 0 ms 0 KB -