QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#666606#9518. 观虫我 (旧版数据)N_z_Judgement Failed//C++23550b2024-10-22 19:17:322024-10-22 21:24:43

Judging History

你现在查看的是最新测评结果

  • [2024-10-22 21:24:43]
  • 管理员手动重测本题所有提交记录
  • [2024-10-22 19:17:32]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
bitset<1000000>a[4][1<<8];
int main()
{
	cin.tie(0)->sync_with_stdio(0);
	int n,q;
	cin>>n>>q;
	int nm=0;
	while(q--&&1.*clock()/CLOCKS_PER_SEC<=9)
	{
		char op;
		unsigned v;
		cin>>op>>v;
		if(op=='!')
		{
			for(int x=0;x<4;x++)
			{
				unsigned nv=v>>(x*8)&255;
				for(unsigned y=nv;y<256;y=(y+1)|nv)
				a[x][y][nm].flip();
			}
			nm++;
		}
		else
		{
			cout<<((a[0][v&255]&a[1][v>>8&255]&a[2][v>>16&255]&a[3][v>>24&255]).count()&1)<<endl;
		}
	}
}

Details

Failed to show details