답안 #75214 :: oj.uz

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

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	392 KB	Output is correct
3	Correct	3 ms	608 KB	Output is correct
4	Correct	2 ms	720 KB	Output is correct
5	Correct	2 ms	720 KB	Output is correct
6	Correct	2 ms	720 KB	Output is correct
7	Correct	2 ms	720 KB	Output is correct
8	Correct	2 ms	720 KB	Output is correct
9	Correct	2 ms	720 KB	Output is correct
10	Correct	3 ms	804 KB	Output is correct
11	Correct	381 ms	8420 KB	Output is correct
12	Correct	432 ms	8436 KB	Output is correct
13	Correct	420 ms	9396 KB	Output is correct
14	Correct	416 ms	9396 KB	Output is correct
15	Correct	419 ms	10260 KB	Output is correct
16	Correct	477 ms	10260 KB	Output is correct
17	Correct	471 ms	10516 KB	Output is correct
18	Correct	280 ms	14312 KB	Output is correct
19	Correct	318 ms	14312 KB	Output is correct
20	Correct	403 ms	14312 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	392 KB	Output is correct
3	Correct	3 ms	608 KB	Output is correct
4	Correct	2 ms	720 KB	Output is correct
5	Correct	2 ms	720 KB	Output is correct
6	Correct	2 ms	720 KB	Output is correct
7	Correct	2 ms	720 KB	Output is correct
8	Correct	2 ms	720 KB	Output is correct
9	Correct	2 ms	720 KB	Output is correct
10	Correct	3 ms	804 KB	Output is correct
11	Correct	381 ms	8420 KB	Output is correct
12	Correct	432 ms	8436 KB	Output is correct
13	Correct	420 ms	9396 KB	Output is correct
14	Correct	416 ms	9396 KB	Output is correct
15	Correct	419 ms	10260 KB	Output is correct
16	Correct	477 ms	10260 KB	Output is correct
17	Correct	471 ms	10516 KB	Output is correct
18	Correct	280 ms	14312 KB	Output is correct
19	Correct	318 ms	14312 KB	Output is correct
20	Correct	403 ms	14312 KB	Output is correct
21	Correct	518 ms	14312 KB	Output is correct
22	Correct	515 ms	15452 KB	Output is correct
23	Correct	567 ms	16012 KB	Output is correct
24	Correct	539 ms	16012 KB	Output is correct
25	Correct	492 ms	17688 KB	Output is correct
26	Correct	596 ms	17688 KB	Output is correct
27	Correct	586 ms	17688 KB	Output is correct
28	Correct	342 ms	19976 KB	Output is correct
29	Correct	391 ms	19976 KB	Output is correct
30	Correct	554 ms	19976 KB	Output is correct
31	Correct	555 ms	19976 KB	Output is correct
32	Correct	636 ms	19976 KB	Output is correct
33	Correct	479 ms	19976 KB	Output is correct
34	Correct	577 ms	19976 KB	Output is correct
35	Correct	579 ms	19976 KB	Output is correct
36	Correct	321 ms	19976 KB	Output is correct
37	Correct	468 ms	22528 KB	Output is correct
38	Correct	400 ms	22528 KB	Output is correct
39	Correct	509 ms	22528 KB	Output is correct
40	Correct	543 ms	22528 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	392 KB	Output is correct
3	Correct	3 ms	608 KB	Output is correct
4	Correct	2 ms	720 KB	Output is correct
5	Correct	2 ms	720 KB	Output is correct
6	Correct	2 ms	720 KB	Output is correct
7	Correct	2 ms	720 KB	Output is correct
8	Correct	2 ms	720 KB	Output is correct
9	Correct	2 ms	720 KB	Output is correct
10	Correct	3 ms	804 KB	Output is correct
11	Correct	130 ms	32000 KB	Output is correct
12	Correct	108 ms	32000 KB	Output is correct
13	Correct	111 ms	32000 KB	Output is correct
14	Correct	123 ms	32000 KB	Output is correct
15	Correct	111 ms	32000 KB	Output is correct
16	Correct	138 ms	32000 KB	Output is correct
17	Correct	131 ms	32000 KB	Output is correct
18	Correct	83 ms	32256 KB	Output is correct
19	Correct	94 ms	32256 KB	Output is correct
20	Correct	110 ms	32912 KB	Output is correct
21	Correct	122 ms	32928 KB	Output is correct
22	Correct	143 ms	32928 KB	Output is correct
23	Correct	102 ms	32928 KB	Output is correct
24	Correct	133 ms	32936 KB	Output is correct
25	Correct	130 ms	32936 KB	Output is correct
26	Correct	88 ms	32936 KB	Output is correct
27	Correct	99 ms	32940 KB	Output is correct
28	Correct	95 ms	32940 KB	Output is correct
29	Correct	118 ms	32940 KB	Output is correct
30	Correct	129 ms	33068 KB	Output is correct
31	Correct	139 ms	33068 KB	Output is correct
32	Correct	133 ms	33068 KB	Output is correct
33	Correct	121 ms	33068 KB	Output is correct
34	Correct	85 ms	33068 KB	Output is correct
35	Correct	120 ms	33068 KB	Output is correct
36	Correct	123 ms	33068 KB	Output is correct
37	Correct	124 ms	33068 KB	Output is correct
38	Correct	116 ms	33068 KB	Output is correct
39	Correct	121 ms	33068 KB	Output is correct
40	Correct	117 ms	33068 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	392 KB	Output is correct
3	Correct	3 ms	608 KB	Output is correct
4	Correct	2 ms	720 KB	Output is correct
5	Correct	2 ms	720 KB	Output is correct
6	Correct	2 ms	720 KB	Output is correct
7	Correct	2 ms	720 KB	Output is correct
8	Correct	2 ms	720 KB	Output is correct
9	Correct	2 ms	720 KB	Output is correct
10	Correct	3 ms	804 KB	Output is correct
11	Correct	381 ms	8420 KB	Output is correct
12	Correct	432 ms	8436 KB	Output is correct
13	Correct	420 ms	9396 KB	Output is correct
14	Correct	416 ms	9396 KB	Output is correct
15	Correct	419 ms	10260 KB	Output is correct
16	Correct	477 ms	10260 KB	Output is correct
17	Correct	471 ms	10516 KB	Output is correct
18	Correct	280 ms	14312 KB	Output is correct
19	Correct	318 ms	14312 KB	Output is correct
20	Correct	403 ms	14312 KB	Output is correct
21	Correct	518 ms	14312 KB	Output is correct
22	Correct	515 ms	15452 KB	Output is correct
23	Correct	567 ms	16012 KB	Output is correct
24	Correct	539 ms	16012 KB	Output is correct
25	Correct	492 ms	17688 KB	Output is correct
26	Correct	596 ms	17688 KB	Output is correct
27	Correct	586 ms	17688 KB	Output is correct
28	Correct	342 ms	19976 KB	Output is correct
29	Correct	391 ms	19976 KB	Output is correct
30	Correct	554 ms	19976 KB	Output is correct
31	Correct	555 ms	19976 KB	Output is correct
32	Correct	636 ms	19976 KB	Output is correct
33	Correct	479 ms	19976 KB	Output is correct
34	Correct	577 ms	19976 KB	Output is correct
35	Correct	579 ms	19976 KB	Output is correct
36	Correct	321 ms	19976 KB	Output is correct
37	Correct	468 ms	22528 KB	Output is correct
38	Correct	400 ms	22528 KB	Output is correct
39	Correct	509 ms	22528 KB	Output is correct
40	Correct	543 ms	22528 KB	Output is correct
41	Correct	130 ms	32000 KB	Output is correct
42	Correct	108 ms	32000 KB	Output is correct
43	Correct	111 ms	32000 KB	Output is correct
44	Correct	123 ms	32000 KB	Output is correct
45	Correct	111 ms	32000 KB	Output is correct
46	Correct	138 ms	32000 KB	Output is correct
47	Correct	131 ms	32000 KB	Output is correct
48	Correct	83 ms	32256 KB	Output is correct
49	Correct	94 ms	32256 KB	Output is correct
50	Correct	110 ms	32912 KB	Output is correct
51	Correct	122 ms	32928 KB	Output is correct
52	Correct	143 ms	32928 KB	Output is correct
53	Correct	102 ms	32928 KB	Output is correct
54	Correct	133 ms	32936 KB	Output is correct
55	Correct	130 ms	32936 KB	Output is correct
56	Correct	88 ms	32936 KB	Output is correct
57	Correct	99 ms	32940 KB	Output is correct
58	Correct	95 ms	32940 KB	Output is correct
59	Correct	118 ms	32940 KB	Output is correct
60	Correct	129 ms	33068 KB	Output is correct
61	Correct	139 ms	33068 KB	Output is correct
62	Correct	133 ms	33068 KB	Output is correct
63	Correct	121 ms	33068 KB	Output is correct
64	Correct	85 ms	33068 KB	Output is correct
65	Correct	120 ms	33068 KB	Output is correct
66	Correct	123 ms	33068 KB	Output is correct
67	Correct	124 ms	33068 KB	Output is correct
68	Correct	116 ms	33068 KB	Output is correct
69	Correct	121 ms	33068 KB	Output is correct
70	Correct	117 ms	33068 KB	Output is correct
71	Correct	764 ms	38892 KB	Output is correct
72	Correct	748 ms	39056 KB	Output is correct
73	Correct	946 ms	39180 KB	Output is correct
74	Correct	1238 ms	39648 KB	Output is correct
75	Correct	750 ms	41344 KB	Output is correct
76	Correct	1475 ms	41344 KB	Output is correct
77	Correct	1256 ms	41344 KB	Output is correct
78	Correct	448 ms	43244 KB	Output is correct
79	Correct	607 ms	43244 KB	Output is correct
80	Correct	785 ms	54144 KB	Output is correct
81	Correct	977 ms	54144 KB	Output is correct
82	Correct	1236 ms	54144 KB	Output is correct
83	Correct	690 ms	54144 KB	Output is correct
84	Correct	1303 ms	54144 KB	Output is correct
85	Correct	1280 ms	54144 KB	Output is correct
86	Runtime error	465 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.
87	Halted	0 ms	0 KB	-

답안 #75214

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