oj.uz

Submission #75225

# Submission time Handle Problem Language Result Execution time Memory
75225 2018-09-08T17:18:52 Z bogdan10bos Snake Escaping (JOI18_snake_escaping) C++14
100 / 100
 1476 ms 46376 KB 
#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO

int N, Q, ans;
int i, j, q, msk;
int cnt[3];
int val[1100005], dp[1100005], dp2[1100005];
int bts[1100005];
int B, b[25];
char s[1100005];

void bck0(int pas, int msk, int smn)
{
    if(pas >= B)
    {
        ans += smn * dp[msk];
        return;
    }

    bck0(pas + 1, msk, smn);
    bck0(pas + 1, msk ^ (1 << b[pas]), -smn);
}

void bck1(int pas, int msk, int smn)
{
    if(pas >= B)
    {
        ans += smn * dp2[msk];
        return;
    }

    bck1(pas + 1, msk, smn);
    bck1(pas + 1, msk ^ (1 << b[pas]), -smn);
}

void bckq(int pas, int msk)
{
    if(pas >= B)
    {
        ans += val[msk];
        return;
    }

    bckq(pas + 1, msk);
    bckq(pas + 1, msk ^ (1 << b[pas]));
}

int main()
{
    #ifdef FILE_IO
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
    #endif

    scanf("%d%d\n", &N, &Q);
    scanf("%s\n", s);
    for(i = 0; i < (1 << N); i++)
        val[i] = dp[i] = dp2[i] = s[i] - '0';
    for(j = 0; j < N; j++)
        for(i = (1 << N) - 1; i >= 0; i--)
            if( (i & (1 << j)) == 0 )
                dp[i] += dp[i ^ (1 << j)];
    for(j = 0; j < N; j++)
        for(i = 0; i < (1 << N); i++)
            if( (i & (1 << j)) != 0 )
                dp2[i] += dp2[i ^ (1 << j)];

    for(q = 1; q <= Q; q++)
    {
        scanf("%s\n", s);
        reverse(s, s + N);
        cnt[0] = cnt[1] = cnt[2] = 0;
        for(j = 0; j < N; j++)
        {
            if(s[j] == '0') cnt[0]++;
            else if(s[j] == '1')    cnt[1]++;
            else if(s[j] == '?')    cnt[2]++;
        }

        if(cnt[0] < cnt[1] && cnt[0] < cnt[2])
        {
            msk = 0;
            B = 0;
            for(i = 0; i < N; i++)
            {
                if(s[i] == '1') msk |= (1 << i);
                if(s[i] == '0') b[B++] = i;
            }

            ans = 0;
            bck0(0, msk, 1);
            printf("%d\n", ans);
        }
        else if(cnt[1] < cnt[2])
        {
            msk = 0;
            B = 0;
            for(i = 0; i < N; i++)
            {
                if(s[i] == '1')
                {
                    msk |= (1 << i);
                    b[B++] = i;
                }
                if(s[i] == '?')
                    msk |= (1 << i);
            }

            ans = 0;
            bck1(0, msk, 1);
            printf("%d\n", ans);
        }
        else
        {
            msk = 0;
            B = 0;
            for(i = 0; i < N; i++)
            {
                if(s[i] == '?') b[B++] = i;
                else    msk |= ((s[i] - '0') << i);
            }

            ans = 0;
            bckq(0, msk);
            printf("%d\n", ans);
        }
    }

    return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d\n", &N, &Q);
     ~~~~~^~~~~~~~~~~~~~~~~~
snake_escaping.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s\n", s);
     ~~~~~^~~~~~~~~~~
snake_escaping.cpp:73:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s\n", s);
         ~~~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 3 ms 584 KB Output is correct
4 Correct 3 ms 668 KB Output is correct
5 Correct 3 ms 668 KB Output is correct
6 Correct 2 ms 668 KB Output is correct
7 Correct 3 ms 668 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 3 ms 736 KB Output is correct
10 Correct 3 ms 736 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 3 ms 584 KB Output is correct
4 Correct 3 ms 668 KB Output is correct
5 Correct 3 ms 668 KB Output is correct
6 Correct 2 ms 668 KB Output is correct
7 Correct 3 ms 668 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 3 ms 736 KB Output is correct
10 Correct 3 ms 736 KB Output is correct
11 Correct 397 ms 5544 KB Output is correct
12 Correct 404 ms 5544 KB Output is correct
13 Correct 477 ms 5544 KB Output is correct
14 Correct 429 ms 5544 KB Output is correct
15 Correct 435 ms 6008 KB Output is correct
16 Correct 476 ms 6008 KB Output is correct
17 Correct 459 ms 6008 KB Output is correct
18 Correct 277 ms 7360 KB Output is correct
19 Correct 337 ms 7360 KB Output is correct
20 Correct 432 ms 7360 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 3 ms 584 KB Output is correct
4 Correct 3 ms 668 KB Output is correct
5 Correct 3 ms 668 KB Output is correct
6 Correct 2 ms 668 KB Output is correct
7 Correct 3 ms 668 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 3 ms 736 KB Output is correct
10 Correct 3 ms 736 KB Output is correct
11 Correct 397 ms 5544 KB Output is correct
12 Correct 404 ms 5544 KB Output is correct
13 Correct 477 ms 5544 KB Output is correct
14 Correct 429 ms 5544 KB Output is correct
15 Correct 435 ms 6008 KB Output is correct
16 Correct 476 ms 6008 KB Output is correct
17 Correct 459 ms 6008 KB Output is correct
18 Correct 277 ms 7360 KB Output is correct
19 Correct 337 ms 7360 KB Output is correct
20 Correct 432 ms 7360 KB Output is correct
21 Correct 463 ms 7360 KB Output is correct
22 Correct 486 ms 7360 KB Output is correct
23 Correct 552 ms 7360 KB Output is correct
24 Correct 598 ms 7360 KB Output is correct
25 Correct 523 ms 7956 KB Output is correct
26 Correct 590 ms 7956 KB Output is correct
27 Correct 589 ms 7956 KB Output is correct
28 Correct 313 ms 9120 KB Output is correct
29 Correct 419 ms 9120 KB Output is correct
30 Correct 497 ms 9120 KB Output is correct
31 Correct 586 ms 9120 KB Output is correct
32 Correct 634 ms 9120 KB Output is correct
33 Correct 491 ms 9120 KB Output is correct
34 Correct 558 ms 9120 KB Output is correct
35 Correct 577 ms 9120 KB Output is correct
36 Correct 349 ms 9120 KB Output is correct
37 Correct 528 ms 9120 KB Output is correct
38 Correct 385 ms 9120 KB Output is correct
39 Correct 534 ms 9120 KB Output is correct
40 Correct 552 ms 9120 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 3 ms 584 KB Output is correct
4 Correct 3 ms 668 KB Output is correct
5 Correct 3 ms 668 KB Output is correct
6 Correct 2 ms 668 KB Output is correct
7 Correct 3 ms 668 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 3 ms 736 KB Output is correct
10 Correct 3 ms 736 KB Output is correct
11 Correct 108 ms 18376 KB Output is correct
12 Correct 117 ms 18376 KB Output is correct
13 Correct 112 ms 18376 KB Output is correct
14 Correct 136 ms 18376 KB Output is correct
15 Correct 100 ms 18376 KB Output is correct
16 Correct 146 ms 18468 KB Output is correct
17 Correct 134 ms 18468 KB Output is correct
18 Correct 90 ms 18492 KB Output is correct
19 Correct 98 ms 18492 KB Output is correct
20 Correct 106 ms 18492 KB Output is correct
21 Correct 112 ms 18492 KB Output is correct
22 Correct 132 ms 18492 KB Output is correct
23 Correct 102 ms 18492 KB Output is correct
24 Correct 131 ms 18596 KB Output is correct
25 Correct 126 ms 18596 KB Output is correct
26 Correct 89 ms 18596 KB Output is correct
27 Correct 102 ms 18624 KB Output is correct
28 Correct 98 ms 18624 KB Output is correct
29 Correct 108 ms 18624 KB Output is correct
30 Correct 126 ms 18624 KB Output is correct
31 Correct 103 ms 18624 KB Output is correct
32 Correct 179 ms 18648 KB Output is correct
33 Correct 127 ms 18648 KB Output is correct
34 Correct 106 ms 18648 KB Output is correct
35 Correct 117 ms 18648 KB Output is correct
36 Correct 131 ms 18648 KB Output is correct
37 Correct 121 ms 18796 KB Output is correct
38 Correct 120 ms 18796 KB Output is correct
39 Correct 118 ms 18796 KB Output is correct
40 Correct 122 ms 18796 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 3 ms 584 KB Output is correct
4 Correct 3 ms 668 KB Output is correct
5 Correct 3 ms 668 KB Output is correct
6 Correct 2 ms 668 KB Output is correct
7 Correct 3 ms 668 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 3 ms 736 KB Output is correct
10 Correct 3 ms 736 KB Output is correct
11 Correct 397 ms 5544 KB Output is correct
12 Correct 404 ms 5544 KB Output is correct
13 Correct 477 ms 5544 KB Output is correct
14 Correct 429 ms 5544 KB Output is correct
15 Correct 435 ms 6008 KB Output is correct
16 Correct 476 ms 6008 KB Output is correct
17 Correct 459 ms 6008 KB Output is correct
18 Correct 277 ms 7360 KB Output is correct
19 Correct 337 ms 7360 KB Output is correct
20 Correct 432 ms 7360 KB Output is correct
21 Correct 463 ms 7360 KB Output is correct
22 Correct 486 ms 7360 KB Output is correct
23 Correct 552 ms 7360 KB Output is correct
24 Correct 598 ms 7360 KB Output is correct
25 Correct 523 ms 7956 KB Output is correct
26 Correct 590 ms 7956 KB Output is correct
27 Correct 589 ms 7956 KB Output is correct
28 Correct 313 ms 9120 KB Output is correct
29 Correct 419 ms 9120 KB Output is correct
30 Correct 497 ms 9120 KB Output is correct
31 Correct 586 ms 9120 KB Output is correct
32 Correct 634 ms 9120 KB Output is correct
33 Correct 491 ms 9120 KB Output is correct
34 Correct 558 ms 9120 KB Output is correct
35 Correct 577 ms 9120 KB Output is correct
36 Correct 349 ms 9120 KB Output is correct
37 Correct 528 ms 9120 KB Output is correct
38 Correct 385 ms 9120 KB Output is correct
39 Correct 534 ms 9120 KB Output is correct
40 Correct 552 ms 9120 KB Output is correct
41 Correct 108 ms 18376 KB Output is correct
42 Correct 117 ms 18376 KB Output is correct
43 Correct 112 ms 18376 KB Output is correct
44 Correct 136 ms 18376 KB Output is correct
45 Correct 100 ms 18376 KB Output is correct
46 Correct 146 ms 18468 KB Output is correct
47 Correct 134 ms 18468 KB Output is correct
48 Correct 90 ms 18492 KB Output is correct
49 Correct 98 ms 18492 KB Output is correct
50 Correct 106 ms 18492 KB Output is correct
51 Correct 112 ms 18492 KB Output is correct
52 Correct 132 ms 18492 KB Output is correct
53 Correct 102 ms 18492 KB Output is correct
54 Correct 131 ms 18596 KB Output is correct
55 Correct 126 ms 18596 KB Output is correct
56 Correct 89 ms 18596 KB Output is correct
57 Correct 102 ms 18624 KB Output is correct
58 Correct 98 ms 18624 KB Output is correct
59 Correct 108 ms 18624 KB Output is correct
60 Correct 126 ms 18624 KB Output is correct
61 Correct 103 ms 18624 KB Output is correct
62 Correct 179 ms 18648 KB Output is correct
63 Correct 127 ms 18648 KB Output is correct
64 Correct 106 ms 18648 KB Output is correct
65 Correct 117 ms 18648 KB Output is correct
66 Correct 131 ms 18648 KB Output is correct
67 Correct 121 ms 18796 KB Output is correct
68 Correct 120 ms 18796 KB Output is correct
69 Correct 118 ms 18796 KB Output is correct
70 Correct 122 ms 18796 KB Output is correct
71 Correct 801 ms 23512 KB Output is correct
72 Correct 763 ms 23728 KB Output is correct
73 Correct 943 ms 23728 KB Output is correct
74 Correct 1321 ms 23728 KB Output is correct
75 Correct 770 ms 25172 KB Output is correct
76 Correct 1476 ms 25172 KB Output is correct
77 Correct 1331 ms 25172 KB Output is correct
78 Correct 464 ms 27104 KB Output is correct
79 Correct 653 ms 27104 KB Output is correct
80 Correct 931 ms 27104 KB Output is correct
81 Correct 960 ms 27104 KB Output is correct
82 Correct 1309 ms 27104 KB Output is correct
83 Correct 733 ms 27104 KB Output is correct
84 Correct 1359 ms 27104 KB Output is correct
85 Correct 1297 ms 27104 KB Output is correct
86 Correct 461 ms 27104 KB Output is correct
87 Correct 763 ms 27104 KB Output is correct
88 Correct 637 ms 27104 KB Output is correct
89 Correct 950 ms 27104 KB Output is correct
90 Correct 1218 ms 27104 KB Output is correct
91 Correct 792 ms 27104 KB Output is correct
92 Correct 1454 ms 27104 KB Output is correct
93 Correct 1272 ms 27104 KB Output is correct
94 Correct 432 ms 27104 KB Output is correct
95 Correct 1117 ms 27104 KB Output is correct
96 Correct 1099 ms 27104 KB Output is correct
97 Correct 1151 ms 27104 KB Output is correct
98 Correct 1144 ms 27104 KB Output is correct
99 Correct 1273 ms 27104 KB Output is correct
100 Correct 1209 ms 46376 KB Output is correct