oj.uz

Submission #75213

# Submission time Handle Problem Language Result Execution time Memory
75213 2018-09-08T17:06:14 Z bogdan10bos Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 1485 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 2 ms 432 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 3 ms 608 KB Output is correct
5 Correct 2 ms 696 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 2 ms 744 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 2 ms 432 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 3 ms 608 KB Output is correct
5 Correct 2 ms 696 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 2 ms 744 KB Output is correct
11 Correct 416 ms 6204 KB Output is correct
12 Correct 402 ms 6204 KB Output is correct
13 Correct 430 ms 6204 KB Output is correct
14 Correct 433 ms 6204 KB Output is correct
15 Correct 423 ms 6824 KB Output is correct
16 Correct 460 ms 6824 KB Output is correct
17 Correct 472 ms 6824 KB Output is correct
18 Correct 291 ms 9028 KB Output is correct
19 Correct 326 ms 9028 KB Output is correct
20 Correct 411 ms 9028 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 2 ms 432 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 3 ms 608 KB Output is correct
5 Correct 2 ms 696 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 2 ms 744 KB Output is correct
11 Correct 416 ms 6204 KB Output is correct
12 Correct 402 ms 6204 KB Output is correct
13 Correct 430 ms 6204 KB Output is correct
14 Correct 433 ms 6204 KB Output is correct
15 Correct 423 ms 6824 KB Output is correct
16 Correct 460 ms 6824 KB Output is correct
17 Correct 472 ms 6824 KB Output is correct
18 Correct 291 ms 9028 KB Output is correct
19 Correct 326 ms 9028 KB Output is correct
20 Correct 411 ms 9028 KB Output is correct
21 Correct 493 ms 9028 KB Output is correct
22 Correct 477 ms 9288 KB Output is correct
23 Correct 548 ms 9288 KB Output is correct
24 Correct 629 ms 9288 KB Output is correct
25 Correct 513 ms 10784 KB Output is correct
26 Correct 588 ms 10784 KB Output is correct
27 Correct 620 ms 10784 KB Output is correct
28 Correct 318 ms 12076 KB Output is correct
29 Correct 391 ms 12076 KB Output is correct
30 Correct 499 ms 12076 KB Output is correct
31 Correct 571 ms 12076 KB Output is correct
32 Correct 611 ms 12076 KB Output is correct
33 Correct 487 ms 12076 KB Output is correct
34 Correct 622 ms 12076 KB Output is correct
35 Correct 605 ms 12076 KB Output is correct
36 Correct 312 ms 12076 KB Output is correct
37 Correct 467 ms 12076 KB Output is correct
38 Correct 397 ms 12076 KB Output is correct
39 Correct 532 ms 12076 KB Output is correct
40 Correct 536 ms 12076 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 2 ms 432 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 3 ms 608 KB Output is correct
5 Correct 2 ms 696 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 2 ms 744 KB Output is correct
11 Correct 103 ms 21396 KB Output is correct
12 Correct 106 ms 21396 KB Output is correct
13 Correct 119 ms 21396 KB Output is correct
14 Correct 186 ms 21396 KB Output is correct
15 Correct 106 ms 21424 KB Output is correct
16 Correct 140 ms 21424 KB Output is correct
17 Correct 132 ms 21424 KB Output is correct
18 Correct 88 ms 21660 KB Output is correct
19 Correct 99 ms 21660 KB Output is correct
20 Correct 105 ms 21660 KB Output is correct
21 Correct 115 ms 21660 KB Output is correct
22 Correct 141 ms 21660 KB Output is correct
23 Correct 105 ms 21660 KB Output is correct
24 Correct 134 ms 21660 KB Output is correct
25 Correct 130 ms 21660 KB Output is correct
26 Correct 87 ms 21660 KB Output is correct
27 Correct 100 ms 21660 KB Output is correct
28 Correct 99 ms 21660 KB Output is correct
29 Correct 116 ms 21660 KB Output is correct
30 Correct 123 ms 21660 KB Output is correct
31 Correct 104 ms 21660 KB Output is correct
32 Correct 142 ms 21660 KB Output is correct
33 Correct 132 ms 21660 KB Output is correct
34 Correct 87 ms 21660 KB Output is correct
35 Correct 122 ms 21660 KB Output is correct
36 Correct 117 ms 21660 KB Output is correct
37 Correct 122 ms 21660 KB Output is correct
38 Correct 159 ms 21660 KB Output is correct
39 Correct 122 ms 21660 KB Output is correct
40 Correct 119 ms 21660 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 2 ms 432 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 3 ms 608 KB Output is correct
5 Correct 2 ms 696 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 2 ms 744 KB Output is correct
11 Correct 416 ms 6204 KB Output is correct
12 Correct 402 ms 6204 KB Output is correct
13 Correct 430 ms 6204 KB Output is correct
14 Correct 433 ms 6204 KB Output is correct
15 Correct 423 ms 6824 KB Output is correct
16 Correct 460 ms 6824 KB Output is correct
17 Correct 472 ms 6824 KB Output is correct
18 Correct 291 ms 9028 KB Output is correct
19 Correct 326 ms 9028 KB Output is correct
20 Correct 411 ms 9028 KB Output is correct
21 Correct 493 ms 9028 KB Output is correct
22 Correct 477 ms 9288 KB Output is correct
23 Correct 548 ms 9288 KB Output is correct
24 Correct 629 ms 9288 KB Output is correct
25 Correct 513 ms 10784 KB Output is correct
26 Correct 588 ms 10784 KB Output is correct
27 Correct 620 ms 10784 KB Output is correct
28 Correct 318 ms 12076 KB Output is correct
29 Correct 391 ms 12076 KB Output is correct
30 Correct 499 ms 12076 KB Output is correct
31 Correct 571 ms 12076 KB Output is correct
32 Correct 611 ms 12076 KB Output is correct
33 Correct 487 ms 12076 KB Output is correct
34 Correct 622 ms 12076 KB Output is correct
35 Correct 605 ms 12076 KB Output is correct
36 Correct 312 ms 12076 KB Output is correct
37 Correct 467 ms 12076 KB Output is correct
38 Correct 397 ms 12076 KB Output is correct
39 Correct 532 ms 12076 KB Output is correct
40 Correct 536 ms 12076 KB Output is correct
41 Correct 103 ms 21396 KB Output is correct
42 Correct 106 ms 21396 KB Output is correct
43 Correct 119 ms 21396 KB Output is correct
44 Correct 186 ms 21396 KB Output is correct
45 Correct 106 ms 21424 KB Output is correct
46 Correct 140 ms 21424 KB Output is correct
47 Correct 132 ms 21424 KB Output is correct
48 Correct 88 ms 21660 KB Output is correct
49 Correct 99 ms 21660 KB Output is correct
50 Correct 105 ms 21660 KB Output is correct
51 Correct 115 ms 21660 KB Output is correct
52 Correct 141 ms 21660 KB Output is correct
53 Correct 105 ms 21660 KB Output is correct
54 Correct 134 ms 21660 KB Output is correct
55 Correct 130 ms 21660 KB Output is correct
56 Correct 87 ms 21660 KB Output is correct
57 Correct 100 ms 21660 KB Output is correct
58 Correct 99 ms 21660 KB Output is correct
59 Correct 116 ms 21660 KB Output is correct
60 Correct 123 ms 21660 KB Output is correct
61 Correct 104 ms 21660 KB Output is correct
62 Correct 142 ms 21660 KB Output is correct
63 Correct 132 ms 21660 KB Output is correct
64 Correct 87 ms 21660 KB Output is correct
65 Correct 122 ms 21660 KB Output is correct
66 Correct 117 ms 21660 KB Output is correct
67 Correct 122 ms 21660 KB Output is correct
68 Correct 159 ms 21660 KB Output is correct
69 Correct 122 ms 21660 KB Output is correct
70 Correct 119 ms 21660 KB Output is correct
71 Correct 819 ms 26612 KB Output is correct
72 Correct 805 ms 26928 KB Output is correct
73 Correct 961 ms 26928 KB Output is correct
74 Correct 1360 ms 26928 KB Output is correct
75 Correct 791 ms 28200 KB Output is correct
76 Correct 1485 ms 28200 KB Output is correct
77 Correct 1255 ms 28200 KB Output is correct
78 Correct 455 ms 30108 KB Output is correct
79 Correct 630 ms 30108 KB Output is correct
80 Correct 783 ms 43964 KB Output is correct
81 Correct 1034 ms 43964 KB Output is correct
82 Correct 1471 ms 43964 KB Output is correct
83 Correct 757 ms 43964 KB Output is correct
84 Correct 1353 ms 64324 KB Output is correct
85 Runtime error 1316 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.
86 Halted 0 ms 0 KB -