oj.uz

Submission #75218

# Submission time Handle Problem Language Result Execution time Memory
75218 2018-09-08T17:10:38 Z bogdan10bos Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 1512 ms 65712 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 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 580 KB Output is correct
5 Correct 3 ms 580 KB Output is correct
6 Correct 3 ms 580 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 2 ms 672 KB Output is correct
9 Correct 3 ms 708 KB Output is correct
10 Correct 3 ms 716 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 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 580 KB Output is correct
5 Correct 3 ms 580 KB Output is correct
6 Correct 3 ms 580 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 2 ms 672 KB Output is correct
9 Correct 3 ms 708 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 361 ms 10724 KB Output is correct
12 Correct 400 ms 15444 KB Output is correct
13 Correct 412 ms 18456 KB Output is correct
14 Correct 429 ms 18976 KB Output is correct
15 Correct 415 ms 20024 KB Output is correct
16 Correct 469 ms 20024 KB Output is correct
17 Correct 484 ms 20024 KB Output is correct
18 Correct 293 ms 24088 KB Output is correct
19 Correct 320 ms 24088 KB Output is correct
20 Correct 403 ms 24412 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 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 580 KB Output is correct
5 Correct 3 ms 580 KB Output is correct
6 Correct 3 ms 580 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 2 ms 672 KB Output is correct
9 Correct 3 ms 708 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 361 ms 10724 KB Output is correct
12 Correct 400 ms 15444 KB Output is correct
13 Correct 412 ms 18456 KB Output is correct
14 Correct 429 ms 18976 KB Output is correct
15 Correct 415 ms 20024 KB Output is correct
16 Correct 469 ms 20024 KB Output is correct
17 Correct 484 ms 20024 KB Output is correct
18 Correct 293 ms 24088 KB Output is correct
19 Correct 320 ms 24088 KB Output is correct
20 Correct 403 ms 24412 KB Output is correct
21 Correct 474 ms 24868 KB Output is correct
22 Correct 510 ms 27040 KB Output is correct
23 Correct 539 ms 28308 KB Output is correct
24 Correct 553 ms 28308 KB Output is correct
25 Correct 507 ms 30100 KB Output is correct
26 Correct 567 ms 30276 KB Output is correct
27 Correct 566 ms 30420 KB Output is correct
28 Correct 320 ms 32856 KB Output is correct
29 Correct 378 ms 32856 KB Output is correct
30 Correct 506 ms 32856 KB Output is correct
31 Correct 574 ms 32856 KB Output is correct
32 Correct 608 ms 32856 KB Output is correct
33 Correct 447 ms 32856 KB Output is correct
34 Correct 576 ms 32856 KB Output is correct
35 Correct 575 ms 32856 KB Output is correct
36 Correct 299 ms 32856 KB Output is correct
37 Correct 453 ms 32856 KB Output is correct
38 Correct 408 ms 32856 KB Output is correct
39 Correct 533 ms 32856 KB Output is correct
40 Correct 569 ms 32856 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 580 KB Output is correct
5 Correct 3 ms 580 KB Output is correct
6 Correct 3 ms 580 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 2 ms 672 KB Output is correct
9 Correct 3 ms 708 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 103 ms 40356 KB Output is correct
12 Correct 106 ms 40356 KB Output is correct
13 Correct 111 ms 40356 KB Output is correct
14 Correct 147 ms 40356 KB Output is correct
15 Correct 102 ms 40392 KB Output is correct
16 Correct 136 ms 40392 KB Output is correct
17 Correct 125 ms 40392 KB Output is correct
18 Correct 87 ms 40500 KB Output is correct
19 Correct 98 ms 40500 KB Output is correct
20 Correct 108 ms 40500 KB Output is correct
21 Correct 113 ms 40500 KB Output is correct
22 Correct 142 ms 40500 KB Output is correct
23 Correct 109 ms 40500 KB Output is correct
24 Correct 131 ms 40500 KB Output is correct
25 Correct 133 ms 40500 KB Output is correct
26 Correct 87 ms 40500 KB Output is correct
27 Correct 102 ms 40500 KB Output is correct
28 Correct 99 ms 40500 KB Output is correct
29 Correct 114 ms 40500 KB Output is correct
30 Correct 125 ms 40500 KB Output is correct
31 Correct 102 ms 40500 KB Output is correct
32 Correct 135 ms 40500 KB Output is correct
33 Correct 137 ms 40500 KB Output is correct
34 Correct 91 ms 40500 KB Output is correct
35 Correct 123 ms 40500 KB Output is correct
36 Correct 119 ms 40500 KB Output is correct
37 Correct 124 ms 40500 KB Output is correct
38 Correct 121 ms 40500 KB Output is correct
39 Correct 122 ms 40500 KB Output is correct
40 Correct 117 ms 40500 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 580 KB Output is correct
5 Correct 3 ms 580 KB Output is correct
6 Correct 3 ms 580 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 2 ms 672 KB Output is correct
9 Correct 3 ms 708 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 361 ms 10724 KB Output is correct
12 Correct 400 ms 15444 KB Output is correct
13 Correct 412 ms 18456 KB Output is correct
14 Correct 429 ms 18976 KB Output is correct
15 Correct 415 ms 20024 KB Output is correct
16 Correct 469 ms 20024 KB Output is correct
17 Correct 484 ms 20024 KB Output is correct
18 Correct 293 ms 24088 KB Output is correct
19 Correct 320 ms 24088 KB Output is correct
20 Correct 403 ms 24412 KB Output is correct
21 Correct 474 ms 24868 KB Output is correct
22 Correct 510 ms 27040 KB Output is correct
23 Correct 539 ms 28308 KB Output is correct
24 Correct 553 ms 28308 KB Output is correct
25 Correct 507 ms 30100 KB Output is correct
26 Correct 567 ms 30276 KB Output is correct
27 Correct 566 ms 30420 KB Output is correct
28 Correct 320 ms 32856 KB Output is correct
29 Correct 378 ms 32856 KB Output is correct
30 Correct 506 ms 32856 KB Output is correct
31 Correct 574 ms 32856 KB Output is correct
32 Correct 608 ms 32856 KB Output is correct
33 Correct 447 ms 32856 KB Output is correct
34 Correct 576 ms 32856 KB Output is correct
35 Correct 575 ms 32856 KB Output is correct
36 Correct 299 ms 32856 KB Output is correct
37 Correct 453 ms 32856 KB Output is correct
38 Correct 408 ms 32856 KB Output is correct
39 Correct 533 ms 32856 KB Output is correct
40 Correct 569 ms 32856 KB Output is correct
41 Correct 103 ms 40356 KB Output is correct
42 Correct 106 ms 40356 KB Output is correct
43 Correct 111 ms 40356 KB Output is correct
44 Correct 147 ms 40356 KB Output is correct
45 Correct 102 ms 40392 KB Output is correct
46 Correct 136 ms 40392 KB Output is correct
47 Correct 125 ms 40392 KB Output is correct
48 Correct 87 ms 40500 KB Output is correct
49 Correct 98 ms 40500 KB Output is correct
50 Correct 108 ms 40500 KB Output is correct
51 Correct 113 ms 40500 KB Output is correct
52 Correct 142 ms 40500 KB Output is correct
53 Correct 109 ms 40500 KB Output is correct
54 Correct 131 ms 40500 KB Output is correct
55 Correct 133 ms 40500 KB Output is correct
56 Correct 87 ms 40500 KB Output is correct
57 Correct 102 ms 40500 KB Output is correct
58 Correct 99 ms 40500 KB Output is correct
59 Correct 114 ms 40500 KB Output is correct
60 Correct 125 ms 40500 KB Output is correct
61 Correct 102 ms 40500 KB Output is correct
62 Correct 135 ms 40500 KB Output is correct
63 Correct 137 ms 40500 KB Output is correct
64 Correct 91 ms 40500 KB Output is correct
65 Correct 123 ms 40500 KB Output is correct
66 Correct 119 ms 40500 KB Output is correct
67 Correct 124 ms 40500 KB Output is correct
68 Correct 121 ms 40500 KB Output is correct
69 Correct 122 ms 40500 KB Output is correct
70 Correct 117 ms 40500 KB Output is correct
71 Correct 794 ms 45076 KB Output is correct
72 Correct 806 ms 45236 KB Output is correct
73 Correct 964 ms 45236 KB Output is correct
74 Correct 1328 ms 45236 KB Output is correct
75 Correct 738 ms 46020 KB Output is correct
76 Correct 1512 ms 46020 KB Output is correct
77 Correct 1261 ms 46020 KB Output is correct
78 Correct 450 ms 47936 KB Output is correct
79 Correct 628 ms 47936 KB Output is correct
80 Correct 772 ms 47936 KB Output is correct
81 Correct 995 ms 47936 KB Output is correct
82 Correct 1281 ms 47936 KB Output is correct
83 Correct 730 ms 47936 KB Output is correct
84 Correct 1345 ms 47936 KB Output is correct
85 Correct 1280 ms 47936 KB Output is correct
86 Correct 433 ms 47936 KB Output is correct
87 Correct 761 ms 47936 KB Output is correct
88 Correct 619 ms 47936 KB Output is correct
89 Correct 924 ms 47936 KB Output is correct
90 Runtime error 1151 ms 65712 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.
91 Halted 0 ms 0 KB -