oj.uz

Submission #331802

# Submission time Handle Problem Language Result Execution time Memory
331802 2020-11-30T07:42:13 Z daniel920712 Snake Escaping (JOI18_snake_escaping) C++14
65 / 100
 2000 ms 18224 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string.h>
#include <map>
#include <utility>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
char all[1148576];
char tt[25];
int con1[2][1100005];
int con2[2][1100005];
int ans=0;
int N,K=6;
queue < pair < pair < int , int > , int > > BFS;
int main()
{
    //freopen("05-05.txt","rt",stdin);
    //freopen("tt.txt","w+t",stdout);
    int M,i,j,ok,a,b,c,x,y,z;
    scanf("%d %d",&N,&M);
    scanf("%s",all);
    for(i=0;i<(1<<N);i++) con2[0][i]=con1[0][i]=all[i]-'0';
    for(i=0;i<N;i++)
    {
        for(j=0;j<(1<<N);j++)
        {
            con1[1-i%2][j]=con1[i%2][j];
            con2[1-i%2][j]=con2[i%2][j];
            if(j&(1<<i)) con1[1-i%2][j]+=con1[i%2][j-(1<<i)];
            else con2[1-i%2][j]+=con2[i%2][j+(1<<i)];
        }
    }



    while(M--)
    {
        scanf("%s",tt);
        ans=0;
        a=0;
        b=0;
        c=0;
        for(i=0;i<N;i++)
        {
            if(tt[i]=='?') a++;
            else if(tt[i]=='1') b++;
            else c++;
        }
        if(b<=K)
        {
            BFS.push(make_pair(make_pair(0,0),0));
            while(!BFS.empty())
            {
                x=BFS.front().first.first;
                y=BFS.front().first.second;
                z=BFS.front().second;
                BFS.pop();
                if(x==N)
                {
                    if(z==0) ans+=con1[N%2][y];
                    else ans-=con1[N%2][y];
                    continue;
                }
                if(tt[x]=='1')
                {
                    BFS.push(make_pair(make_pair(x+1,y+(1<<(N-x-1))),z));
                    BFS.push(make_pair(make_pair(x+1,y),z^1));
                }
                else if(tt[x]=='0') BFS.push(make_pair(make_pair(x+1,y),z));
                else BFS.push(make_pair(make_pair(x+1,y+(1<<(N-x-1))),z));
            }
        }
        else if(a<=K)
        {
            BFS.push(make_pair(make_pair(0,0),0));
            while(!BFS.empty())
            {
                x=BFS.front().first.first;
                y=BFS.front().first.second;
                z=BFS.front().second;
                BFS.pop();
                if(x==N)
                {
                    ans+=(all[y]-'0');
                    continue;
                }
                if(tt[x]=='?')
                {
                    BFS.push(make_pair(make_pair(x+1,y+(1<<(N-x-1))),z));
                    BFS.push(make_pair(make_pair(x+1,y),z));
                }
                else BFS.push(make_pair(make_pair(x+1,y+(1<<(N-x-1))*(tt[x]-'0')),z));
            }
        }
        else if(c<=K)
        {
            BFS.push(make_pair(make_pair(0,0),0));
            while(!BFS.empty())
            {
                x=BFS.front().first.first;
                y=BFS.front().first.second;
                z=BFS.front().second;
                BFS.pop();
                if(x==N)
                {
                    if(z==0) ans+=con2[N%2][y];
                    else ans-=con2[N%2][y];
                    continue;
                }
                if(tt[x]=='0')
                {
                    BFS.push(make_pair(make_pair(x+1,y+(1<<(N-x-1))),z^1));
                    BFS.push(make_pair(make_pair(x+1,y),z));
                }
                else if(tt[x]=='1') BFS.push(make_pair(make_pair(x+1,y+(1<<(N-x-1))),z));
                else BFS.push(make_pair(make_pair(x+1,y),z));
            }
        }
        printf("%d\n",ans);

    }

	return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:23:15: warning: unused variable 'ok' [-Wunused-variable]
   23 |     int M,i,j,ok,a,b,c,x,y,z;
      |               ^~
snake_escaping.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   24 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
snake_escaping.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |     scanf("%s",all);
      |     ~~~~~^~~~~~~~~~
snake_escaping.cpp:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |         scanf("%s",tt);
      |         ~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 1857 ms 4492 KB Output is correct
12 Correct 510 ms 4128 KB Output is correct
13 Correct 825 ms 3308 KB Output is correct
14 Correct 851 ms 3564 KB Output is correct
15 Correct 736 ms 4332 KB Output is correct
16 Correct 1201 ms 3820 KB Output is correct
17 Correct 1151 ms 3760 KB Output is correct
18 Correct 420 ms 5484 KB Output is correct
19 Correct 1823 ms 2636 KB Output is correct
20 Correct 1634 ms 4336 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 1857 ms 4492 KB Output is correct
12 Correct 510 ms 4128 KB Output is correct
13 Correct 825 ms 3308 KB Output is correct
14 Correct 851 ms 3564 KB Output is correct
15 Correct 736 ms 4332 KB Output is correct
16 Correct 1201 ms 3820 KB Output is correct
17 Correct 1151 ms 3760 KB Output is correct
18 Correct 420 ms 5484 KB Output is correct
19 Correct 1823 ms 2636 KB Output is correct
20 Correct 1634 ms 4336 KB Output is correct
21 Execution timed out 2078 ms 3196 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 126 ms 18028 KB Output is correct
12 Correct 102 ms 18028 KB Output is correct
13 Correct 217 ms 18048 KB Output is correct
14 Correct 392 ms 18028 KB Output is correct
15 Correct 164 ms 18156 KB Output is correct
16 Correct 304 ms 18028 KB Output is correct
17 Correct 255 ms 18028 KB Output is correct
18 Correct 82 ms 18156 KB Output is correct
19 Correct 92 ms 17900 KB Output is correct
20 Correct 136 ms 18028 KB Output is correct
21 Correct 215 ms 18028 KB Output is correct
22 Correct 360 ms 18028 KB Output is correct
23 Correct 152 ms 17900 KB Output is correct
24 Correct 315 ms 18028 KB Output is correct
25 Correct 255 ms 18156 KB Output is correct
26 Correct 88 ms 17900 KB Output is correct
27 Correct 94 ms 18028 KB Output is correct
28 Correct 102 ms 17900 KB Output is correct
29 Correct 197 ms 17900 KB Output is correct
30 Correct 329 ms 18004 KB Output is correct
31 Correct 159 ms 17900 KB Output is correct
32 Correct 365 ms 18224 KB Output is correct
33 Correct 267 ms 18028 KB Output is correct
34 Correct 84 ms 17900 KB Output is correct
35 Correct 211 ms 18156 KB Output is correct
36 Correct 215 ms 18028 KB Output is correct
37 Correct 207 ms 18072 KB Output is correct
38 Correct 209 ms 18028 KB Output is correct
39 Correct 208 ms 18092 KB Output is correct
40 Correct 210 ms 18064 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 1857 ms 4492 KB Output is correct
12 Correct 510 ms 4128 KB Output is correct
13 Correct 825 ms 3308 KB Output is correct
14 Correct 851 ms 3564 KB Output is correct
15 Correct 736 ms 4332 KB Output is correct
16 Correct 1201 ms 3820 KB Output is correct
17 Correct 1151 ms 3760 KB Output is correct
18 Correct 420 ms 5484 KB Output is correct
19 Correct 1823 ms 2636 KB Output is correct
20 Correct 1634 ms 4336 KB Output is correct
21 Execution timed out 2078 ms 3196 KB Time limit exceeded
22 Halted 0 ms 0 KB -