oj.uz

Submission #75222

# Submission time Handle Problem Language Result Execution time Memory
75222 2018-09-08T17:16:05 Z bogdan10bos Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 1424 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 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 3 ms 528 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 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 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 3 ms 528 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 356 ms 5508 KB Output is correct
12 Correct 411 ms 5636 KB Output is correct
13 Correct 433 ms 5752 KB Output is correct
14 Correct 425 ms 6664 KB Output is correct
15 Correct 442 ms 7788 KB Output is correct
16 Correct 462 ms 7788 KB Output is correct
17 Correct 467 ms 7788 KB Output is correct
18 Correct 286 ms 9348 KB Output is correct
19 Correct 383 ms 9348 KB Output is correct
20 Correct 401 ms 9348 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 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 3 ms 528 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 356 ms 5508 KB Output is correct
12 Correct 411 ms 5636 KB Output is correct
13 Correct 433 ms 5752 KB Output is correct
14 Correct 425 ms 6664 KB Output is correct
15 Correct 442 ms 7788 KB Output is correct
16 Correct 462 ms 7788 KB Output is correct
17 Correct 467 ms 7788 KB Output is correct
18 Correct 286 ms 9348 KB Output is correct
19 Correct 383 ms 9348 KB Output is correct
20 Correct 401 ms 9348 KB Output is correct
21 Correct 484 ms 9348 KB Output is correct
22 Correct 530 ms 9512 KB Output is correct
23 Correct 559 ms 9512 KB Output is correct
24 Correct 560 ms 9512 KB Output is correct
25 Correct 519 ms 11076 KB Output is correct
26 Correct 590 ms 12252 KB Output is correct
27 Correct 566 ms 12252 KB Output is correct
28 Correct 343 ms 14560 KB Output is correct
29 Correct 416 ms 14560 KB Output is correct
30 Correct 492 ms 14560 KB Output is correct
31 Correct 571 ms 14560 KB Output is correct
32 Correct 638 ms 14560 KB Output is correct
33 Correct 480 ms 14560 KB Output is correct
34 Correct 575 ms 14560 KB Output is correct
35 Correct 565 ms 14660 KB Output is correct
36 Correct 352 ms 14660 KB Output is correct
37 Correct 497 ms 16112 KB Output is correct
38 Correct 390 ms 16112 KB Output is correct
39 Correct 492 ms 16112 KB Output is correct
40 Correct 545 ms 16112 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 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 3 ms 528 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 100 ms 25576 KB Output is correct
12 Correct 96 ms 25576 KB Output is correct
13 Correct 107 ms 25576 KB Output is correct
14 Correct 120 ms 25576 KB Output is correct
15 Correct 102 ms 25608 KB Output is correct
16 Correct 134 ms 25608 KB Output is correct
17 Correct 128 ms 25608 KB Output is correct
18 Correct 86 ms 25736 KB Output is correct
19 Correct 94 ms 25736 KB Output is correct
20 Correct 99 ms 25736 KB Output is correct
21 Correct 117 ms 25736 KB Output is correct
22 Correct 125 ms 25736 KB Output is correct
23 Correct 100 ms 26344 KB Output is correct
24 Correct 186 ms 26344 KB Output is correct
25 Correct 121 ms 26424 KB Output is correct
26 Correct 87 ms 26424 KB Output is correct
27 Correct 101 ms 26424 KB Output is correct
28 Correct 93 ms 26424 KB Output is correct
29 Correct 109 ms 26424 KB Output is correct
30 Correct 126 ms 26424 KB Output is correct
31 Correct 118 ms 26424 KB Output is correct
32 Correct 140 ms 26424 KB Output is correct
33 Correct 124 ms 26424 KB Output is correct
34 Correct 90 ms 26424 KB Output is correct
35 Correct 116 ms 26424 KB Output is correct
36 Correct 158 ms 26424 KB Output is correct
37 Correct 115 ms 26424 KB Output is correct
38 Correct 114 ms 26424 KB Output is correct
39 Correct 112 ms 26448 KB Output is correct
40 Correct 127 ms 26448 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 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 3 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 3 ms 528 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 356 ms 5508 KB Output is correct
12 Correct 411 ms 5636 KB Output is correct
13 Correct 433 ms 5752 KB Output is correct
14 Correct 425 ms 6664 KB Output is correct
15 Correct 442 ms 7788 KB Output is correct
16 Correct 462 ms 7788 KB Output is correct
17 Correct 467 ms 7788 KB Output is correct
18 Correct 286 ms 9348 KB Output is correct
19 Correct 383 ms 9348 KB Output is correct
20 Correct 401 ms 9348 KB Output is correct
21 Correct 484 ms 9348 KB Output is correct
22 Correct 530 ms 9512 KB Output is correct
23 Correct 559 ms 9512 KB Output is correct
24 Correct 560 ms 9512 KB Output is correct
25 Correct 519 ms 11076 KB Output is correct
26 Correct 590 ms 12252 KB Output is correct
27 Correct 566 ms 12252 KB Output is correct
28 Correct 343 ms 14560 KB Output is correct
29 Correct 416 ms 14560 KB Output is correct
30 Correct 492 ms 14560 KB Output is correct
31 Correct 571 ms 14560 KB Output is correct
32 Correct 638 ms 14560 KB Output is correct
33 Correct 480 ms 14560 KB Output is correct
34 Correct 575 ms 14560 KB Output is correct
35 Correct 565 ms 14660 KB Output is correct
36 Correct 352 ms 14660 KB Output is correct
37 Correct 497 ms 16112 KB Output is correct
38 Correct 390 ms 16112 KB Output is correct
39 Correct 492 ms 16112 KB Output is correct
40 Correct 545 ms 16112 KB Output is correct
41 Correct 100 ms 25576 KB Output is correct
42 Correct 96 ms 25576 KB Output is correct
43 Correct 107 ms 25576 KB Output is correct
44 Correct 120 ms 25576 KB Output is correct
45 Correct 102 ms 25608 KB Output is correct
46 Correct 134 ms 25608 KB Output is correct
47 Correct 128 ms 25608 KB Output is correct
48 Correct 86 ms 25736 KB Output is correct
49 Correct 94 ms 25736 KB Output is correct
50 Correct 99 ms 25736 KB Output is correct
51 Correct 117 ms 25736 KB Output is correct
52 Correct 125 ms 25736 KB Output is correct
53 Correct 100 ms 26344 KB Output is correct
54 Correct 186 ms 26344 KB Output is correct
55 Correct 121 ms 26424 KB Output is correct
56 Correct 87 ms 26424 KB Output is correct
57 Correct 101 ms 26424 KB Output is correct
58 Correct 93 ms 26424 KB Output is correct
59 Correct 109 ms 26424 KB Output is correct
60 Correct 126 ms 26424 KB Output is correct
61 Correct 118 ms 26424 KB Output is correct
62 Correct 140 ms 26424 KB Output is correct
63 Correct 124 ms 26424 KB Output is correct
64 Correct 90 ms 26424 KB Output is correct
65 Correct 116 ms 26424 KB Output is correct
66 Correct 158 ms 26424 KB Output is correct
67 Correct 115 ms 26424 KB Output is correct
68 Correct 114 ms 26424 KB Output is correct
69 Correct 112 ms 26448 KB Output is correct
70 Correct 127 ms 26448 KB Output is correct
71 Correct 747 ms 31904 KB Output is correct
72 Correct 747 ms 32048 KB Output is correct
73 Correct 927 ms 32048 KB Output is correct
74 Correct 1290 ms 32048 KB Output is correct
75 Correct 745 ms 34308 KB Output is correct
76 Correct 1361 ms 34308 KB Output is correct
77 Correct 1187 ms 34308 KB Output is correct
78 Correct 417 ms 37196 KB Output is correct
79 Correct 589 ms 37196 KB Output is correct
80 Correct 750 ms 37196 KB Output is correct
81 Correct 1080 ms 37196 KB Output is correct
82 Correct 1291 ms 37196 KB Output is correct
83 Correct 774 ms 37196 KB Output is correct
84 Correct 1340 ms 37196 KB Output is correct
85 Correct 1248 ms 37196 KB Output is correct
86 Correct 459 ms 37196 KB Output is correct
87 Correct 750 ms 37196 KB Output is correct
88 Correct 640 ms 37196 KB Output is correct
89 Correct 956 ms 37196 KB Output is correct
90 Correct 1289 ms 37196 KB Output is correct
91 Correct 747 ms 37196 KB Output is correct
92 Correct 1424 ms 37460 KB Output is correct
93 Correct 1261 ms 37460 KB Output is correct
94 Correct 408 ms 52332 KB Output is correct
95 Correct 1060 ms 54240 KB Output is correct
96 Correct 1098 ms 54408 KB Output is correct
97 Correct 1067 ms 54408 KB Output is correct
98 Runtime error 1083 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.
99 Halted 0 ms 0 KB -