답안 #75206 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
75206	2018-09-08T16:55:58 Z	bogdan10bos	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	1467 ms	66560 KB

snake_escaping

#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

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	4 ms	432 KB	Output is correct
4	Correct	3 ms	444 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	3 ms	656 KB	Output is correct
7	Correct	3 ms	656 KB	Output is correct
8	Correct	2 ms	656 KB	Output is correct
9	Correct	3 ms	664 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	4 ms	432 KB	Output is correct
4	Correct	3 ms	444 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	3 ms	656 KB	Output is correct
7	Correct	3 ms	656 KB	Output is correct
8	Correct	2 ms	656 KB	Output is correct
9	Correct	3 ms	664 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	369 ms	9312 KB	Output is correct
12	Correct	427 ms	13540 KB	Output is correct
13	Correct	453 ms	14712 KB	Output is correct
14	Correct	429 ms	14956 KB	Output is correct
15	Correct	425 ms	15860 KB	Output is correct
16	Correct	529 ms	15860 KB	Output is correct
17	Correct	466 ms	16944 KB	Output is correct
18	Correct	283 ms	21132 KB	Output is correct
19	Correct	314 ms	21132 KB	Output is correct
20	Correct	414 ms	21132 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	4 ms	432 KB	Output is correct
4	Correct	3 ms	444 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	3 ms	656 KB	Output is correct
7	Correct	3 ms	656 KB	Output is correct
8	Correct	2 ms	656 KB	Output is correct
9	Correct	3 ms	664 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	369 ms	9312 KB	Output is correct
12	Correct	427 ms	13540 KB	Output is correct
13	Correct	453 ms	14712 KB	Output is correct
14	Correct	429 ms	14956 KB	Output is correct
15	Correct	425 ms	15860 KB	Output is correct
16	Correct	529 ms	15860 KB	Output is correct
17	Correct	466 ms	16944 KB	Output is correct
18	Correct	283 ms	21132 KB	Output is correct
19	Correct	314 ms	21132 KB	Output is correct
20	Correct	414 ms	21132 KB	Output is correct
21	Correct	462 ms	21132 KB	Output is correct
22	Correct	502 ms	23040 KB	Output is correct
23	Correct	547 ms	23040 KB	Output is correct
24	Correct	541 ms	23040 KB	Output is correct
25	Correct	506 ms	23772 KB	Output is correct
26	Correct	612 ms	23772 KB	Output is correct
27	Correct	593 ms	23772 KB	Output is correct
28	Correct	315 ms	24808 KB	Output is correct
29	Correct	404 ms	24808 KB	Output is correct
30	Correct	505 ms	24808 KB	Output is correct
31	Correct	567 ms	24808 KB	Output is correct
32	Correct	662 ms	24808 KB	Output is correct
33	Correct	453 ms	24808 KB	Output is correct
34	Correct	612 ms	24808 KB	Output is correct
35	Correct	565 ms	24808 KB	Output is correct
36	Correct	293 ms	24808 KB	Output is correct
37	Correct	447 ms	25444 KB	Output is correct
38	Correct	403 ms	25444 KB	Output is correct
39	Correct	537 ms	25444 KB	Output is correct
40	Correct	536 ms	25444 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	4 ms	432 KB	Output is correct
4	Correct	3 ms	444 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	3 ms	656 KB	Output is correct
7	Correct	3 ms	656 KB	Output is correct
8	Correct	2 ms	656 KB	Output is correct
9	Correct	3 ms	664 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	107 ms	34832 KB	Output is correct
12	Correct	100 ms	34856 KB	Output is correct
13	Correct	115 ms	34856 KB	Output is correct
14	Correct	127 ms	34856 KB	Output is correct
15	Correct	100 ms	34872 KB	Output is correct
16	Correct	157 ms	35020 KB	Output is correct
17	Correct	130 ms	35020 KB	Output is correct
18	Correct	85 ms	35020 KB	Output is correct
19	Correct	97 ms	35020 KB	Output is correct
20	Correct	109 ms	35020 KB	Output is correct
21	Correct	138 ms	35020 KB	Output is correct
22	Correct	179 ms	35020 KB	Output is correct
23	Correct	101 ms	35020 KB	Output is correct
24	Correct	137 ms	35020 KB	Output is correct
25	Correct	137 ms	35020 KB	Output is correct
26	Correct	87 ms	35020 KB	Output is correct
27	Correct	109 ms	35020 KB	Output is correct
28	Correct	96 ms	35020 KB	Output is correct
29	Correct	125 ms	35020 KB	Output is correct
30	Correct	157 ms	35020 KB	Output is correct
31	Correct	120 ms	35020 KB	Output is correct
32	Correct	140 ms	35020 KB	Output is correct
33	Correct	131 ms	35020 KB	Output is correct
34	Correct	87 ms	35020 KB	Output is correct
35	Correct	122 ms	35020 KB	Output is correct
36	Correct	124 ms	35020 KB	Output is correct
37	Correct	121 ms	35020 KB	Output is correct
38	Correct	118 ms	35020 KB	Output is correct
39	Correct	132 ms	35020 KB	Output is correct
40	Correct	140 ms	35020 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	4 ms	432 KB	Output is correct
4	Correct	3 ms	444 KB	Output is correct
5	Correct	3 ms	512 KB	Output is correct
6	Correct	3 ms	656 KB	Output is correct
7	Correct	3 ms	656 KB	Output is correct
8	Correct	2 ms	656 KB	Output is correct
9	Correct	3 ms	664 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	369 ms	9312 KB	Output is correct
12	Correct	427 ms	13540 KB	Output is correct
13	Correct	453 ms	14712 KB	Output is correct
14	Correct	429 ms	14956 KB	Output is correct
15	Correct	425 ms	15860 KB	Output is correct
16	Correct	529 ms	15860 KB	Output is correct
17	Correct	466 ms	16944 KB	Output is correct
18	Correct	283 ms	21132 KB	Output is correct
19	Correct	314 ms	21132 KB	Output is correct
20	Correct	414 ms	21132 KB	Output is correct
21	Correct	462 ms	21132 KB	Output is correct
22	Correct	502 ms	23040 KB	Output is correct
23	Correct	547 ms	23040 KB	Output is correct
24	Correct	541 ms	23040 KB	Output is correct
25	Correct	506 ms	23772 KB	Output is correct
26	Correct	612 ms	23772 KB	Output is correct
27	Correct	593 ms	23772 KB	Output is correct
28	Correct	315 ms	24808 KB	Output is correct
29	Correct	404 ms	24808 KB	Output is correct
30	Correct	505 ms	24808 KB	Output is correct
31	Correct	567 ms	24808 KB	Output is correct
32	Correct	662 ms	24808 KB	Output is correct
33	Correct	453 ms	24808 KB	Output is correct
34	Correct	612 ms	24808 KB	Output is correct
35	Correct	565 ms	24808 KB	Output is correct
36	Correct	293 ms	24808 KB	Output is correct
37	Correct	447 ms	25444 KB	Output is correct
38	Correct	403 ms	25444 KB	Output is correct
39	Correct	537 ms	25444 KB	Output is correct
40	Correct	536 ms	25444 KB	Output is correct
41	Correct	107 ms	34832 KB	Output is correct
42	Correct	100 ms	34856 KB	Output is correct
43	Correct	115 ms	34856 KB	Output is correct
44	Correct	127 ms	34856 KB	Output is correct
45	Correct	100 ms	34872 KB	Output is correct
46	Correct	157 ms	35020 KB	Output is correct
47	Correct	130 ms	35020 KB	Output is correct
48	Correct	85 ms	35020 KB	Output is correct
49	Correct	97 ms	35020 KB	Output is correct
50	Correct	109 ms	35020 KB	Output is correct
51	Correct	138 ms	35020 KB	Output is correct
52	Correct	179 ms	35020 KB	Output is correct
53	Correct	101 ms	35020 KB	Output is correct
54	Correct	137 ms	35020 KB	Output is correct
55	Correct	137 ms	35020 KB	Output is correct
56	Correct	87 ms	35020 KB	Output is correct
57	Correct	109 ms	35020 KB	Output is correct
58	Correct	96 ms	35020 KB	Output is correct
59	Correct	125 ms	35020 KB	Output is correct
60	Correct	157 ms	35020 KB	Output is correct
61	Correct	120 ms	35020 KB	Output is correct
62	Correct	140 ms	35020 KB	Output is correct
63	Correct	131 ms	35020 KB	Output is correct
64	Correct	87 ms	35020 KB	Output is correct
65	Correct	122 ms	35020 KB	Output is correct
66	Correct	124 ms	35020 KB	Output is correct
67	Correct	121 ms	35020 KB	Output is correct
68	Correct	118 ms	35020 KB	Output is correct
69	Correct	132 ms	35020 KB	Output is correct
70	Correct	140 ms	35020 KB	Output is correct
71	Correct	737 ms	37768 KB	Output is correct
72	Correct	779 ms	37924 KB	Output is correct
73	Correct	990 ms	37924 KB	Output is correct
74	Correct	1413 ms	37924 KB	Output is correct
75	Correct	824 ms	42632 KB	Output is correct
76	Correct	1467 ms	42632 KB	Output is correct
77	Correct	1312 ms	62532 KB	Output is correct
78	Runtime error	474 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.
79	Halted	0 ms	0 KB	-

답안 #75206

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 53.0 / 53.0

Subtask #5 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
10.0 / 10.0

Subtask #4
53.0 / 53.0

Subtask #5
0 / 25.0