oj.uz

답안 #719200

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
719200 2023-04-05T16:06:16 Z ssense Snake Escaping (JOI18_snake_escaping) C++14
65 / 100
 2000 ms 20136 KB 
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
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 <= 6)
        {
            cout << answer_B(t) << endl;
        }
        else if(qm <= 6)
        {
            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:75:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |         for(int i = 0; i < pos.size(); i++)
      |                        ~~^~~~~~~~~~~~
snake_escaping.cpp: In function 'int answer_A(std::string)':
snake_escaping.cpp:107:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |         for(int i = 0; i < pos.size(); i++)
      |                        ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 468 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 2 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 2 ms 468 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 943 ms 4260 KB Output is correct
12 Correct 283 ms 4040 KB Output is correct
13 Correct 458 ms 3144 KB Output is correct
14 Correct 464 ms 3360 KB Output is correct
15 Correct 411 ms 4388 KB Output is correct
16 Correct 673 ms 3496 KB Output is correct
17 Correct 663 ms 3556 KB Output is correct
18 Correct 192 ms 5324 KB Output is correct
19 Correct 879 ms 2448 KB Output is correct
20 Correct 910 ms 4092 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 468 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 943 ms 4260 KB Output is correct
12 Correct 283 ms 4040 KB Output is correct
13 Correct 458 ms 3144 KB Output is correct
14 Correct 464 ms 3360 KB Output is correct
15 Correct 411 ms 4388 KB Output is correct
16 Correct 673 ms 3496 KB Output is correct
17 Correct 663 ms 3556 KB Output is correct
18 Correct 192 ms 5324 KB Output is correct
19 Correct 879 ms 2448 KB Output is correct
20 Correct 910 ms 4092 KB Output is correct
21 Correct 1677 ms 4996 KB Output is correct
22 Correct 342 ms 18280 KB Output is correct
23 Correct 730 ms 17252 KB Output is correct
24 Correct 664 ms 17096 KB Output is correct
25 Correct 518 ms 19184 KB Output is correct
26 Correct 956 ms 17612 KB Output is correct
27 Correct 950 ms 17760 KB Output is correct
28 Correct 236 ms 20136 KB Output is correct
29 Correct 235 ms 16068 KB Output is correct
30 Execution timed out 2029 ms 18308 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 468 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 63 ms 9808 KB Output is correct
12 Correct 67 ms 9836 KB Output is correct
13 Correct 103 ms 9812 KB Output is correct
14 Correct 159 ms 9764 KB Output is correct
15 Correct 86 ms 9964 KB Output is correct
16 Correct 205 ms 9904 KB Output is correct
17 Correct 172 ms 9884 KB Output is correct
18 Correct 56 ms 10068 KB Output is correct
19 Correct 58 ms 9684 KB Output is correct
20 Correct 83 ms 9832 KB Output is correct
21 Correct 104 ms 9828 KB Output is correct
22 Correct 144 ms 9820 KB Output is correct
23 Correct 129 ms 9784 KB Output is correct
24 Correct 242 ms 9800 KB Output is correct
25 Correct 158 ms 9848 KB Output is correct
26 Correct 53 ms 9672 KB Output is correct
27 Correct 66 ms 9808 KB Output is correct
28 Correct 65 ms 9668 KB Output is correct
29 Correct 166 ms 9808 KB Output is correct
30 Correct 301 ms 9844 KB Output is correct
31 Correct 81 ms 9800 KB Output is correct
32 Correct 147 ms 9840 KB Output is correct
33 Correct 167 ms 9800 KB Output is correct
34 Correct 55 ms 9772 KB Output is correct
35 Correct 134 ms 9816 KB Output is correct
36 Correct 135 ms 9932 KB Output is correct
37 Correct 131 ms 9808 KB Output is correct
38 Correct 138 ms 9808 KB Output is correct
39 Correct 143 ms 9848 KB Output is correct
40 Correct 133 ms 9816 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 468 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 943 ms 4260 KB Output is correct
12 Correct 283 ms 4040 KB Output is correct
13 Correct 458 ms 3144 KB Output is correct
14 Correct 464 ms 3360 KB Output is correct
15 Correct 411 ms 4388 KB Output is correct
16 Correct 673 ms 3496 KB Output is correct
17 Correct 663 ms 3556 KB Output is correct
18 Correct 192 ms 5324 KB Output is correct
19 Correct 879 ms 2448 KB Output is correct
20 Correct 910 ms 4092 KB Output is correct
21 Correct 1677 ms 4996 KB Output is correct
22 Correct 342 ms 18280 KB Output is correct
23 Correct 730 ms 17252 KB Output is correct
24 Correct 664 ms 17096 KB Output is correct
25 Correct 518 ms 19184 KB Output is correct
26 Correct 956 ms 17612 KB Output is correct
27 Correct 950 ms 17760 KB Output is correct
28 Correct 236 ms 20136 KB Output is correct
29 Correct 235 ms 16068 KB Output is correct
30 Execution timed out 2029 ms 18308 KB Time limit exceeded
31 Halted 0 ms 0 KB -