답안 #75197 :: oj.uz

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

snake_escaping

#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO
/// Try oo + 1
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	520 KB	Output is correct
3	Correct	3 ms	624 KB	Output is correct
4	Correct	2 ms	624 KB	Output is correct
5	Correct	2 ms	624 KB	Output is correct
6	Correct	3 ms	624 KB	Output is correct
7	Correct	3 ms	636 KB	Output is correct
8	Correct	2 ms	844 KB	Output is correct
9	Correct	2 ms	844 KB	Output is correct
10	Correct	3 ms	844 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	520 KB	Output is correct
3	Correct	3 ms	624 KB	Output is correct
4	Correct	2 ms	624 KB	Output is correct
5	Correct	2 ms	624 KB	Output is correct
6	Correct	3 ms	624 KB	Output is correct
7	Correct	3 ms	636 KB	Output is correct
8	Correct	2 ms	844 KB	Output is correct
9	Correct	2 ms	844 KB	Output is correct
10	Correct	3 ms	844 KB	Output is correct
11	Correct	361 ms	15360 KB	Output is correct
12	Correct	427 ms	16576 KB	Output is correct
13	Correct	434 ms	16576 KB	Output is correct
14	Correct	411 ms	16576 KB	Output is correct
15	Correct	409 ms	16948 KB	Output is correct
16	Correct	465 ms	16948 KB	Output is correct
17	Correct	482 ms	16948 KB	Output is correct
18	Correct	293 ms	17800 KB	Output is correct
19	Correct	329 ms	17800 KB	Output is correct
20	Correct	469 ms	17800 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	3 ms	624 KB	Output is correct
4	Correct	2 ms	624 KB	Output is correct
5	Correct	2 ms	624 KB	Output is correct
6	Correct	3 ms	624 KB	Output is correct
7	Correct	3 ms	636 KB	Output is correct
8	Correct	2 ms	844 KB	Output is correct
9	Correct	2 ms	844 KB	Output is correct
10	Correct	3 ms	844 KB	Output is correct
11	Correct	361 ms	15360 KB	Output is correct
12	Correct	427 ms	16576 KB	Output is correct
13	Correct	434 ms	16576 KB	Output is correct
14	Correct	411 ms	16576 KB	Output is correct
15	Correct	409 ms	16948 KB	Output is correct
16	Correct	465 ms	16948 KB	Output is correct
17	Correct	482 ms	16948 KB	Output is correct
18	Correct	293 ms	17800 KB	Output is correct
19	Correct	329 ms	17800 KB	Output is correct
20	Correct	469 ms	17800 KB	Output is correct
21	Correct	489 ms	17800 KB	Output is correct
22	Correct	539 ms	17800 KB	Output is correct
23	Correct	573 ms	17800 KB	Output is correct
24	Correct	572 ms	17800 KB	Output is correct
25	Correct	494 ms	18008 KB	Output is correct
26	Correct	578 ms	18008 KB	Output is correct
27	Correct	532 ms	18008 KB	Output is correct
28	Correct	290 ms	18996 KB	Output is correct
29	Correct	387 ms	18996 KB	Output is correct
30	Correct	497 ms	18996 KB	Output is correct
31	Correct	562 ms	18996 KB	Output is correct
32	Correct	645 ms	30800 KB	Output is correct
33	Correct	461 ms	43472 KB	Output is correct
34	Correct	602 ms	57244 KB	Output is correct
35	Runtime error	571 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.
36	Halted	0 ms	0 KB	-

Subtask #4
0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	3 ms	624 KB	Output is correct
4	Correct	2 ms	624 KB	Output is correct
5	Correct	2 ms	624 KB	Output is correct
6	Correct	3 ms	624 KB	Output is correct
7	Correct	3 ms	636 KB	Output is correct
8	Correct	2 ms	844 KB	Output is correct
9	Correct	2 ms	844 KB	Output is correct
10	Correct	3 ms	844 KB	Output is correct
11	Runtime error	106 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.
12	Halted	0 ms	0 KB	-

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	3 ms	624 KB	Output is correct
4	Correct	2 ms	624 KB	Output is correct
5	Correct	2 ms	624 KB	Output is correct
6	Correct	3 ms	624 KB	Output is correct
7	Correct	3 ms	636 KB	Output is correct
8	Correct	2 ms	844 KB	Output is correct
9	Correct	2 ms	844 KB	Output is correct
10	Correct	3 ms	844 KB	Output is correct
11	Correct	361 ms	15360 KB	Output is correct
12	Correct	427 ms	16576 KB	Output is correct
13	Correct	434 ms	16576 KB	Output is correct
14	Correct	411 ms	16576 KB	Output is correct
15	Correct	409 ms	16948 KB	Output is correct
16	Correct	465 ms	16948 KB	Output is correct
17	Correct	482 ms	16948 KB	Output is correct
18	Correct	293 ms	17800 KB	Output is correct
19	Correct	329 ms	17800 KB	Output is correct
20	Correct	469 ms	17800 KB	Output is correct
21	Correct	489 ms	17800 KB	Output is correct
22	Correct	539 ms	17800 KB	Output is correct
23	Correct	573 ms	17800 KB	Output is correct
24	Correct	572 ms	17800 KB	Output is correct
25	Correct	494 ms	18008 KB	Output is correct
26	Correct	578 ms	18008 KB	Output is correct
27	Correct	532 ms	18008 KB	Output is correct
28	Correct	290 ms	18996 KB	Output is correct
29	Correct	387 ms	18996 KB	Output is correct
30	Correct	497 ms	18996 KB	Output is correct
31	Correct	562 ms	18996 KB	Output is correct
32	Correct	645 ms	30800 KB	Output is correct
33	Correct	461 ms	43472 KB	Output is correct
34	Correct	602 ms	57244 KB	Output is correct
35	Runtime error	571 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.
36	Halted	0 ms	0 KB	-

답안 #75197

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 0 / 10.0

Subtask #4 0 / 53.0

Subtask #5 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
0 / 10.0

Subtask #4
0 / 53.0

Subtask #5
0 / 25.0