oj.uz

답안 #719212

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
719212 2023-04-05T16:21:25 Z ssense Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 37192 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 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 344 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 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 344 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 227 ms 4352 KB Output is correct
12 Correct 265 ms 4004 KB Output is correct
13 Correct 449 ms 3156 KB Output is correct
14 Correct 485 ms 3404 KB Output is correct
15 Correct 346 ms 4284 KB Output is correct
16 Correct 580 ms 3516 KB Output is correct
17 Correct 468 ms 3404 KB Output is correct
18 Correct 174 ms 5288 KB Output is correct
19 Correct 210 ms 2264 KB Output is correct
20 Correct 251 ms 4036 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 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 344 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 227 ms 4352 KB Output is correct
12 Correct 265 ms 4004 KB Output is correct
13 Correct 449 ms 3156 KB Output is correct
14 Correct 485 ms 3404 KB Output is correct
15 Correct 346 ms 4284 KB Output is correct
16 Correct 580 ms 3516 KB Output is correct
17 Correct 468 ms 3404 KB Output is correct
18 Correct 174 ms 5288 KB Output is correct
19 Correct 210 ms 2264 KB Output is correct
20 Correct 251 ms 4036 KB Output is correct
21 Correct 268 ms 4320 KB Output is correct
22 Correct 307 ms 4556 KB Output is correct
23 Correct 692 ms 3520 KB Output is correct
24 Correct 706 ms 3584 KB Output is correct
25 Correct 589 ms 5432 KB Output is correct
26 Correct 978 ms 3924 KB Output is correct
27 Correct 747 ms 3792 KB Output is correct
28 Correct 198 ms 6420 KB Output is correct
29 Correct 292 ms 2296 KB Output is correct
30 Correct 378 ms 4488 KB Output is correct
31 Correct 611 ms 4376 KB Output is correct
32 Correct 762 ms 4312 KB Output is correct
33 Correct 524 ms 3308 KB Output is correct
34 Correct 910 ms 3452 KB Output is correct
35 Correct 807 ms 3844 KB Output is correct
36 Correct 218 ms 2392 KB Output is correct
37 Correct 319 ms 4356 KB Output is correct
38 Correct 370 ms 2400 KB Output is correct
39 Correct 779 ms 3572 KB Output is correct
40 Correct 1905 ms 3388 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 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 344 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 79 ms 9796 KB Output is correct
12 Correct 77 ms 9812 KB Output is correct
13 Correct 149 ms 9832 KB Output is correct
14 Correct 139 ms 9852 KB Output is correct
15 Correct 106 ms 9928 KB Output is correct
16 Correct 225 ms 9800 KB Output is correct
17 Correct 169 ms 9852 KB Output is correct
18 Correct 92 ms 10060 KB Output is correct
19 Correct 73 ms 9732 KB Output is correct
20 Correct 65 ms 9928 KB Output is correct
21 Correct 97 ms 9804 KB Output is correct
22 Correct 182 ms 9768 KB Output is correct
23 Correct 109 ms 9796 KB Output is correct
24 Correct 248 ms 9860 KB Output is correct
25 Correct 171 ms 9856 KB Output is correct
26 Correct 58 ms 9708 KB Output is correct
27 Correct 66 ms 9852 KB Output is correct
28 Correct 88 ms 9696 KB Output is correct
29 Correct 147 ms 9804 KB Output is correct
30 Correct 336 ms 9828 KB Output is correct
31 Correct 81 ms 9760 KB Output is correct
32 Correct 145 ms 9800 KB Output is correct
33 Correct 150 ms 9800 KB Output is correct
34 Correct 71 ms 9676 KB Output is correct
35 Correct 163 ms 9808 KB Output is correct
36 Correct 133 ms 9832 KB Output is correct
37 Correct 127 ms 9944 KB Output is correct
38 Correct 133 ms 9940 KB Output is correct
39 Correct 125 ms 9840 KB Output is correct
40 Correct 144 ms 9812 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 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 344 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 227 ms 4352 KB Output is correct
12 Correct 265 ms 4004 KB Output is correct
13 Correct 449 ms 3156 KB Output is correct
14 Correct 485 ms 3404 KB Output is correct
15 Correct 346 ms 4284 KB Output is correct
16 Correct 580 ms 3516 KB Output is correct
17 Correct 468 ms 3404 KB Output is correct
18 Correct 174 ms 5288 KB Output is correct
19 Correct 210 ms 2264 KB Output is correct
20 Correct 251 ms 4036 KB Output is correct
21 Correct 268 ms 4320 KB Output is correct
22 Correct 307 ms 4556 KB Output is correct
23 Correct 692 ms 3520 KB Output is correct
24 Correct 706 ms 3584 KB Output is correct
25 Correct 589 ms 5432 KB Output is correct
26 Correct 978 ms 3924 KB Output is correct
27 Correct 747 ms 3792 KB Output is correct
28 Correct 198 ms 6420 KB Output is correct
29 Correct 292 ms 2296 KB Output is correct
30 Correct 378 ms 4488 KB Output is correct
31 Correct 611 ms 4376 KB Output is correct
32 Correct 762 ms 4312 KB Output is correct
33 Correct 524 ms 3308 KB Output is correct
34 Correct 910 ms 3452 KB Output is correct
35 Correct 807 ms 3844 KB Output is correct
36 Correct 218 ms 2392 KB Output is correct
37 Correct 319 ms 4356 KB Output is correct
38 Correct 370 ms 2400 KB Output is correct
39 Correct 779 ms 3572 KB Output is correct
40 Correct 1905 ms 3388 KB Output is correct
41 Correct 79 ms 9796 KB Output is correct
42 Correct 77 ms 9812 KB Output is correct
43 Correct 149 ms 9832 KB Output is correct
44 Correct 139 ms 9852 KB Output is correct
45 Correct 106 ms 9928 KB Output is correct
46 Correct 225 ms 9800 KB Output is correct
47 Correct 169 ms 9852 KB Output is correct
48 Correct 92 ms 10060 KB Output is correct
49 Correct 73 ms 9732 KB Output is correct
50 Correct 65 ms 9928 KB Output is correct
51 Correct 97 ms 9804 KB Output is correct
52 Correct 182 ms 9768 KB Output is correct
53 Correct 109 ms 9796 KB Output is correct
54 Correct 248 ms 9860 KB Output is correct
55 Correct 171 ms 9856 KB Output is correct
56 Correct 58 ms 9708 KB Output is correct
57 Correct 66 ms 9852 KB Output is correct
58 Correct 88 ms 9696 KB Output is correct
59 Correct 147 ms 9804 KB Output is correct
60 Correct 336 ms 9828 KB Output is correct
61 Correct 81 ms 9760 KB Output is correct
62 Correct 145 ms 9800 KB Output is correct
63 Correct 150 ms 9800 KB Output is correct
64 Correct 71 ms 9676 KB Output is correct
65 Correct 163 ms 9808 KB Output is correct
66 Correct 133 ms 9832 KB Output is correct
67 Correct 127 ms 9944 KB Output is correct
68 Correct 133 ms 9940 KB Output is correct
69 Correct 125 ms 9840 KB Output is correct
70 Correct 144 ms 9812 KB Output is correct
71 Correct 523 ms 14700 KB Output is correct
72 Correct 512 ms 14832 KB Output is correct
73 Correct 1246 ms 13412 KB Output is correct
74 Correct 1808 ms 16924 KB Output is correct
75 Correct 710 ms 37192 KB Output is correct
76 Execution timed out 2027 ms 25168 KB Time limit exceeded
77 Halted 0 ms 0 KB -