Submission #1594704


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
namespace test
{
	const int N=101000;
	struct bit
	{
		int s[N];
		inline void init(){memset(s,0,sizeof(s));}
		inline int lowbit(int x){return x&(-x);}
		inline void inc(int p,int w){for(;p<N;p+=lowbit(p))s[p]+=w;}
		inline int ask(int p){int ret=0;for(;p;p-=lowbit(p))ret+=s[p];return ret;}
		inline int query(int L,int R){return ask(R)-ask(L-1);}
	}t0;
	int a[4][N],s[N];
	bool f[N],df[N];
	int n;
	bool initialize()
	{
		scanf("%d",&n);
		for(int i=1;i<=3;i++)
			for(int j=1;j<=n;j++)
				scanf("%d",&a[i][j]);
		for(int i=1;i<=n;i++)
		{
			if(a[1][i]%3==2)return 0;

			int x=(a[1][i]+2)/3;
			s[i]=x;
			if(a[2][i]==a[1][i]+1 && a[3][i]==a[2][i]+1)f[i]=0;
			else if(a[2][i]==a[1][i]-1 && a[3][i]==a[2][i]-1)f[i]=1;
			else return 0;
		}
		for(int i=1;i<=n;i++)
			if((i%2)^(s[i]%2))return 0;
		return 1;
	}
	bool check()
	{
		int cnta=0,cntb=0;
		for(int i=1;i<=n;i+=2)
			cnta+=f[i];
		for(int i=2;i<=n;i+=2)
			cntb+=f[i];
		if(cnta%2 || cntb%2)return 0;
		return 1;
	}

	const int h[4]={15,30,60,120};
	bool fuck()
	{
		int k=0;
		for(int i=1;i<=n;i++)k=k*2+f[i];

		if(k&16)k^=30;
		if(k&8)k^=15;
		return k==0;
	}
	void solve()
	{
		if(!initialize()){printf("No\n");return;}

		for(int i=1;i<=n;i++)
			printf("%d ",s[i]);
		printf("\n");
		for(int i=1;i<=n;i++)
			printf("%d ",f[i]);
		printf("\n");

		int cnt=0;
		t0.init();
		for(int i=2;i<=n;i+=2)
		{
			t0.inc(s[i],1);
			cnt=t0.query(i+1,n);

			df[i+1]=f[i+1]^(cnt&1);
			df[s[i]]=f[i]^((i-s[i])&2);
		}
		for(int i=1;i<=n;i++)f[i]=df[i];

		cnt=0;
		t0.init();
		for(int i=1;i<=n;i+=2)
		{
			t0.inc(s[i],1);
			cnt=t0.query(i+1,n);

			df[i+1]=f[i+1]^(cnt&1);
			df[s[i]]=f[i]^((i-s[i])&2);
		}
		for(int i=1;i<=n;i++)f[i]=df[i];

//		for(int i=1;i<=n;i++)
//			printf("%d ",f[i]);
//		printf("\n");

		if(n>=6)printf("%s\n",check()?"Yes":"No");
		else printf("%s\n",fuck()?"Yes":"No");
	}
}
int main()
{
	test::solve();
	return 0;
}

Submission Info

Submission Time
Task E - Rotate 3x3
User Demerzel_IV
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2071 Byte
Status WA
Exec Time 52 ms
Memory 3200 KB

Compile Error

./Main.cpp: In function ‘bool test::initialize()’:
./Main.cpp:21:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
                 ^
./Main.cpp:24:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&a[i][j]);
                         ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1500
Status
AC × 1
WA × 4
AC × 21
WA × 58
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt, 1_70.txt, 1_71.txt, 1_72.txt, 1_73.txt
Case Name Status Exec Time Memory
0_00.txt WA 1 ms 640 KB
0_01.txt AC 1 ms 256 KB
0_02.txt WA 1 ms 640 KB
0_03.txt WA 1 ms 640 KB
0_04.txt WA 1 ms 640 KB
1_00.txt WA 49 ms 3200 KB
1_01.txt AC 29 ms 1408 KB
1_02.txt AC 30 ms 1408 KB
1_03.txt AC 29 ms 1408 KB
1_04.txt AC 29 ms 1408 KB
1_05.txt WA 48 ms 3200 KB
1_06.txt AC 30 ms 1408 KB
1_07.txt AC 30 ms 1408 KB
1_08.txt AC 30 ms 1408 KB
1_09.txt AC 30 ms 1920 KB
1_10.txt WA 1 ms 640 KB
1_11.txt WA 1 ms 640 KB
1_12.txt WA 1 ms 640 KB
1_13.txt WA 1 ms 640 KB
1_14.txt WA 1 ms 640 KB
1_15.txt WA 1 ms 640 KB
1_16.txt WA 1 ms 640 KB
1_17.txt WA 1 ms 640 KB
1_18.txt WA 1 ms 640 KB
1_19.txt WA 1 ms 640 KB
1_20.txt WA 1 ms 640 KB
1_21.txt WA 1 ms 640 KB
1_22.txt WA 1 ms 640 KB
1_23.txt WA 1 ms 640 KB
1_24.txt WA 1 ms 640 KB
1_25.txt WA 1 ms 640 KB
1_26.txt WA 52 ms 3200 KB
1_27.txt WA 51 ms 3200 KB
1_28.txt WA 51 ms 3200 KB
1_29.txt WA 51 ms 3200 KB
1_30.txt WA 51 ms 3200 KB
1_31.txt WA 51 ms 3200 KB
1_32.txt WA 52 ms 3200 KB
1_33.txt WA 52 ms 3200 KB
1_34.txt WA 52 ms 3200 KB
1_35.txt WA 52 ms 3200 KB
1_36.txt WA 52 ms 3200 KB
1_37.txt WA 52 ms 3200 KB
1_38.txt WA 51 ms 3200 KB
1_39.txt WA 51 ms 3200 KB
1_40.txt WA 51 ms 3200 KB
1_41.txt WA 51 ms 3200 KB
1_42.txt WA 51 ms 3200 KB
1_43.txt WA 52 ms 3200 KB
1_44.txt WA 52 ms 3200 KB
1_45.txt WA 51 ms 3200 KB
1_46.txt WA 51 ms 3200 KB
1_47.txt WA 51 ms 3200 KB
1_48.txt WA 52 ms 3200 KB
1_49.txt WA 51 ms 3200 KB
1_50.txt WA 51 ms 3200 KB
1_51.txt WA 50 ms 3072 KB
1_52.txt WA 51 ms 3200 KB
1_53.txt WA 51 ms 3200 KB
1_54.txt WA 51 ms 3200 KB
1_55.txt WA 52 ms 3072 KB
1_56.txt WA 51 ms 3200 KB
1_57.txt WA 51 ms 3200 KB
1_58.txt AC 30 ms 1408 KB
1_59.txt AC 31 ms 1920 KB
1_60.txt AC 30 ms 1536 KB
1_61.txt AC 31 ms 1920 KB
1_62.txt AC 30 ms 1536 KB
1_63.txt WA 49 ms 3072 KB
1_64.txt AC 30 ms 1920 KB
1_65.txt WA 51 ms 3200 KB
1_66.txt AC 30 ms 1664 KB
1_67.txt AC 30 ms 1536 KB
1_68.txt AC 31 ms 1920 KB
1_69.txt AC 31 ms 1920 KB
1_70.txt AC 31 ms 1920 KB
1_71.txt AC 31 ms 1920 KB
1_72.txt WA 50 ms 3200 KB
1_73.txt WA 50 ms 3200 KB