oj.uz

Submission #110133

# Submission time Handle Problem Language Result Execution time Memory
110133 2019-05-09T14:14:38 Z popovicirobert Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 21688 KB 
#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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 352 ms 7520 KB Output is correct
12 Correct 448 ms 7312 KB Output is correct
13 Correct 382 ms 6452 KB Output is correct
14 Correct 446 ms 6728 KB Output is correct
15 Correct 335 ms 7608 KB Output is correct
16 Correct 364 ms 6868 KB Output is correct
17 Correct 422 ms 6708 KB Output is correct
18 Correct 225 ms 8520 KB Output is correct
19 Correct 251 ms 5536 KB Output is correct
20 Correct 345 ms 7264 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 352 ms 7520 KB Output is correct
12 Correct 448 ms 7312 KB Output is correct
13 Correct 382 ms 6452 KB Output is correct
14 Correct 446 ms 6728 KB Output is correct
15 Correct 335 ms 7608 KB Output is correct
16 Correct 364 ms 6868 KB Output is correct
17 Correct 422 ms 6708 KB Output is correct
18 Correct 225 ms 8520 KB Output is correct
19 Correct 251 ms 5536 KB Output is correct
20 Correct 345 ms 7264 KB Output is correct
21 Correct 441 ms 7640 KB Output is correct
22 Correct 476 ms 7840 KB Output is correct
23 Correct 525 ms 7032 KB Output is correct
24 Correct 445 ms 6664 KB Output is correct
25 Correct 394 ms 8824 KB Output is correct
26 Correct 450 ms 7544 KB Output is correct
27 Correct 495 ms 7352 KB Output is correct
28 Correct 358 ms 9988 KB Output is correct
29 Correct 390 ms 6008 KB Output is correct
30 Correct 441 ms 8156 KB Output is correct
31 Correct 506 ms 7928 KB Output is correct
32 Correct 537 ms 8056 KB Output is correct
33 Correct 441 ms 6876 KB Output is correct
34 Correct 531 ms 7236 KB Output is correct
35 Correct 507 ms 7520 KB Output is correct
36 Correct 322 ms 6008 KB Output is correct
37 Correct 498 ms 8164 KB Output is correct
38 Correct 365 ms 6008 KB Output is correct
39 Correct 498 ms 7128 KB Output is correct
40 Correct 522 ms 7160 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 89 ms 15764 KB Output is correct
12 Correct 87 ms 15736 KB Output is correct
13 Correct 104 ms 15624 KB Output is correct
14 Correct 179 ms 15736 KB Output is correct
15 Correct 124 ms 15796 KB Output is correct
16 Correct 133 ms 15608 KB Output is correct
17 Correct 155 ms 15628 KB Output is correct
18 Correct 76 ms 15864 KB Output is correct
19 Correct 94 ms 15480 KB Output is correct
20 Correct 96 ms 15608 KB Output is correct
21 Correct 134 ms 15736 KB Output is correct
22 Correct 164 ms 15736 KB Output is correct
23 Correct 132 ms 15608 KB Output is correct
24 Correct 158 ms 15608 KB Output is correct
25 Correct 115 ms 15608 KB Output is correct
26 Correct 91 ms 15432 KB Output is correct
27 Correct 111 ms 15656 KB Output is correct
28 Correct 112 ms 15480 KB Output is correct
29 Correct 118 ms 15644 KB Output is correct
30 Correct 126 ms 15736 KB Output is correct
31 Correct 90 ms 15596 KB Output is correct
32 Correct 134 ms 15608 KB Output is correct
33 Correct 144 ms 15736 KB Output is correct
34 Correct 76 ms 15456 KB Output is correct
35 Correct 123 ms 15580 KB Output is correct
36 Correct 110 ms 15596 KB Output is correct
37 Correct 112 ms 15684 KB Output is correct
38 Correct 126 ms 15736 KB Output is correct
39 Correct 131 ms 15736 KB Output is correct
40 Correct 128 ms 15736 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 352 ms 7520 KB Output is correct
12 Correct 448 ms 7312 KB Output is correct
13 Correct 382 ms 6452 KB Output is correct
14 Correct 446 ms 6728 KB Output is correct
15 Correct 335 ms 7608 KB Output is correct
16 Correct 364 ms 6868 KB Output is correct
17 Correct 422 ms 6708 KB Output is correct
18 Correct 225 ms 8520 KB Output is correct
19 Correct 251 ms 5536 KB Output is correct
20 Correct 345 ms 7264 KB Output is correct
21 Correct 441 ms 7640 KB Output is correct
22 Correct 476 ms 7840 KB Output is correct
23 Correct 525 ms 7032 KB Output is correct
24 Correct 445 ms 6664 KB Output is correct
25 Correct 394 ms 8824 KB Output is correct
26 Correct 450 ms 7544 KB Output is correct
27 Correct 495 ms 7352 KB Output is correct
28 Correct 358 ms 9988 KB Output is correct
29 Correct 390 ms 6008 KB Output is correct
30 Correct 441 ms 8156 KB Output is correct
31 Correct 506 ms 7928 KB Output is correct
32 Correct 537 ms 8056 KB Output is correct
33 Correct 441 ms 6876 KB Output is correct
34 Correct 531 ms 7236 KB Output is correct
35 Correct 507 ms 7520 KB Output is correct
36 Correct 322 ms 6008 KB Output is correct
37 Correct 498 ms 8164 KB Output is correct
38 Correct 365 ms 6008 KB Output is correct
39 Correct 498 ms 7128 KB Output is correct
40 Correct 522 ms 7160 KB Output is correct
41 Correct 89 ms 15764 KB Output is correct
42 Correct 87 ms 15736 KB Output is correct
43 Correct 104 ms 15624 KB Output is correct
44 Correct 179 ms 15736 KB Output is correct
45 Correct 124 ms 15796 KB Output is correct
46 Correct 133 ms 15608 KB Output is correct
47 Correct 155 ms 15628 KB Output is correct
48 Correct 76 ms 15864 KB Output is correct
49 Correct 94 ms 15480 KB Output is correct
50 Correct 96 ms 15608 KB Output is correct
51 Correct 134 ms 15736 KB Output is correct
52 Correct 164 ms 15736 KB Output is correct
53 Correct 132 ms 15608 KB Output is correct
54 Correct 158 ms 15608 KB Output is correct
55 Correct 115 ms 15608 KB Output is correct
56 Correct 91 ms 15432 KB Output is correct
57 Correct 111 ms 15656 KB Output is correct
58 Correct 112 ms 15480 KB Output is correct
59 Correct 118 ms 15644 KB Output is correct
60 Correct 126 ms 15736 KB Output is correct
61 Correct 90 ms 15596 KB Output is correct
62 Correct 134 ms 15608 KB Output is correct
63 Correct 144 ms 15736 KB Output is correct
64 Correct 76 ms 15456 KB Output is correct
65 Correct 123 ms 15580 KB Output is correct
66 Correct 110 ms 15596 KB Output is correct
67 Correct 112 ms 15684 KB Output is correct
68 Correct 126 ms 15736 KB Output is correct
69 Correct 131 ms 15736 KB Output is correct
70 Correct 128 ms 15736 KB Output is correct
71 Correct 758 ms 18668 KB Output is correct
72 Correct 741 ms 18772 KB Output is correct
73 Correct 1119 ms 17588 KB Output is correct
74 Correct 1185 ms 21688 KB Output is correct
75 Correct 658 ms 19576 KB Output is correct
76 Correct 1622 ms 18168 KB Output is correct
77 Correct 1277 ms 18044 KB Output is correct
78 Correct 412 ms 21624 KB Output is correct
79 Correct 751 ms 15736 KB Output is correct
80 Correct 791 ms 18808 KB Output is correct
81 Correct 1010 ms 18820 KB Output is correct
82 Execution timed out 2029 ms 18908 KB Time limit exceeded
83 Halted 0 ms 0 KB -