oj.uz

Submission #75190

# Submission time Handle Problem Language Result Execution time Memory
75190 2018-09-08T16:33:29 Z bogdan10bos Snake Escaping (JOI18_snake_escaping) C++14
12 / 100
 565 ms 66560 KB 
#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO
/// Try 3
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 3 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 2 ms 560 KB Output is correct
6 Correct 3 ms 572 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 776 KB Output is correct
9 Correct 3 ms 776 KB Output is correct
10 Correct 3 ms 776 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 2 ms 560 KB Output is correct
6 Correct 3 ms 572 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 776 KB Output is correct
9 Correct 3 ms 776 KB Output is correct
10 Correct 3 ms 776 KB Output is correct
11 Correct 379 ms 15476 KB Output is correct
12 Correct 409 ms 19040 KB Output is correct
13 Correct 450 ms 19040 KB Output is correct
14 Correct 440 ms 19040 KB Output is correct
15 Correct 448 ms 19252 KB Output is correct
16 Correct 481 ms 19252 KB Output is correct
17 Correct 469 ms 23236 KB Output is correct
18 Correct 294 ms 25032 KB Output is correct
19 Correct 343 ms 25032 KB Output is correct
20 Correct 429 ms 25032 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 2 ms 560 KB Output is correct
6 Correct 3 ms 572 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 776 KB Output is correct
9 Correct 3 ms 776 KB Output is correct
10 Correct 3 ms 776 KB Output is correct
11 Correct 379 ms 15476 KB Output is correct
12 Correct 409 ms 19040 KB Output is correct
13 Correct 450 ms 19040 KB Output is correct
14 Correct 440 ms 19040 KB Output is correct
15 Correct 448 ms 19252 KB Output is correct
16 Correct 481 ms 19252 KB Output is correct
17 Correct 469 ms 23236 KB Output is correct
18 Correct 294 ms 25032 KB Output is correct
19 Correct 343 ms 25032 KB Output is correct
20 Correct 429 ms 25032 KB Output is correct
21 Correct 485 ms 25032 KB Output is correct
22 Correct 531 ms 38112 KB Output is correct
23 Correct 553 ms 51036 KB Output is correct
24 Correct 565 ms 64364 KB Output is correct
25 Runtime error 510 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.
26 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 2 ms 560 KB Output is correct
6 Correct 3 ms 572 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 776 KB Output is correct
9 Correct 3 ms 776 KB Output is correct
10 Correct 3 ms 776 KB Output is correct
11 Runtime error 112 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

# Verdict Execution time Memory Grader output
1 Correct 3 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 2 ms 560 KB Output is correct
6 Correct 3 ms 572 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 776 KB Output is correct
9 Correct 3 ms 776 KB Output is correct
10 Correct 3 ms 776 KB Output is correct
11 Correct 379 ms 15476 KB Output is correct
12 Correct 409 ms 19040 KB Output is correct
13 Correct 450 ms 19040 KB Output is correct
14 Correct 440 ms 19040 KB Output is correct
15 Correct 448 ms 19252 KB Output is correct
16 Correct 481 ms 19252 KB Output is correct
17 Correct 469 ms 23236 KB Output is correct
18 Correct 294 ms 25032 KB Output is correct
19 Correct 343 ms 25032 KB Output is correct
20 Correct 429 ms 25032 KB Output is correct
21 Correct 485 ms 25032 KB Output is correct
22 Correct 531 ms 38112 KB Output is correct
23 Correct 553 ms 51036 KB Output is correct
24 Correct 565 ms 64364 KB Output is correct
25 Runtime error 510 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.
26 Halted 0 ms 0 KB -