oj.uz

Submission #75221

# Submission time Handle Problem Language Result Execution time Memory
75221 2018-09-08T17:14:42 Z bogdan10bos Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 1606 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 3 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 2 ms 500 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 3 ms 676 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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 3 ms 676 KB Output is correct
11 Correct 367 ms 4536 KB Output is correct
12 Correct 388 ms 4536 KB Output is correct
13 Correct 433 ms 4536 KB Output is correct
14 Correct 490 ms 4536 KB Output is correct
15 Correct 419 ms 4584 KB Output is correct
16 Correct 464 ms 4584 KB Output is correct
17 Correct 458 ms 4584 KB Output is correct
18 Correct 302 ms 5608 KB Output is correct
19 Correct 315 ms 5608 KB Output is correct
20 Correct 405 ms 5608 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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 3 ms 676 KB Output is correct
11 Correct 367 ms 4536 KB Output is correct
12 Correct 388 ms 4536 KB Output is correct
13 Correct 433 ms 4536 KB Output is correct
14 Correct 490 ms 4536 KB Output is correct
15 Correct 419 ms 4584 KB Output is correct
16 Correct 464 ms 4584 KB Output is correct
17 Correct 458 ms 4584 KB Output is correct
18 Correct 302 ms 5608 KB Output is correct
19 Correct 315 ms 5608 KB Output is correct
20 Correct 405 ms 5608 KB Output is correct
21 Correct 455 ms 5608 KB Output is correct
22 Correct 493 ms 5608 KB Output is correct
23 Correct 550 ms 5608 KB Output is correct
24 Correct 523 ms 5608 KB Output is correct
25 Correct 509 ms 5652 KB Output is correct
26 Correct 573 ms 5652 KB Output is correct
27 Correct 568 ms 5652 KB Output is correct
28 Correct 359 ms 6540 KB Output is correct
29 Correct 390 ms 6540 KB Output is correct
30 Correct 485 ms 6540 KB Output is correct
31 Correct 586 ms 6540 KB Output is correct
32 Correct 658 ms 6540 KB Output is correct
33 Correct 542 ms 6540 KB Output is correct
34 Correct 626 ms 6540 KB Output is correct
35 Correct 583 ms 6540 KB Output is correct
36 Correct 298 ms 6540 KB Output is correct
37 Correct 475 ms 6540 KB Output is correct
38 Correct 411 ms 6540 KB Output is correct
39 Correct 514 ms 6540 KB Output is correct
40 Correct 532 ms 6540 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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 3 ms 676 KB Output is correct
11 Correct 96 ms 14224 KB Output is correct
12 Correct 111 ms 14280 KB Output is correct
13 Correct 109 ms 14280 KB Output is correct
14 Correct 129 ms 14280 KB Output is correct
15 Correct 102 ms 14368 KB Output is correct
16 Correct 139 ms 14368 KB Output is correct
17 Correct 131 ms 14368 KB Output is correct
18 Correct 103 ms 14376 KB Output is correct
19 Correct 97 ms 14376 KB Output is correct
20 Correct 100 ms 14376 KB Output is correct
21 Correct 111 ms 14376 KB Output is correct
22 Correct 133 ms 14376 KB Output is correct
23 Correct 124 ms 14376 KB Output is correct
24 Correct 132 ms 14376 KB Output is correct
25 Correct 119 ms 14376 KB Output is correct
26 Correct 82 ms 14376 KB Output is correct
27 Correct 101 ms 14376 KB Output is correct
28 Correct 98 ms 14376 KB Output is correct
29 Correct 108 ms 14376 KB Output is correct
30 Correct 118 ms 14376 KB Output is correct
31 Correct 101 ms 14376 KB Output is correct
32 Correct 130 ms 14376 KB Output is correct
33 Correct 131 ms 14376 KB Output is correct
34 Correct 87 ms 14376 KB Output is correct
35 Correct 166 ms 14376 KB Output is correct
36 Correct 119 ms 14376 KB Output is correct
37 Correct 118 ms 14376 KB Output is correct
38 Correct 118 ms 14376 KB Output is correct
39 Correct 117 ms 14376 KB Output is correct
40 Correct 114 ms 14376 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 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 2 ms 676 KB Output is correct
9 Correct 2 ms 676 KB Output is correct
10 Correct 3 ms 676 KB Output is correct
11 Correct 367 ms 4536 KB Output is correct
12 Correct 388 ms 4536 KB Output is correct
13 Correct 433 ms 4536 KB Output is correct
14 Correct 490 ms 4536 KB Output is correct
15 Correct 419 ms 4584 KB Output is correct
16 Correct 464 ms 4584 KB Output is correct
17 Correct 458 ms 4584 KB Output is correct
18 Correct 302 ms 5608 KB Output is correct
19 Correct 315 ms 5608 KB Output is correct
20 Correct 405 ms 5608 KB Output is correct
21 Correct 455 ms 5608 KB Output is correct
22 Correct 493 ms 5608 KB Output is correct
23 Correct 550 ms 5608 KB Output is correct
24 Correct 523 ms 5608 KB Output is correct
25 Correct 509 ms 5652 KB Output is correct
26 Correct 573 ms 5652 KB Output is correct
27 Correct 568 ms 5652 KB Output is correct
28 Correct 359 ms 6540 KB Output is correct
29 Correct 390 ms 6540 KB Output is correct
30 Correct 485 ms 6540 KB Output is correct
31 Correct 586 ms 6540 KB Output is correct
32 Correct 658 ms 6540 KB Output is correct
33 Correct 542 ms 6540 KB Output is correct
34 Correct 626 ms 6540 KB Output is correct
35 Correct 583 ms 6540 KB Output is correct
36 Correct 298 ms 6540 KB Output is correct
37 Correct 475 ms 6540 KB Output is correct
38 Correct 411 ms 6540 KB Output is correct
39 Correct 514 ms 6540 KB Output is correct
40 Correct 532 ms 6540 KB Output is correct
41 Correct 96 ms 14224 KB Output is correct
42 Correct 111 ms 14280 KB Output is correct
43 Correct 109 ms 14280 KB Output is correct
44 Correct 129 ms 14280 KB Output is correct
45 Correct 102 ms 14368 KB Output is correct
46 Correct 139 ms 14368 KB Output is correct
47 Correct 131 ms 14368 KB Output is correct
48 Correct 103 ms 14376 KB Output is correct
49 Correct 97 ms 14376 KB Output is correct
50 Correct 100 ms 14376 KB Output is correct
51 Correct 111 ms 14376 KB Output is correct
52 Correct 133 ms 14376 KB Output is correct
53 Correct 124 ms 14376 KB Output is correct
54 Correct 132 ms 14376 KB Output is correct
55 Correct 119 ms 14376 KB Output is correct
56 Correct 82 ms 14376 KB Output is correct
57 Correct 101 ms 14376 KB Output is correct
58 Correct 98 ms 14376 KB Output is correct
59 Correct 108 ms 14376 KB Output is correct
60 Correct 118 ms 14376 KB Output is correct
61 Correct 101 ms 14376 KB Output is correct
62 Correct 130 ms 14376 KB Output is correct
63 Correct 131 ms 14376 KB Output is correct
64 Correct 87 ms 14376 KB Output is correct
65 Correct 166 ms 14376 KB Output is correct
66 Correct 119 ms 14376 KB Output is correct
67 Correct 118 ms 14376 KB Output is correct
68 Correct 118 ms 14376 KB Output is correct
69 Correct 117 ms 14376 KB Output is correct
70 Correct 114 ms 14376 KB Output is correct
71 Correct 731 ms 18988 KB Output is correct
72 Correct 735 ms 19128 KB Output is correct
73 Correct 923 ms 19128 KB Output is correct
74 Correct 1318 ms 19128 KB Output is correct
75 Correct 791 ms 19980 KB Output is correct
76 Correct 1606 ms 19980 KB Output is correct
77 Correct 1256 ms 19980 KB Output is correct
78 Correct 456 ms 21888 KB Output is correct
79 Correct 605 ms 21888 KB Output is correct
80 Correct 778 ms 21888 KB Output is correct
81 Correct 1022 ms 21888 KB Output is correct
82 Correct 1294 ms 21888 KB Output is correct
83 Correct 742 ms 21888 KB Output is correct
84 Correct 1348 ms 21888 KB Output is correct
85 Correct 1287 ms 21888 KB Output is correct
86 Correct 457 ms 21888 KB Output is correct
87 Correct 790 ms 21888 KB Output is correct
88 Correct 646 ms 21888 KB Output is correct
89 Correct 984 ms 21888 KB Output is correct
90 Correct 1187 ms 21888 KB Output is correct
91 Correct 745 ms 21888 KB Output is correct
92 Correct 1418 ms 21888 KB Output is correct
93 Correct 1277 ms 21888 KB Output is correct
94 Correct 426 ms 37788 KB Output is correct
95 Correct 1067 ms 40020 KB Output is correct
96 Correct 1090 ms 61416 KB Output is correct
97 Runtime error 1073 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.
98 Halted 0 ms 0 KB -