oj.uz

Submission #12958

# Submission time Handle Problem Language Result Execution time Memory
12958 2015-01-21T14:13:16 Z gs13068 즐거운 사진 수집 (JOI13_collecting) C++
100 / 100
 1564 ms 17472 KB 
#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);
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17472 KB Output is correct
2 Correct 0 ms 17472 KB Output is correct
3 Correct 0 ms 17472 KB Output is correct
4 Correct 0 ms 17472 KB Output is correct
5 Correct 0 ms 17472 KB Output is correct
6 Correct 0 ms 17472 KB Output is correct
7 Correct 0 ms 17472 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17472 KB Output is correct
2 Correct 0 ms 17472 KB Output is correct
3 Correct 0 ms 17472 KB Output is correct
4 Correct 0 ms 17472 KB Output is correct
5 Correct 0 ms 17472 KB Output is correct
6 Correct 0 ms 17472 KB Output is correct
7 Correct 0 ms 17472 KB Output is correct
8 Correct 0 ms 17472 KB Output is correct

Subtask #3
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1488 ms 17472 KB Output is correct
2 Correct 1564 ms 17472 KB Output is correct
3 Correct 1380 ms 17472 KB Output is correct
4 Correct 1504 ms 17472 KB Output is correct
5 Correct 1536 ms 17472 KB Output is correct
6 Correct 1516 ms 17472 KB Output is correct
7 Correct 1512 ms 17472 KB Output is correct
8 Correct 1516 ms 17472 KB Output is correct
9 Correct 1300 ms 17472 KB Output is correct
10 Correct 1368 ms 17472 KB Output is correct
11 Correct 1440 ms 17472 KB Output is correct
12 Correct 1464 ms 17472 KB Output is correct
13 Correct 1412 ms 17472 KB Output is correct