QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#772229#7863. Parity GameTom22lWA 2ms3844kbC++174.7kb2024-11-22 17:42:232024-11-22 17:42:24

Judging History

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

  • [2024-11-22 17:42:24]
  • 评测
  • 测评结果：WA
  • 用时：2ms
  • 内存：3844kb
查看
  • [2024-11-22 17:42:23]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int Read(){
	int x=0;
	char ch=getchar();bool f=0;
	while(ch<'0'||ch>'9') if(ch=='-')f=1,ch=getchar(); else if(ch==EOF)return 0; else ch=getchar();
	while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return f?-x:x;
}
bool a[505];
int n,t;
bool check(int x,bool t){
	int cnt1=0,cnt0=0,nwc=0;
	for(int i=1;i<=n;i++){
		if(i==x+1) continue;
		if(i==x){
			if(t==0){
				cnt0++;
				if(nwc%2==1)cnt1++;
				nwc=0;
			}else nwc++;
			continue;
		}
		if(a[i]==0){
			cnt0++;
			if(nwc%2==1)cnt1++;
			nwc=0;
		}else nwc++;
	}
	if(nwc%2==1) cnt1++;
	return (cnt1>=cnt0);
}
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	n=Read(),t=Read();
	for(int i=1;i<=n;i++){
		a[i]=Read();
	}
	if(n%2==1) t^=1;
	if(t==0){
		if(n%2==1) {printf("Bob\n");fflush(stdout);		}
		else{
			printf("Alice\n");
			fflush(stdout);
			n--;
			printf("1 %c\n",(!(a[1]&&a[2])?'*':'+'));
			fflush(stdout);a[1]=0;
			for(int i=2;i<=n;i++) a[i]=a[i+1];
		} 
		fflush(stdout);
		while(n>1){
			int x=Read();char ch=getchar();
			while(ch!='+'&&ch!='*') ch=getchar();
			if(ch=='+') a[x]^=a[x+1]; else a[x]&=a[x+1];
			n--;
			if(n==1) break;
			for(int i=x+1;i<=n;i++) a[i]=a[i+1];
			n--;
			printf("1 %c\n",(!(a[1]&&a[2])?'*':'+'));
			fflush(stdout);
			a[1]=0;
			for(int i=2;i<=n;i++) a[i]=a[i+1];
//			for(int i=1;i<=n;i++) cout<<a[i]<<' ';
//			cout<<endl;
		}
	}else{
		if(n%2==1){ // bob is lp
			bool flag=0;
			for(int i=1;i<n;i++){
				if(!check(i,a[i]^a[i+1])){
					printf("Alice\n");fflush(stdout);
					printf("%d +\n",i);fflush(stdout);
					a[i]^=a[i+1];
					for(int j=i+1;j<n;j++) a[j]=a[j+1];
					flag=1;break;
				}if(!check(i,a[i]&a[i+1])){
					printf("Alice\n");fflush(stdout);
					printf("%d *\n",i);fflush(stdout);
					a[i]&=a[i+1];
					for(int j=i+1;j<n;j++) a[j]=a[j+1];
					flag=1;break;
				}
			}
			if(flag){
				n--;
				while(n>1){
					int x=Read();char ch=getchar();
					if(!x) return 0;
					while(ch!='+'&&ch!='*') ch=getchar();
					if(ch=='+') a[x]^=a[x+1]; else a[x]&=a[x+1];
					n--;
					if(n==1) break;
					for(int i=x+1;i<=n;i++) a[i]=a[i+1];
					for(int i=1;i<n;i++){
						if(!check(i,a[i]^a[i+1])){
							printf("%d +\n",i);fflush(stdout);
							a[i]^=a[i+1];
							for(int j=i+1;j<n;j++) a[j]=a[j+1];
							break;
						}if(!check(i,a[i]&a[i+1])){
							printf("%d *\n",i);fflush(stdout);
							a[i]&=a[i+1];
							for(int j=i+1;j<n;j++) a[j]=a[j+1];
							break;
						}
					}
					n--;
				}
			}else{
				printf("Bob\n");fflush(stdout);
				while(n>1){
					int x=Read();char ch=getchar();
					while(ch!='+'&&ch!='*') ch=getchar();
					if(ch=='+') a[x]^=a[x+1]; else a[x]&=a[x+1];
					n--;
					for(int i=x+1;i<=n;i++) a[i]=a[i+1];
					bool ff=0;
					for(int i=1;i<n;i++){
						if(a[i]==0){
							printf("%d +\n",i);fflush(stdout);
							a[i]=a[i+1];
							for(int j=i+1;j<n;j++) a[j]=a[j+1];
							ff=1;
							break;
						}
					}if(!ff){
						if(a[n]==0) {printf("%d +\n",n-1);fflush(stdout);}
						else{
							printf("%d *\n",1);fflush(stdout);
						}
					}n--;
				}
			}
		}else{ // alice is lp
			if(!check(n+3,0)){
				printf("Bob\n");fflush(stdout);
				while(n>1){
					int x=Read();char ch=getchar();
					while(ch!='+'&&ch!='*') ch=getchar();
					if(ch=='+') a[x]^=a[x+1]; else a[x]&=a[x+1];
					n--;
					if(n==1) break;
					for(int i=x+1;i<=n;i++) a[i]=a[i+1];
					for(int i=1;i<n;i++){
						if(!check(i,a[i]^a[i+1])){
							printf("%d +\n",i);fflush(stdout);break;
						}if(!check(i,a[i]&a[i+1])){
							printf("%d *\n",i);fflush(stdout);break;
						}
					}n--;
				}
			}else{
				printf("Alice\n");fflush(stdout);
				bool ff=0;
				for(int i=1;i<n;i++){
					if(a[i]==0){
						printf("%d +\n",i);fflush(stdout);
						a[i]=a[i+1];
						for(int j=i+1;j<n;j++) a[j]=a[j+1];
						ff=1;
						break;
					}
				}if(!ff){
					if(a[n]==0) {printf("%d +\n",n-1);fflush(stdout);}
					else{
						printf("%d *\n",1);fflush(stdout);
					}
				}n--;
				while(n>1){
					int x=Read();char ch=getchar();
					while(ch!='+'&&ch!='*') ch=getchar();
					if(ch=='+') a[x]^=a[x+1]; else a[x]&=a[x+1];
					n--;
					for(int i=x+1;i<=n;i++) a[i]=a[i+1];
					ff=0;
					for(int i=1;i<n;i++){
						if(a[i]==0){
							printf("%d +\n",i);fflush(stdout);
							a[i]=a[i+1];
							for(int j=i+1;j<n;j++) a[j]=a[j+1];
							ff=1;
							break;
						}
					}if(!ff){
						if(a[n]==0) {printf("%d +\n",n-1);fflush(stdout);}
						else{
							printf("%d *\n",1);fflush(stdout);
						}
					}n--;
				}
			}
		}
	}
	return 0; 
}
/*
7 0
1 0 1 1 0 1 0
*/
Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3740kb

input:

4 1
0 1 0 1
1 *
1

output:

Alice
1 +
1 +

result:

ok The player wins!

Test #2:

score: 0
Accepted
time: 0ms
memory: 3684kb

input:

4 0
1 0 1 0
1 +
1

output:

Alice
1 *
1 *

result:

ok The player wins!

Test #3:

score: 0
Accepted
time: 1ms
memory: 3656kb

input:

5 1
1 1 1 0 0
4 +
1 +
1

output:

Bob
1 +
1 *

result:

ok The player wins!

Test #4:

score: 0
Accepted
time: 0ms
memory: 3780kb

input:

3 0
1 1 1
1 +
1

output:

Bob
1 +

result:

ok The player wins!

Test #5:

score: 0
Accepted
time: 0ms
memory: 3652kb

input:

3 1
1 0 1
1 *
1

output:

Bob
1 *

result:

ok The player wins!

Test #6:

score: 0
Accepted
time: 1ms
memory: 3796kb

input:

3 0
1 0 1
1 *
1

output:

Bob
1 +

result:

ok The player wins!

Test #7:

score: 0
Accepted
time: 0ms
memory: 3844kb

input:

2 1
0 1
1

output:

Alice
1 +

result:

ok The player wins!

Test #8:

score: 0
Accepted
time: 0ms
memory: 3780kb

input:

499 0
0 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1 0 ...

output:

Alice
1 *
1 +
1 +
1 +
1 *
1 +
1 *
1 +
1 *
1 *
1 +
1 *
1 +
1 +
1 *
1 +
1 +
1 *
1 +
1 *
1 *
1 +
1 +
1 +
1 +
1 *
1 +
1 +
1 *
1 +
1 +
1 *
1 +
1 +
1 +
1 *
1 +
1 +
1 +
1 +
1 *
1 +
1 +
1 +
1 *
1 +
1 +
1 *
1 +
1 *
1 +
1 *
1 +
1 *
1 +
1 +
1 *
1 *
1 *
1 *
1 +
1 +
1 +
1 +
1 +
1 *
1 *
1 +
1 *
1 +
1 +
1 +
1 *
1 ...

result:

ok The player wins!

Test #9:

score: -100
Wrong Answer
time: 2ms
memory: 3796kb

input:

499 0
1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 0 1 1 1 0 1 ...

output:

Bob
1 +
2 +
2 +
2 +
2 +
1 +
1 +
1 +
2 +
2 +
2 +
1 +
1 +
1 +
2 +
2 +
1 +
1 +
1 +
1 +
2 +
2 +
2 +
1 +
1 +
2 +
2 +
2 +
2 +
2 +
2 +
1 +
1 +
1 +
2 +
2 +
1 +
1 +
1 +
1 +
1 +
2 +
2 +
2 +
1 +
1 +
2 +
2 +
1 +
1 +
1 +
2 +
2 +
2 +
2 +
2 +
1 +
1 +
1 +
2 +
2 +
1 +
1 +
2 +
1 +
1 +
1 +
2 +
2 +
1 +
1 +
1 +
1 +
2 +
...

result:

wrong answer The interactor wins!
English 繁體中文 简体中文

Server Time: 2024-12-03 22:03:58 | OpenSource Project