oj.uz

Submission #75220

# Submission time Handle Problem Language Result Execution time Memory
75220 2018-09-08T17:13:33 Z bogdan10bos Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 1529 ms 66560 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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 3 ms 572 KB Output is correct
8 Correct 2 ms 700 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 700 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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 3 ms 572 KB Output is correct
8 Correct 2 ms 700 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 700 KB Output is correct
11 Correct 358 ms 4832 KB Output is correct
12 Correct 409 ms 4832 KB Output is correct
13 Correct 461 ms 4832 KB Output is correct
14 Correct 418 ms 4832 KB Output is correct
15 Correct 419 ms 4832 KB Output is correct
16 Correct 454 ms 4832 KB Output is correct
17 Correct 481 ms 4832 KB Output is correct
18 Correct 287 ms 5556 KB Output is correct
19 Correct 319 ms 5556 KB Output is correct
20 Correct 403 ms 5556 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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 3 ms 572 KB Output is correct
8 Correct 2 ms 700 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 700 KB Output is correct
11 Correct 358 ms 4832 KB Output is correct
12 Correct 409 ms 4832 KB Output is correct
13 Correct 461 ms 4832 KB Output is correct
14 Correct 418 ms 4832 KB Output is correct
15 Correct 419 ms 4832 KB Output is correct
16 Correct 454 ms 4832 KB Output is correct
17 Correct 481 ms 4832 KB Output is correct
18 Correct 287 ms 5556 KB Output is correct
19 Correct 319 ms 5556 KB Output is correct
20 Correct 403 ms 5556 KB Output is correct
21 Correct 450 ms 5556 KB Output is correct
22 Correct 484 ms 5556 KB Output is correct
23 Correct 528 ms 5556 KB Output is correct
24 Correct 612 ms 5556 KB Output is correct
25 Correct 495 ms 5676 KB Output is correct
26 Correct 568 ms 5676 KB Output is correct
27 Correct 566 ms 5676 KB Output is correct
28 Correct 313 ms 6620 KB Output is correct
29 Correct 396 ms 6620 KB Output is correct
30 Correct 488 ms 6620 KB Output is correct
31 Correct 562 ms 6620 KB Output is correct
32 Correct 610 ms 6620 KB Output is correct
33 Correct 467 ms 6620 KB Output is correct
34 Correct 564 ms 6620 KB Output is correct
35 Correct 579 ms 6620 KB Output is correct
36 Correct 297 ms 6620 KB Output is correct
37 Correct 462 ms 6620 KB Output is correct
38 Correct 399 ms 6620 KB Output is correct
39 Correct 520 ms 6620 KB Output is correct
40 Correct 558 ms 6620 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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 3 ms 572 KB Output is correct
8 Correct 2 ms 700 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 700 KB Output is correct
11 Correct 102 ms 14156 KB Output is correct
12 Correct 102 ms 14272 KB Output is correct
13 Correct 111 ms 14272 KB Output is correct
14 Correct 127 ms 14272 KB Output is correct
15 Correct 101 ms 14272 KB Output is correct
16 Correct 144 ms 14272 KB Output is correct
17 Correct 128 ms 14396 KB Output is correct
18 Correct 93 ms 14420 KB Output is correct
19 Correct 98 ms 14420 KB Output is correct
20 Correct 107 ms 14420 KB Output is correct
21 Correct 115 ms 14420 KB Output is correct
22 Correct 139 ms 14420 KB Output is correct
23 Correct 106 ms 14420 KB Output is correct
24 Correct 137 ms 14420 KB Output is correct
25 Correct 135 ms 14420 KB Output is correct
26 Correct 92 ms 14420 KB Output is correct
27 Correct 101 ms 14420 KB Output is correct
28 Correct 105 ms 14420 KB Output is correct
29 Correct 115 ms 14420 KB Output is correct
30 Correct 128 ms 14420 KB Output is correct
31 Correct 98 ms 14420 KB Output is correct
32 Correct 161 ms 14420 KB Output is correct
33 Correct 124 ms 14420 KB Output is correct
34 Correct 84 ms 14420 KB Output is correct
35 Correct 115 ms 14420 KB Output is correct
36 Correct 118 ms 14420 KB Output is correct
37 Correct 119 ms 14420 KB Output is correct
38 Correct 114 ms 14420 KB Output is correct
39 Correct 117 ms 14420 KB Output is correct
40 Correct 119 ms 14420 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 3 ms 572 KB Output is correct
8 Correct 2 ms 700 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 700 KB Output is correct
11 Correct 358 ms 4832 KB Output is correct
12 Correct 409 ms 4832 KB Output is correct
13 Correct 461 ms 4832 KB Output is correct
14 Correct 418 ms 4832 KB Output is correct
15 Correct 419 ms 4832 KB Output is correct
16 Correct 454 ms 4832 KB Output is correct
17 Correct 481 ms 4832 KB Output is correct
18 Correct 287 ms 5556 KB Output is correct
19 Correct 319 ms 5556 KB Output is correct
20 Correct 403 ms 5556 KB Output is correct
21 Correct 450 ms 5556 KB Output is correct
22 Correct 484 ms 5556 KB Output is correct
23 Correct 528 ms 5556 KB Output is correct
24 Correct 612 ms 5556 KB Output is correct
25 Correct 495 ms 5676 KB Output is correct
26 Correct 568 ms 5676 KB Output is correct
27 Correct 566 ms 5676 KB Output is correct
28 Correct 313 ms 6620 KB Output is correct
29 Correct 396 ms 6620 KB Output is correct
30 Correct 488 ms 6620 KB Output is correct
31 Correct 562 ms 6620 KB Output is correct
32 Correct 610 ms 6620 KB Output is correct
33 Correct 467 ms 6620 KB Output is correct
34 Correct 564 ms 6620 KB Output is correct
35 Correct 579 ms 6620 KB Output is correct
36 Correct 297 ms 6620 KB Output is correct
37 Correct 462 ms 6620 KB Output is correct
38 Correct 399 ms 6620 KB Output is correct
39 Correct 520 ms 6620 KB Output is correct
40 Correct 558 ms 6620 KB Output is correct
41 Correct 102 ms 14156 KB Output is correct
42 Correct 102 ms 14272 KB Output is correct
43 Correct 111 ms 14272 KB Output is correct
44 Correct 127 ms 14272 KB Output is correct
45 Correct 101 ms 14272 KB Output is correct
46 Correct 144 ms 14272 KB Output is correct
47 Correct 128 ms 14396 KB Output is correct
48 Correct 93 ms 14420 KB Output is correct
49 Correct 98 ms 14420 KB Output is correct
50 Correct 107 ms 14420 KB Output is correct
51 Correct 115 ms 14420 KB Output is correct
52 Correct 139 ms 14420 KB Output is correct
53 Correct 106 ms 14420 KB Output is correct
54 Correct 137 ms 14420 KB Output is correct
55 Correct 135 ms 14420 KB Output is correct
56 Correct 92 ms 14420 KB Output is correct
57 Correct 101 ms 14420 KB Output is correct
58 Correct 105 ms 14420 KB Output is correct
59 Correct 115 ms 14420 KB Output is correct
60 Correct 128 ms 14420 KB Output is correct
61 Correct 98 ms 14420 KB Output is correct
62 Correct 161 ms 14420 KB Output is correct
63 Correct 124 ms 14420 KB Output is correct
64 Correct 84 ms 14420 KB Output is correct
65 Correct 115 ms 14420 KB Output is correct
66 Correct 118 ms 14420 KB Output is correct
67 Correct 119 ms 14420 KB Output is correct
68 Correct 114 ms 14420 KB Output is correct
69 Correct 117 ms 14420 KB Output is correct
70 Correct 119 ms 14420 KB Output is correct
71 Correct 753 ms 18924 KB Output is correct
72 Correct 753 ms 19200 KB Output is correct
73 Correct 941 ms 19200 KB Output is correct
74 Correct 1288 ms 19200 KB Output is correct
75 Correct 769 ms 19908 KB Output is correct
76 Correct 1529 ms 19908 KB Output is correct
77 Correct 1278 ms 19908 KB Output is correct
78 Correct 435 ms 21820 KB Output is correct
79 Correct 608 ms 21820 KB Output is correct
80 Correct 775 ms 21820 KB Output is correct
81 Correct 1022 ms 21820 KB Output is correct
82 Correct 1367 ms 21820 KB Output is correct
83 Correct 718 ms 21820 KB Output is correct
84 Correct 1349 ms 21820 KB Output is correct
85 Correct 1300 ms 21820 KB Output is correct
86 Correct 422 ms 21820 KB Output is correct
87 Correct 771 ms 21820 KB Output is correct
88 Correct 624 ms 21820 KB Output is correct
89 Correct 980 ms 21820 KB Output is correct
90 Correct 1167 ms 21820 KB Output is correct
91 Correct 726 ms 33612 KB Output is correct
92 Correct 1453 ms 34756 KB Output is correct
93 Correct 1259 ms 34756 KB Output is correct
94 Correct 423 ms 53956 KB Output is correct
95 Runtime error 1079 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
96 Halted 0 ms 0 KB -