# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331783 | daniel920712 | Snake Escaping (JOI18_snake_escaping) | C++14 | 2086 ms | 2424 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string.h>
#include <map>
#include <utility>
#include <algorithm>
#include <stack>
using namespace std;
char all[100005];
char tt[25];
int main()
{
int N,M,ans,i,j,ok;
scanf("%d %d",&N,&M);
scanf("%s",all);
while(M--)
{
scanf("%s",tt);
ans=0;
for(i=0;i<(1<<N);i++)
{
ok=1;
for(j=0;j<N;j++)
{
if((((1<<(N-j-1))&i)&&tt[j]=='0')||((((1<<(N-j-1))&i))==0&&tt[j]=='1')) ok=0;
}
if(ok)
{
//printf("%d\n",i);
ans+=all[i]-'0';
}
}
printf("%d\n",ans);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |