oj.uz

Submission #75202

# Submission time Handle Problem Language Result Execution time Memory
75202 2018-09-08T16:52:07 Z bogdan10bos Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 634 ms 66332 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 3 ms 376 KB Output is correct
2 Correct 3 ms 520 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 3 ms 660 KB Output is correct
5 Correct 3 ms 660 KB Output is correct
6 Correct 3 ms 660 KB Output is correct
7 Correct 3 ms 660 KB Output is correct
8 Correct 3 ms 708 KB Output is correct
9 Correct 3 ms 708 KB Output is correct
10 Correct 3 ms 708 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 520 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 3 ms 660 KB Output is correct
5 Correct 3 ms 660 KB Output is correct
6 Correct 3 ms 660 KB Output is correct
7 Correct 3 ms 660 KB Output is correct
8 Correct 3 ms 708 KB Output is correct
9 Correct 3 ms 708 KB Output is correct
10 Correct 3 ms 708 KB Output is correct
11 Correct 394 ms 5884 KB Output is correct
12 Correct 417 ms 7804 KB Output is correct
13 Correct 473 ms 7804 KB Output is correct
14 Correct 429 ms 7804 KB Output is correct
15 Correct 403 ms 8212 KB Output is correct
16 Correct 439 ms 8212 KB Output is correct
17 Correct 485 ms 8912 KB Output is correct
18 Correct 274 ms 10888 KB Output is correct
19 Correct 312 ms 10888 KB Output is correct
20 Correct 419 ms 10888 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 520 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 3 ms 660 KB Output is correct
5 Correct 3 ms 660 KB Output is correct
6 Correct 3 ms 660 KB Output is correct
7 Correct 3 ms 660 KB Output is correct
8 Correct 3 ms 708 KB Output is correct
9 Correct 3 ms 708 KB Output is correct
10 Correct 3 ms 708 KB Output is correct
11 Correct 394 ms 5884 KB Output is correct
12 Correct 417 ms 7804 KB Output is correct
13 Correct 473 ms 7804 KB Output is correct
14 Correct 429 ms 7804 KB Output is correct
15 Correct 403 ms 8212 KB Output is correct
16 Correct 439 ms 8212 KB Output is correct
17 Correct 485 ms 8912 KB Output is correct
18 Correct 274 ms 10888 KB Output is correct
19 Correct 312 ms 10888 KB Output is correct
20 Correct 419 ms 10888 KB Output is correct
21 Correct 476 ms 10888 KB Output is correct
22 Correct 494 ms 11164 KB Output is correct
23 Correct 538 ms 11164 KB Output is correct
24 Correct 555 ms 11164 KB Output is correct
25 Correct 511 ms 11868 KB Output is correct
26 Correct 577 ms 11868 KB Output is correct
27 Correct 612 ms 11868 KB Output is correct
28 Correct 364 ms 12968 KB Output is correct
29 Correct 383 ms 12968 KB Output is correct
30 Correct 509 ms 12968 KB Output is correct
31 Correct 559 ms 12968 KB Output is correct
32 Correct 634 ms 12968 KB Output is correct
33 Correct 485 ms 12968 KB Output is correct
34 Correct 566 ms 12968 KB Output is correct
35 Correct 600 ms 12968 KB Output is correct
36 Correct 313 ms 12968 KB Output is correct
37 Correct 481 ms 13428 KB Output is correct
38 Correct 413 ms 13428 KB Output is correct
39 Correct 516 ms 13428 KB Output is correct
40 Correct 559 ms 13428 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 520 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 3 ms 660 KB Output is correct
5 Correct 3 ms 660 KB Output is correct
6 Correct 3 ms 660 KB Output is correct
7 Correct 3 ms 660 KB Output is correct
8 Correct 3 ms 708 KB Output is correct
9 Correct 3 ms 708 KB Output is correct
10 Correct 3 ms 708 KB Output is correct
11 Correct 103 ms 22956 KB Output is correct
12 Correct 103 ms 22956 KB Output is correct
13 Correct 113 ms 22956 KB Output is correct
14 Correct 136 ms 22956 KB Output is correct
15 Correct 104 ms 23036 KB Output is correct
16 Correct 143 ms 23036 KB Output is correct
17 Correct 134 ms 23156 KB Output is correct
18 Correct 97 ms 23156 KB Output is correct
19 Correct 97 ms 23156 KB Output is correct
20 Correct 108 ms 24972 KB Output is correct
21 Correct 123 ms 27104 KB Output is correct
22 Correct 138 ms 29160 KB Output is correct
23 Correct 122 ms 31220 KB Output is correct
24 Correct 139 ms 33260 KB Output is correct
25 Correct 137 ms 35276 KB Output is correct
26 Correct 93 ms 37396 KB Output is correct
27 Correct 99 ms 39492 KB Output is correct
28 Correct 102 ms 41400 KB Output is correct
29 Correct 116 ms 43508 KB Output is correct
30 Correct 141 ms 45508 KB Output is correct
31 Correct 103 ms 47572 KB Output is correct
32 Correct 138 ms 49836 KB Output is correct
33 Correct 142 ms 51792 KB Output is correct
34 Correct 86 ms 53732 KB Output is correct
35 Correct 136 ms 55916 KB Output is correct
36 Correct 123 ms 57980 KB Output is correct
37 Correct 125 ms 59920 KB Output is correct
38 Correct 123 ms 61972 KB Output is correct
39 Correct 125 ms 64168 KB Output is correct
40 Runtime error 121 ms 66332 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.

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 520 KB Output is correct
3 Correct 3 ms 520 KB Output is correct
4 Correct 3 ms 660 KB Output is correct
5 Correct 3 ms 660 KB Output is correct
6 Correct 3 ms 660 KB Output is correct
7 Correct 3 ms 660 KB Output is correct
8 Correct 3 ms 708 KB Output is correct
9 Correct 3 ms 708 KB Output is correct
10 Correct 3 ms 708 KB Output is correct
11 Correct 394 ms 5884 KB Output is correct
12 Correct 417 ms 7804 KB Output is correct
13 Correct 473 ms 7804 KB Output is correct
14 Correct 429 ms 7804 KB Output is correct
15 Correct 403 ms 8212 KB Output is correct
16 Correct 439 ms 8212 KB Output is correct
17 Correct 485 ms 8912 KB Output is correct
18 Correct 274 ms 10888 KB Output is correct
19 Correct 312 ms 10888 KB Output is correct
20 Correct 419 ms 10888 KB Output is correct
21 Correct 476 ms 10888 KB Output is correct
22 Correct 494 ms 11164 KB Output is correct
23 Correct 538 ms 11164 KB Output is correct
24 Correct 555 ms 11164 KB Output is correct
25 Correct 511 ms 11868 KB Output is correct
26 Correct 577 ms 11868 KB Output is correct
27 Correct 612 ms 11868 KB Output is correct
28 Correct 364 ms 12968 KB Output is correct
29 Correct 383 ms 12968 KB Output is correct
30 Correct 509 ms 12968 KB Output is correct
31 Correct 559 ms 12968 KB Output is correct
32 Correct 634 ms 12968 KB Output is correct
33 Correct 485 ms 12968 KB Output is correct
34 Correct 566 ms 12968 KB Output is correct
35 Correct 600 ms 12968 KB Output is correct
36 Correct 313 ms 12968 KB Output is correct
37 Correct 481 ms 13428 KB Output is correct
38 Correct 413 ms 13428 KB Output is correct
39 Correct 516 ms 13428 KB Output is correct
40 Correct 559 ms 13428 KB Output is correct
41 Correct 103 ms 22956 KB Output is correct
42 Correct 103 ms 22956 KB Output is correct
43 Correct 113 ms 22956 KB Output is correct
44 Correct 136 ms 22956 KB Output is correct
45 Correct 104 ms 23036 KB Output is correct
46 Correct 143 ms 23036 KB Output is correct
47 Correct 134 ms 23156 KB Output is correct
48 Correct 97 ms 23156 KB Output is correct
49 Correct 97 ms 23156 KB Output is correct
50 Correct 108 ms 24972 KB Output is correct
51 Correct 123 ms 27104 KB Output is correct
52 Correct 138 ms 29160 KB Output is correct
53 Correct 122 ms 31220 KB Output is correct
54 Correct 139 ms 33260 KB Output is correct
55 Correct 137 ms 35276 KB Output is correct
56 Correct 93 ms 37396 KB Output is correct
57 Correct 99 ms 39492 KB Output is correct
58 Correct 102 ms 41400 KB Output is correct
59 Correct 116 ms 43508 KB Output is correct
60 Correct 141 ms 45508 KB Output is correct
61 Correct 103 ms 47572 KB Output is correct
62 Correct 138 ms 49836 KB Output is correct
63 Correct 142 ms 51792 KB Output is correct
64 Correct 86 ms 53732 KB Output is correct
65 Correct 136 ms 55916 KB Output is correct
66 Correct 123 ms 57980 KB Output is correct
67 Correct 125 ms 59920 KB Output is correct
68 Correct 123 ms 61972 KB Output is correct
69 Correct 125 ms 64168 KB Output is correct
70 Runtime error 121 ms 66332 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.