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>
int T[2][2097152];
int d[2][20];
void update(int x,int y,int z)
{
if(y==0)return;
d[x][z]-=!!T[x][y];
if(T[x][y<<1]==T[x][(y<<1)+1])T[x][y]=T[x][y<<1];
else T[x][y]=0;
d[x][z]+=!!T[x][y];
update(x,y>>1,z-1);
}
int main()
{
long long r=0;
int i,j,n,m;
scanf("%d%d",&n,&m);
for(i=0;i<2;i++)for(j=1;j<(2<<n);j++)T[i][j]=1;
for(i=0;i<2;i++)for(j=0;j<n;j++)d[i][j]=1<<j;
while(m--)
{
scanf("%d%d",&i,&j);
T[i][j+(1<<n)-1]=-T[i][j+(1<<n)-1];
update(i,(j+(1<<n)-1)>>1,n-1);
r=0;
for(i=0;i<n;i++)r+=((1LL<<i)<<i)-1LL*d[0][i]*d[1][i];
printf("%lld\n",(r<<2)+1);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |