oj.uz

답안 #334755

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334755 2020-12-10T00:34:42 Z HoneyBadger Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 17900 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>



/*#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")


*/
#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif


#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }

ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 1 << 20;
const int PW = 20;
const double EPS = 1e-9;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


int n, q;
int a[MX];
int sos1[MX];
int sos0[MX];

void calc() {
    for (unsigned mask = 0; mask < (1 << n); ++mask) {
        sos1[mask] = a[mask];
        sos0[mask] = a[mask];
    }
    for (unsigned i = 0; i < n; ++i) {
        for (unsigned mask = 0; mask < (1 << n); ++mask) {
            if ((mask >> i) & 1) {
                sos1[mask] += sos1[mask ^ (1 << i)];
            } else {
                sos0[mask] += sos0[mask ^ (1 << i)];
            }
        }
    }

}

int ans;
str s;


void solveq(unsigned i = 0, unsigned mask = 0) {
    if (i == n) {
        ans += a[mask];
        return;
    }
    mask <<= 1;
    if (s[i] == '?') {
        solveq(i + 1, mask);
        solveq(i + 1, mask ^ 1);
    } else {
        solveq(i + 1, mask ^ (s[i] == '1'));
    }
}

void solve1(unsigned i = 0, unsigned mask = 0, int del = 0) {
    if (i == n) {
        if (del)
            ans -= sos1[mask];
        else
            ans += sos1[mask];
        return;
    }
    mask <<= 1;
    if (s[i] == '1') {
        solve1(i + 1, mask ^ 1, del);
        solve1(i + 1, mask, del ^ 1);  
    } else {
        solve1(i + 1, mask ^ (s[i] == '?'), del);
    }
}

void solve0(unsigned i = 0, unsigned mask = 0, int del = 0) {
    if (i == n) {
        if (del)
            ans -= sos0[mask];
        else
            ans += sos0[mask];
        return;
    }
    mask <<= 1;
    if (s[i] == '0') {
        solve0(i + 1, mask ^ 1, del ^ 1);
        solve0(i + 1, mask, del);
    } else {
        solve0(i + 1, mask ^ (s[i] != '?'), del);
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> q;
    for (unsigned i = 0; i < (1 << n); ++i) {
        char c;
        cin >> c;
        a[i] = c - '0';
    }

    calc();
    
    while (q--) {
        cin >> s;
        int pq = 0, p1 = 0, p0 = 0;
        fx(c, s) {
            pq += c == '?';
            p1 += c == '1';
            p0 += c == '0';
        }
        ans = 0;
        if (pq <= n / 3) {
            solveq();
        } else if (p1 <= n / 3) {
            solve1();
        } else {    
            solve0();
        }
        cout << ans << '\n';
    }
}

Compilation message

snake_escaping.cpp: In function 'void calc()':
snake_escaping.cpp:98:34: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   98 |     for (unsigned mask = 0; mask < (1 << n); ++mask) {
      |                             ~~~~~^~~~~~~~~~
snake_escaping.cpp:102:28: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
  102 |     for (unsigned i = 0; i < n; ++i) {
      |                          ~~^~~
snake_escaping.cpp:103:38: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
  103 |         for (unsigned mask = 0; mask < (1 << n); ++mask) {
      |                                 ~~~~~^~~~~~~~~~
snake_escaping.cpp: In function 'void solveq(unsigned int, unsigned int)':
snake_escaping.cpp:119:11: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
  119 |     if (i == n) {
      |         ~~^~~~
snake_escaping.cpp: In function 'void solve1(unsigned int, unsigned int, int)':
snake_escaping.cpp:133:11: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
  133 |     if (i == n) {
      |         ~~^~~~
snake_escaping.cpp: In function 'void solve0(unsigned int, unsigned int, int)':
snake_escaping.cpp:150:11: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
  150 |     if (i == n) {
      |         ~~^~~~
snake_escaping.cpp: In function 'int32_t main()':
snake_escaping.cpp:172:28: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
  172 |     for (unsigned i = 0; i < (1 << n); ++i) {
      |                          ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 208 ms 4460 KB Output is correct
12 Correct 229 ms 4076 KB Output is correct
13 Correct 267 ms 3436 KB Output is correct
14 Correct 296 ms 3436 KB Output is correct
15 Correct 266 ms 4460 KB Output is correct
16 Correct 305 ms 3564 KB Output is correct
17 Correct 292 ms 3936 KB Output is correct
18 Correct 210 ms 5356 KB Output is correct
19 Correct 199 ms 2412 KB Output is correct
20 Correct 260 ms 4204 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 208 ms 4460 KB Output is correct
12 Correct 229 ms 4076 KB Output is correct
13 Correct 267 ms 3436 KB Output is correct
14 Correct 296 ms 3436 KB Output is correct
15 Correct 266 ms 4460 KB Output is correct
16 Correct 305 ms 3564 KB Output is correct
17 Correct 292 ms 3936 KB Output is correct
18 Correct 210 ms 5356 KB Output is correct
19 Correct 199 ms 2412 KB Output is correct
20 Correct 260 ms 4204 KB Output is correct
21 Correct 236 ms 4460 KB Output is correct
22 Correct 263 ms 4628 KB Output is correct
23 Correct 367 ms 3692 KB Output is correct
24 Correct 478 ms 3436 KB Output is correct
25 Correct 339 ms 5484 KB Output is correct
26 Correct 445 ms 3948 KB Output is correct
27 Correct 412 ms 4076 KB Output is correct
28 Correct 230 ms 6508 KB Output is correct
29 Correct 215 ms 2540 KB Output is correct
30 Correct 304 ms 4588 KB Output is correct
31 Correct 373 ms 4460 KB Output is correct
32 Correct 504 ms 4496 KB Output is correct
33 Correct 334 ms 3436 KB Output is correct
34 Correct 479 ms 3436 KB Output is correct
35 Correct 415 ms 4076 KB Output is correct
36 Correct 209 ms 2516 KB Output is correct
37 Correct 222 ms 4608 KB Output is correct
38 Correct 212 ms 2540 KB Output is correct
39 Correct 364 ms 3692 KB Output is correct
40 Correct 478 ms 3576 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 59 ms 13036 KB Output is correct
12 Correct 62 ms 12908 KB Output is correct
13 Correct 95 ms 12780 KB Output is correct
14 Correct 171 ms 12908 KB Output is correct
15 Correct 76 ms 12908 KB Output is correct
16 Correct 163 ms 12908 KB Output is correct
17 Correct 144 ms 12908 KB Output is correct
18 Correct 55 ms 13164 KB Output is correct
19 Correct 58 ms 12780 KB Output is correct
20 Correct 67 ms 12908 KB Output is correct
21 Correct 100 ms 12908 KB Output is correct
22 Correct 153 ms 12908 KB Output is correct
23 Correct 77 ms 12908 KB Output is correct
24 Correct 143 ms 12908 KB Output is correct
25 Correct 139 ms 12908 KB Output is correct
26 Correct 55 ms 12780 KB Output is correct
27 Correct 61 ms 12908 KB Output is correct
28 Correct 58 ms 12780 KB Output is correct
29 Correct 94 ms 12780 KB Output is correct
30 Correct 136 ms 12908 KB Output is correct
31 Correct 76 ms 12780 KB Output is correct
32 Correct 168 ms 12908 KB Output is correct
33 Correct 139 ms 12908 KB Output is correct
34 Correct 55 ms 12780 KB Output is correct
35 Correct 114 ms 12908 KB Output is correct
36 Correct 110 ms 12908 KB Output is correct
37 Correct 111 ms 12908 KB Output is correct
38 Correct 113 ms 12908 KB Output is correct
39 Correct 114 ms 12908 KB Output is correct
40 Correct 117 ms 12908 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 208 ms 4460 KB Output is correct
12 Correct 229 ms 4076 KB Output is correct
13 Correct 267 ms 3436 KB Output is correct
14 Correct 296 ms 3436 KB Output is correct
15 Correct 266 ms 4460 KB Output is correct
16 Correct 305 ms 3564 KB Output is correct
17 Correct 292 ms 3936 KB Output is correct
18 Correct 210 ms 5356 KB Output is correct
19 Correct 199 ms 2412 KB Output is correct
20 Correct 260 ms 4204 KB Output is correct
21 Correct 236 ms 4460 KB Output is correct
22 Correct 263 ms 4628 KB Output is correct
23 Correct 367 ms 3692 KB Output is correct
24 Correct 478 ms 3436 KB Output is correct
25 Correct 339 ms 5484 KB Output is correct
26 Correct 445 ms 3948 KB Output is correct
27 Correct 412 ms 4076 KB Output is correct
28 Correct 230 ms 6508 KB Output is correct
29 Correct 215 ms 2540 KB Output is correct
30 Correct 304 ms 4588 KB Output is correct
31 Correct 373 ms 4460 KB Output is correct
32 Correct 504 ms 4496 KB Output is correct
33 Correct 334 ms 3436 KB Output is correct
34 Correct 479 ms 3436 KB Output is correct
35 Correct 415 ms 4076 KB Output is correct
36 Correct 209 ms 2516 KB Output is correct
37 Correct 222 ms 4608 KB Output is correct
38 Correct 212 ms 2540 KB Output is correct
39 Correct 364 ms 3692 KB Output is correct
40 Correct 478 ms 3576 KB Output is correct
41 Correct 59 ms 13036 KB Output is correct
42 Correct 62 ms 12908 KB Output is correct
43 Correct 95 ms 12780 KB Output is correct
44 Correct 171 ms 12908 KB Output is correct
45 Correct 76 ms 12908 KB Output is correct
46 Correct 163 ms 12908 KB Output is correct
47 Correct 144 ms 12908 KB Output is correct
48 Correct 55 ms 13164 KB Output is correct
49 Correct 58 ms 12780 KB Output is correct
50 Correct 67 ms 12908 KB Output is correct
51 Correct 100 ms 12908 KB Output is correct
52 Correct 153 ms 12908 KB Output is correct
53 Correct 77 ms 12908 KB Output is correct
54 Correct 143 ms 12908 KB Output is correct
55 Correct 139 ms 12908 KB Output is correct
56 Correct 55 ms 12780 KB Output is correct
57 Correct 61 ms 12908 KB Output is correct
58 Correct 58 ms 12780 KB Output is correct
59 Correct 94 ms 12780 KB Output is correct
60 Correct 136 ms 12908 KB Output is correct
61 Correct 76 ms 12780 KB Output is correct
62 Correct 168 ms 12908 KB Output is correct
63 Correct 139 ms 12908 KB Output is correct
64 Correct 55 ms 12780 KB Output is correct
65 Correct 114 ms 12908 KB Output is correct
66 Correct 110 ms 12908 KB Output is correct
67 Correct 111 ms 12908 KB Output is correct
68 Correct 113 ms 12908 KB Output is correct
69 Correct 114 ms 12908 KB Output is correct
70 Correct 117 ms 12908 KB Output is correct
71 Correct 358 ms 17644 KB Output is correct
72 Correct 430 ms 17900 KB Output is correct
73 Correct 1073 ms 16492 KB Output is correct
74 Execution timed out 2085 ms 16328 KB Time limit exceeded
75 Halted 0 ms 0 KB -