# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
80265 | Bodo171 | Snake Escaping (JOI18_snake_escaping) | C++14 | 1067 ms | 61848 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 <cstdio>
using namespace std;
const int nmax=(1<<20);
char s[20],str[nmax];
char t;
char pc[nmax];
int sub[nmax],supra[nmax];
int l,q,i,j,m0,m1,mq,ans,cnt;
char mn;
bool brk;
int main()
{
//freopen("data.in","r",stdin);
scanf("%d%d",&l,&q);
scanf("%s",&str);
for(i=0;i<(1<<l);i++)
{
if(i!=0)
pc[i]=pc[(i&(i-1))]+1;
sub[i]=supra[i]=str[i]=str[i]-'0';
}
for(i=0;i<l;i++)
for(j=0;j<(1<<l);j++)
if(((1<<i)&j))
sub[j]+=sub[(j^(1<<i))];
else supra[j]+=supra[(j^(1<<i))];
for(cnt=1;cnt<=q;cnt++)
{
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... |