답안 #75216 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
75216	2018-09-08T17:09:33 Z	bogdan10bos	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	1498 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	2 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	2 ms	520 KB	Output is correct
4	Correct	3 ms	520 KB	Output is correct
5	Correct	3 ms	652 KB	Output is correct
6	Correct	2 ms	652 KB	Output is correct
7	Correct	3 ms	652 KB	Output is correct
8	Correct	2 ms	652 KB	Output is correct
9	Correct	3 ms	652 KB	Output is correct
10	Correct	3 ms	652 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	2 ms	520 KB	Output is correct
4	Correct	3 ms	520 KB	Output is correct
5	Correct	3 ms	652 KB	Output is correct
6	Correct	2 ms	652 KB	Output is correct
7	Correct	3 ms	652 KB	Output is correct
8	Correct	2 ms	652 KB	Output is correct
9	Correct	3 ms	652 KB	Output is correct
10	Correct	3 ms	652 KB	Output is correct
11	Correct	370 ms	9944 KB	Output is correct
12	Correct	408 ms	11968 KB	Output is correct
13	Correct	432 ms	13644 KB	Output is correct
14	Correct	416 ms	13776 KB	Output is correct
15	Correct	435 ms	14720 KB	Output is correct
16	Correct	459 ms	14720 KB	Output is correct
17	Correct	452 ms	14720 KB	Output is correct
18	Correct	309 ms	17732 KB	Output is correct
19	Correct	300 ms	17732 KB	Output is correct
20	Correct	402 ms	17732 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	2 ms	520 KB	Output is correct
4	Correct	3 ms	520 KB	Output is correct
5	Correct	3 ms	652 KB	Output is correct
6	Correct	2 ms	652 KB	Output is correct
7	Correct	3 ms	652 KB	Output is correct
8	Correct	2 ms	652 KB	Output is correct
9	Correct	3 ms	652 KB	Output is correct
10	Correct	3 ms	652 KB	Output is correct
11	Correct	370 ms	9944 KB	Output is correct
12	Correct	408 ms	11968 KB	Output is correct
13	Correct	432 ms	13644 KB	Output is correct
14	Correct	416 ms	13776 KB	Output is correct
15	Correct	435 ms	14720 KB	Output is correct
16	Correct	459 ms	14720 KB	Output is correct
17	Correct	452 ms	14720 KB	Output is correct
18	Correct	309 ms	17732 KB	Output is correct
19	Correct	300 ms	17732 KB	Output is correct
20	Correct	402 ms	17732 KB	Output is correct
21	Correct	481 ms	17732 KB	Output is correct
22	Correct	475 ms	17964 KB	Output is correct
23	Correct	521 ms	17964 KB	Output is correct
24	Correct	513 ms	17964 KB	Output is correct
25	Correct	472 ms	18272 KB	Output is correct
26	Correct	532 ms	19580 KB	Output is correct
27	Correct	546 ms	19580 KB	Output is correct
28	Correct	311 ms	21988 KB	Output is correct
29	Correct	370 ms	21988 KB	Output is correct
30	Correct	499 ms	22976 KB	Output is correct
31	Correct	560 ms	22976 KB	Output is correct
32	Correct	656 ms	24464 KB	Output is correct
33	Correct	478 ms	26032 KB	Output is correct
34	Correct	562 ms	26116 KB	Output is correct
35	Correct	575 ms	26500 KB	Output is correct
36	Correct	282 ms	26500 KB	Output is correct
37	Correct	470 ms	30792 KB	Output is correct
38	Correct	421 ms	30792 KB	Output is correct
39	Correct	515 ms	30792 KB	Output is correct
40	Correct	529 ms	30792 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	2 ms	520 KB	Output is correct
4	Correct	3 ms	520 KB	Output is correct
5	Correct	3 ms	652 KB	Output is correct
6	Correct	2 ms	652 KB	Output is correct
7	Correct	3 ms	652 KB	Output is correct
8	Correct	2 ms	652 KB	Output is correct
9	Correct	3 ms	652 KB	Output is correct
10	Correct	3 ms	652 KB	Output is correct
11	Correct	104 ms	40320 KB	Output is correct
12	Correct	103 ms	40344 KB	Output is correct
13	Correct	114 ms	40344 KB	Output is correct
14	Correct	122 ms	40344 KB	Output is correct
15	Correct	100 ms	40344 KB	Output is correct
16	Correct	137 ms	40448 KB	Output is correct
17	Correct	130 ms	40448 KB	Output is correct
18	Correct	105 ms	40448 KB	Output is correct
19	Correct	101 ms	40448 KB	Output is correct
20	Correct	103 ms	40912 KB	Output is correct
21	Correct	117 ms	42828 KB	Output is correct
22	Correct	151 ms	43236 KB	Output is correct
23	Correct	113 ms	43236 KB	Output is correct
24	Correct	132 ms	43236 KB	Output is correct
25	Correct	142 ms	43236 KB	Output is correct
26	Correct	101 ms	43236 KB	Output is correct
27	Correct	118 ms	43236 KB	Output is correct
28	Correct	96 ms	43236 KB	Output is correct
29	Correct	118 ms	43236 KB	Output is correct
30	Correct	128 ms	43236 KB	Output is correct
31	Correct	107 ms	43236 KB	Output is correct
32	Correct	145 ms	43236 KB	Output is correct
33	Correct	129 ms	43236 KB	Output is correct
34	Correct	89 ms	43236 KB	Output is correct
35	Correct	156 ms	43236 KB	Output is correct
36	Correct	123 ms	43236 KB	Output is correct
37	Correct	125 ms	43236 KB	Output is correct
38	Correct	130 ms	43236 KB	Output is correct
39	Correct	116 ms	43236 KB	Output is correct
40	Correct	123 ms	43236 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	2 ms	520 KB	Output is correct
4	Correct	3 ms	520 KB	Output is correct
5	Correct	3 ms	652 KB	Output is correct
6	Correct	2 ms	652 KB	Output is correct
7	Correct	3 ms	652 KB	Output is correct
8	Correct	2 ms	652 KB	Output is correct
9	Correct	3 ms	652 KB	Output is correct
10	Correct	3 ms	652 KB	Output is correct
11	Correct	370 ms	9944 KB	Output is correct
12	Correct	408 ms	11968 KB	Output is correct
13	Correct	432 ms	13644 KB	Output is correct
14	Correct	416 ms	13776 KB	Output is correct
15	Correct	435 ms	14720 KB	Output is correct
16	Correct	459 ms	14720 KB	Output is correct
17	Correct	452 ms	14720 KB	Output is correct
18	Correct	309 ms	17732 KB	Output is correct
19	Correct	300 ms	17732 KB	Output is correct
20	Correct	402 ms	17732 KB	Output is correct
21	Correct	481 ms	17732 KB	Output is correct
22	Correct	475 ms	17964 KB	Output is correct
23	Correct	521 ms	17964 KB	Output is correct
24	Correct	513 ms	17964 KB	Output is correct
25	Correct	472 ms	18272 KB	Output is correct
26	Correct	532 ms	19580 KB	Output is correct
27	Correct	546 ms	19580 KB	Output is correct
28	Correct	311 ms	21988 KB	Output is correct
29	Correct	370 ms	21988 KB	Output is correct
30	Correct	499 ms	22976 KB	Output is correct
31	Correct	560 ms	22976 KB	Output is correct
32	Correct	656 ms	24464 KB	Output is correct
33	Correct	478 ms	26032 KB	Output is correct
34	Correct	562 ms	26116 KB	Output is correct
35	Correct	575 ms	26500 KB	Output is correct
36	Correct	282 ms	26500 KB	Output is correct
37	Correct	470 ms	30792 KB	Output is correct
38	Correct	421 ms	30792 KB	Output is correct
39	Correct	515 ms	30792 KB	Output is correct
40	Correct	529 ms	30792 KB	Output is correct
41	Correct	104 ms	40320 KB	Output is correct
42	Correct	103 ms	40344 KB	Output is correct
43	Correct	114 ms	40344 KB	Output is correct
44	Correct	122 ms	40344 KB	Output is correct
45	Correct	100 ms	40344 KB	Output is correct
46	Correct	137 ms	40448 KB	Output is correct
47	Correct	130 ms	40448 KB	Output is correct
48	Correct	105 ms	40448 KB	Output is correct
49	Correct	101 ms	40448 KB	Output is correct
50	Correct	103 ms	40912 KB	Output is correct
51	Correct	117 ms	42828 KB	Output is correct
52	Correct	151 ms	43236 KB	Output is correct
53	Correct	113 ms	43236 KB	Output is correct
54	Correct	132 ms	43236 KB	Output is correct
55	Correct	142 ms	43236 KB	Output is correct
56	Correct	101 ms	43236 KB	Output is correct
57	Correct	118 ms	43236 KB	Output is correct
58	Correct	96 ms	43236 KB	Output is correct
59	Correct	118 ms	43236 KB	Output is correct
60	Correct	128 ms	43236 KB	Output is correct
61	Correct	107 ms	43236 KB	Output is correct
62	Correct	145 ms	43236 KB	Output is correct
63	Correct	129 ms	43236 KB	Output is correct
64	Correct	89 ms	43236 KB	Output is correct
65	Correct	156 ms	43236 KB	Output is correct
66	Correct	123 ms	43236 KB	Output is correct
67	Correct	125 ms	43236 KB	Output is correct
68	Correct	130 ms	43236 KB	Output is correct
69	Correct	116 ms	43236 KB	Output is correct
70	Correct	123 ms	43236 KB	Output is correct
71	Correct	775 ms	50336 KB	Output is correct
72	Correct	799 ms	50780 KB	Output is correct
73	Correct	1089 ms	51876 KB	Output is correct
74	Correct	1343 ms	52244 KB	Output is correct
75	Correct	767 ms	55064 KB	Output is correct
76	Correct	1498 ms	55064 KB	Output is correct
77	Correct	1248 ms	55064 KB	Output is correct
78	Correct	449 ms	56860 KB	Output is correct
79	Correct	627 ms	56860 KB	Output is correct
80	Correct	803 ms	60000 KB	Output is correct
81	Correct	1016 ms	60064 KB	Output is correct
82	Correct	1306 ms	60064 KB	Output is correct
83	Correct	715 ms	60064 KB	Output is correct
84	Correct	1312 ms	60064 KB	Output is correct
85	Correct	1289 ms	60064 KB	Output is correct
86	Correct	442 ms	60064 KB	Output is correct
87	Correct	773 ms	60536 KB	Output is correct
88	Correct	688 ms	60536 KB	Output is correct
89	Runtime error	966 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.
90	Halted	0 ms	0 KB	-

답안 #75216

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