oj.uz

Submission #75208

# Submission time Handle Problem Language Result Execution time Memory
75208 2018-09-08T16:57:00 Z bogdan10bos Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 1497 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 2 ms 384 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 676 KB Output is correct
5 Correct 3 ms 676 KB Output is correct
6 Correct 3 ms 676 KB Output is correct
7 Correct 3 ms 676 KB Output is correct
8 Correct 3 ms 676 KB Output is correct
9 Correct 3 ms 676 KB Output is correct
10 Correct 2 ms 728 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 2 ms 384 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 676 KB Output is correct
5 Correct 3 ms 676 KB Output is correct
6 Correct 3 ms 676 KB Output is correct
7 Correct 3 ms 676 KB Output is correct
8 Correct 3 ms 676 KB Output is correct
9 Correct 3 ms 676 KB Output is correct
10 Correct 2 ms 728 KB Output is correct
11 Correct 384 ms 7728 KB Output is correct
12 Correct 425 ms 7896 KB Output is correct
13 Correct 486 ms 8468 KB Output is correct
14 Correct 435 ms 8468 KB Output is correct
15 Correct 447 ms 9472 KB Output is correct
16 Correct 478 ms 9472 KB Output is correct
17 Correct 480 ms 10872 KB Output is correct
18 Correct 299 ms 13536 KB Output is correct
19 Correct 366 ms 13536 KB Output is correct
20 Correct 417 ms 13536 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 2 ms 384 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 676 KB Output is correct
5 Correct 3 ms 676 KB Output is correct
6 Correct 3 ms 676 KB Output is correct
7 Correct 3 ms 676 KB Output is correct
8 Correct 3 ms 676 KB Output is correct
9 Correct 3 ms 676 KB Output is correct
10 Correct 2 ms 728 KB Output is correct
11 Correct 384 ms 7728 KB Output is correct
12 Correct 425 ms 7896 KB Output is correct
13 Correct 486 ms 8468 KB Output is correct
14 Correct 435 ms 8468 KB Output is correct
15 Correct 447 ms 9472 KB Output is correct
16 Correct 478 ms 9472 KB Output is correct
17 Correct 480 ms 10872 KB Output is correct
18 Correct 299 ms 13536 KB Output is correct
19 Correct 366 ms 13536 KB Output is correct
20 Correct 417 ms 13536 KB Output is correct
21 Correct 489 ms 13536 KB Output is correct
22 Correct 515 ms 14828 KB Output is correct
23 Correct 581 ms 14828 KB Output is correct
24 Correct 551 ms 14828 KB Output is correct
25 Correct 524 ms 15720 KB Output is correct
26 Correct 620 ms 15720 KB Output is correct
27 Correct 588 ms 15720 KB Output is correct
28 Correct 341 ms 16688 KB Output is correct
29 Correct 395 ms 16688 KB Output is correct
30 Correct 485 ms 16688 KB Output is correct
31 Correct 594 ms 16688 KB Output is correct
32 Correct 621 ms 16688 KB Output is correct
33 Correct 499 ms 16688 KB Output is correct
34 Correct 634 ms 16688 KB Output is correct
35 Correct 547 ms 16688 KB Output is correct
36 Correct 293 ms 16688 KB Output is correct
37 Correct 468 ms 17480 KB Output is correct
38 Correct 379 ms 17480 KB Output is correct
39 Correct 544 ms 17480 KB Output is correct
40 Correct 534 ms 17480 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 2 ms 384 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 676 KB Output is correct
5 Correct 3 ms 676 KB Output is correct
6 Correct 3 ms 676 KB Output is correct
7 Correct 3 ms 676 KB Output is correct
8 Correct 3 ms 676 KB Output is correct
9 Correct 3 ms 676 KB Output is correct
10 Correct 2 ms 728 KB Output is correct
11 Correct 105 ms 27088 KB Output is correct
12 Correct 104 ms 27088 KB Output is correct
13 Correct 115 ms 27088 KB Output is correct
14 Correct 148 ms 27088 KB Output is correct
15 Correct 104 ms 27088 KB Output is correct
16 Correct 148 ms 27124 KB Output is correct
17 Correct 129 ms 27124 KB Output is correct
18 Correct 94 ms 27244 KB Output is correct
19 Correct 99 ms 27244 KB Output is correct
20 Correct 103 ms 27244 KB Output is correct
21 Correct 125 ms 27244 KB Output is correct
22 Correct 132 ms 27244 KB Output is correct
23 Correct 99 ms 27244 KB Output is correct
24 Correct 134 ms 27244 KB Output is correct
25 Correct 129 ms 27244 KB Output is correct
26 Correct 84 ms 27244 KB Output is correct
27 Correct 100 ms 27244 KB Output is correct
28 Correct 103 ms 27244 KB Output is correct
29 Correct 118 ms 27244 KB Output is correct
30 Correct 132 ms 27244 KB Output is correct
31 Correct 102 ms 27244 KB Output is correct
32 Correct 145 ms 27244 KB Output is correct
33 Correct 126 ms 27244 KB Output is correct
34 Correct 84 ms 27244 KB Output is correct
35 Correct 125 ms 27244 KB Output is correct
36 Correct 117 ms 27244 KB Output is correct
37 Correct 123 ms 27244 KB Output is correct
38 Correct 115 ms 27244 KB Output is correct
39 Correct 118 ms 27244 KB Output is correct
40 Correct 122 ms 27244 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 2 ms 384 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 676 KB Output is correct
5 Correct 3 ms 676 KB Output is correct
6 Correct 3 ms 676 KB Output is correct
7 Correct 3 ms 676 KB Output is correct
8 Correct 3 ms 676 KB Output is correct
9 Correct 3 ms 676 KB Output is correct
10 Correct 2 ms 728 KB Output is correct
11 Correct 384 ms 7728 KB Output is correct
12 Correct 425 ms 7896 KB Output is correct
13 Correct 486 ms 8468 KB Output is correct
14 Correct 435 ms 8468 KB Output is correct
15 Correct 447 ms 9472 KB Output is correct
16 Correct 478 ms 9472 KB Output is correct
17 Correct 480 ms 10872 KB Output is correct
18 Correct 299 ms 13536 KB Output is correct
19 Correct 366 ms 13536 KB Output is correct
20 Correct 417 ms 13536 KB Output is correct
21 Correct 489 ms 13536 KB Output is correct
22 Correct 515 ms 14828 KB Output is correct
23 Correct 581 ms 14828 KB Output is correct
24 Correct 551 ms 14828 KB Output is correct
25 Correct 524 ms 15720 KB Output is correct
26 Correct 620 ms 15720 KB Output is correct
27 Correct 588 ms 15720 KB Output is correct
28 Correct 341 ms 16688 KB Output is correct
29 Correct 395 ms 16688 KB Output is correct
30 Correct 485 ms 16688 KB Output is correct
31 Correct 594 ms 16688 KB Output is correct
32 Correct 621 ms 16688 KB Output is correct
33 Correct 499 ms 16688 KB Output is correct
34 Correct 634 ms 16688 KB Output is correct
35 Correct 547 ms 16688 KB Output is correct
36 Correct 293 ms 16688 KB Output is correct
37 Correct 468 ms 17480 KB Output is correct
38 Correct 379 ms 17480 KB Output is correct
39 Correct 544 ms 17480 KB Output is correct
40 Correct 534 ms 17480 KB Output is correct
41 Correct 105 ms 27088 KB Output is correct
42 Correct 104 ms 27088 KB Output is correct
43 Correct 115 ms 27088 KB Output is correct
44 Correct 148 ms 27088 KB Output is correct
45 Correct 104 ms 27088 KB Output is correct
46 Correct 148 ms 27124 KB Output is correct
47 Correct 129 ms 27124 KB Output is correct
48 Correct 94 ms 27244 KB Output is correct
49 Correct 99 ms 27244 KB Output is correct
50 Correct 103 ms 27244 KB Output is correct
51 Correct 125 ms 27244 KB Output is correct
52 Correct 132 ms 27244 KB Output is correct
53 Correct 99 ms 27244 KB Output is correct
54 Correct 134 ms 27244 KB Output is correct
55 Correct 129 ms 27244 KB Output is correct
56 Correct 84 ms 27244 KB Output is correct
57 Correct 100 ms 27244 KB Output is correct
58 Correct 103 ms 27244 KB Output is correct
59 Correct 118 ms 27244 KB Output is correct
60 Correct 132 ms 27244 KB Output is correct
61 Correct 102 ms 27244 KB Output is correct
62 Correct 145 ms 27244 KB Output is correct
63 Correct 126 ms 27244 KB Output is correct
64 Correct 84 ms 27244 KB Output is correct
65 Correct 125 ms 27244 KB Output is correct
66 Correct 117 ms 27244 KB Output is correct
67 Correct 123 ms 27244 KB Output is correct
68 Correct 115 ms 27244 KB Output is correct
69 Correct 118 ms 27244 KB Output is correct
70 Correct 122 ms 27244 KB Output is correct
71 Correct 770 ms 31908 KB Output is correct
72 Correct 850 ms 31964 KB Output is correct
73 Correct 1006 ms 31964 KB Output is correct
74 Correct 1380 ms 31964 KB Output is correct
75 Correct 769 ms 32732 KB Output is correct
76 Correct 1497 ms 32732 KB Output is correct
77 Correct 1390 ms 52720 KB Output is correct
78 Correct 473 ms 56260 KB Output is correct
79 Runtime error 641 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.
80 Halted 0 ms 0 KB -