oj.uz

답안 #719213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
719213 2023-04-05T16:21:37 Z ssense Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 15804 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)
{
    int sum = 0;
    for(int i = 0; i < 1<<qm; i++)
    {
        int now = 0;
        int idx = 0;
        for(int j = 0; j < n; j++)
        {
            if(t[j] == '1')
            {
                now+=1<<j;
            }
            if(t[j] == '?')
            {
                if(i & (1<<idx))
                {
                    now+=1<<j;
                }
                idx++;
            }
        }
        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_B(std::string)':
snake_escaping.cpp:76:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |         for(int i = 0; i < pos.size(); i++)
      |                        ~~^~~~~~~~~~~~
snake_escaping.cpp: In function 'int answer_A(std::string)':
snake_escaping.cpp:108:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |         for(int i = 0; i < pos.size(); i++)
      |                        ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 2 ms 348 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

# 결과 실행 시간 메모리 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 2 ms 348 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 238 ms 4316 KB Output is correct
12 Correct 266 ms 3992 KB Output is correct
13 Correct 531 ms 3252 KB Output is correct
14 Correct 597 ms 3336 KB Output is correct
15 Correct 388 ms 4252 KB Output is correct
16 Correct 681 ms 3516 KB Output is correct
17 Correct 518 ms 3380 KB Output is correct
18 Correct 190 ms 5252 KB Output is correct
19 Correct 243 ms 2272 KB Output is correct
20 Correct 305 ms 3972 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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 2 ms 348 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 238 ms 4316 KB Output is correct
12 Correct 266 ms 3992 KB Output is correct
13 Correct 531 ms 3252 KB Output is correct
14 Correct 597 ms 3336 KB Output is correct
15 Correct 388 ms 4252 KB Output is correct
16 Correct 681 ms 3516 KB Output is correct
17 Correct 518 ms 3380 KB Output is correct
18 Correct 190 ms 5252 KB Output is correct
19 Correct 243 ms 2272 KB Output is correct
20 Correct 305 ms 3972 KB Output is correct
21 Correct 375 ms 4324 KB Output is correct
22 Correct 397 ms 4508 KB Output is correct
23 Correct 752 ms 3496 KB Output is correct
24 Correct 717 ms 3312 KB Output is correct
25 Correct 454 ms 5336 KB Output is correct
26 Correct 1111 ms 3880 KB Output is correct
27 Correct 806 ms 3824 KB Output is correct
28 Correct 210 ms 6396 KB Output is correct
29 Correct 367 ms 2348 KB Output is correct
30 Correct 360 ms 4560 KB Output is correct
31 Correct 569 ms 4416 KB Output is correct
32 Correct 658 ms 4324 KB Output is correct
33 Correct 451 ms 3244 KB Output is correct
34 Correct 928 ms 3424 KB Output is correct
35 Correct 796 ms 3880 KB Output is correct
36 Correct 216 ms 2400 KB Output is correct
37 Correct 325 ms 4356 KB Output is correct
38 Correct 308 ms 2388 KB Output is correct
39 Correct 717 ms 3504 KB Output is correct
40 Correct 1808 ms 3524 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 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 2 ms 348 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 80 ms 9812 KB Output is correct
12 Correct 72 ms 9928 KB Output is correct
13 Correct 117 ms 9808 KB Output is correct
14 Correct 158 ms 9836 KB Output is correct
15 Correct 89 ms 9884 KB Output is correct
16 Correct 199 ms 9816 KB Output is correct
17 Correct 168 ms 9800 KB Output is correct
18 Correct 84 ms 9960 KB Output is correct
19 Correct 66 ms 9672 KB Output is correct
20 Correct 68 ms 9836 KB Output is correct
21 Correct 96 ms 9800 KB Output is correct
22 Correct 151 ms 9768 KB Output is correct
23 Correct 85 ms 9768 KB Output is correct
24 Correct 234 ms 9860 KB Output is correct
25 Correct 156 ms 9972 KB Output is correct
26 Correct 56 ms 9684 KB Output is correct
27 Correct 68 ms 9960 KB Output is correct
28 Correct 69 ms 9752 KB Output is correct
29 Correct 161 ms 9800 KB Output is correct
30 Correct 345 ms 9748 KB Output is correct
31 Correct 94 ms 9736 KB Output is correct
32 Correct 158 ms 9964 KB Output is correct
33 Correct 158 ms 9836 KB Output is correct
34 Correct 70 ms 9672 KB Output is correct
35 Correct 130 ms 9824 KB Output is correct
36 Correct 128 ms 9808 KB Output is correct
37 Correct 120 ms 9848 KB Output is correct
38 Correct 132 ms 9812 KB Output is correct
39 Correct 122 ms 9816 KB Output is correct
40 Correct 125 ms 9860 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 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 2 ms 348 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 238 ms 4316 KB Output is correct
12 Correct 266 ms 3992 KB Output is correct
13 Correct 531 ms 3252 KB Output is correct
14 Correct 597 ms 3336 KB Output is correct
15 Correct 388 ms 4252 KB Output is correct
16 Correct 681 ms 3516 KB Output is correct
17 Correct 518 ms 3380 KB Output is correct
18 Correct 190 ms 5252 KB Output is correct
19 Correct 243 ms 2272 KB Output is correct
20 Correct 305 ms 3972 KB Output is correct
21 Correct 375 ms 4324 KB Output is correct
22 Correct 397 ms 4508 KB Output is correct
23 Correct 752 ms 3496 KB Output is correct
24 Correct 717 ms 3312 KB Output is correct
25 Correct 454 ms 5336 KB Output is correct
26 Correct 1111 ms 3880 KB Output is correct
27 Correct 806 ms 3824 KB Output is correct
28 Correct 210 ms 6396 KB Output is correct
29 Correct 367 ms 2348 KB Output is correct
30 Correct 360 ms 4560 KB Output is correct
31 Correct 569 ms 4416 KB Output is correct
32 Correct 658 ms 4324 KB Output is correct
33 Correct 451 ms 3244 KB Output is correct
34 Correct 928 ms 3424 KB Output is correct
35 Correct 796 ms 3880 KB Output is correct
36 Correct 216 ms 2400 KB Output is correct
37 Correct 325 ms 4356 KB Output is correct
38 Correct 308 ms 2388 KB Output is correct
39 Correct 717 ms 3504 KB Output is correct
40 Correct 1808 ms 3524 KB Output is correct
41 Correct 80 ms 9812 KB Output is correct
42 Correct 72 ms 9928 KB Output is correct
43 Correct 117 ms 9808 KB Output is correct
44 Correct 158 ms 9836 KB Output is correct
45 Correct 89 ms 9884 KB Output is correct
46 Correct 199 ms 9816 KB Output is correct
47 Correct 168 ms 9800 KB Output is correct
48 Correct 84 ms 9960 KB Output is correct
49 Correct 66 ms 9672 KB Output is correct
50 Correct 68 ms 9836 KB Output is correct
51 Correct 96 ms 9800 KB Output is correct
52 Correct 151 ms 9768 KB Output is correct
53 Correct 85 ms 9768 KB Output is correct
54 Correct 234 ms 9860 KB Output is correct
55 Correct 156 ms 9972 KB Output is correct
56 Correct 56 ms 9684 KB Output is correct
57 Correct 68 ms 9960 KB Output is correct
58 Correct 69 ms 9752 KB Output is correct
59 Correct 161 ms 9800 KB Output is correct
60 Correct 345 ms 9748 KB Output is correct
61 Correct 94 ms 9736 KB Output is correct
62 Correct 158 ms 9964 KB Output is correct
63 Correct 158 ms 9836 KB Output is correct
64 Correct 70 ms 9672 KB Output is correct
65 Correct 130 ms 9824 KB Output is correct
66 Correct 128 ms 9808 KB Output is correct
67 Correct 120 ms 9848 KB Output is correct
68 Correct 132 ms 9812 KB Output is correct
69 Correct 122 ms 9816 KB Output is correct
70 Correct 125 ms 9860 KB Output is correct
71 Correct 435 ms 14800 KB Output is correct
72 Correct 487 ms 14740 KB Output is correct
73 Correct 1260 ms 13316 KB Output is correct
74 Correct 1786 ms 13648 KB Output is correct
75 Correct 618 ms 15804 KB Output is correct
76 Execution timed out 2087 ms 14832 KB Time limit exceeded
77 Halted 0 ms 0 KB -