QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#248409	#6442. Secret of Tianqiu Valley	chengch	RE	1ms	3792kb	C++14	1.1kb	2023-11-11 19:02:21	2023-11-11 19:02:22

Judging History

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

[2023-11-11 19:02:22]
评测

测评结果：RE
用时：1ms
内存：3792kb

查看

[2023-11-11 19:02:21]
提交

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;


void solve(){
	int n;string s;cin>>n>>s;
	vector<int> x(n),y(n);
	for(int i=0;i<n;i++)x[i]=s[i]-'0';
	vector<int> ans;
	auto op=[&](int i){
		assert(x[i]==0);
		x[i]^=1,x[(i+1)%n]^=1,x[(i-1+n)%n]^=1,y[i]^=1;
		ans.push_back(i);
	};
	for(y[0]=0;y[0]<2;y[0]++)
		for(y[1]=0;y[1]<2;y[1]++){
			for(int i=2;i<n;i++)y[i]=y[i-2]^y[i-1]^x[i-1]^1;
			bool ok=true;
			for(int i=0;i<n;i++){
				int now=x[i]^y[i]^y[(i-1+n)%n]^y[(i+1)%n];
				if(now==0){
					ok=false;
					break;
				}
			}
			if(!ok)continue;
			for(int t=0;t<1000;t++){
				for(int i=0;i<n;i++)if(x[i]==0&&y[i]==1)op(i);
			}
			for(int t=0;t<1000;t++){
				for(int i=0;i<n;i++)if(x[i]==1&&y[i]==1){
					int l=(i-1+n)%n,r=(i+1)%n;
					if(x[r]==0&&y[r]==0){
						op(r);op(i);op(l);op(r);
					}else{
						op(l);op(i);op(r);op(l);
					}
				}
			}
			cout<<ans.size()<<endl;
			for(auto x:ans)cout<<x+1<<' ';cout<<endl;
			return;
		}
	cout<<0<<endl;
}

signed main(){
	int t;cin>>t;
	while(t--)solve();
	return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3584kb

input:

output:

7
1 3 2 3 4 5 3 
0

result:

ok all puzzle solved (2 test cases)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3792kb

input:

output:

result:

ok all puzzle solved (7 test cases)

Test #3:

score: 0

Accepted

time: 1ms

memory: 3508kb

input:

output:

result:

ok all puzzle solved (15 test cases)

Test #4:

score: 0

Accepted

time: 1ms

memory: 3588kb

input:

output:

7
1 3 2 3 4 5 3 
2
2 5 
2
1 3 
1
4 
2
2 4 
3
2 3 1 
1
5 
6
4 3 2 1 5 2 
2
3 5 
3
5 1 4 
3
3 4 2 
4
5 1 2 5 
1
1 
4
2 3 4 2 
6
1 2 3 4 5 3 
5
5 1 2 3 1 
2
1 4 
1
3 
3
1 2 5 
6
3 2 3 4 5 3 
3
4 5 3 
4
2 1 5 2 
4
1 2 3 1 
5
4 5 1 2 5 
1
2 
6
2 1 2 3 4 2 
4
3 4 5 3 
5
3 2 1 5 2 
6
1 5 1 2 3 1 
5
2 3 4 5...

result:

ok all puzzle solved (31 test cases)

Test #5:

score: 0

Accepted

time: 1ms

memory: 3588kb

input:

output:

2
3 6 
0
0
0
0
0
0
1
5 
0
2
3 5 
0
0
0
0
1
6 
0
0
0
2
4 6 
0
0
3
4 5 3 
0
0
0
0
0
4
3 4 5 3 
5
6 2 3 4 2 
0
0
0
0
0
0
1
4 
6
4 3 4 5 6 4 
0
0
0
0
0
3
5 6 4 
0
0
4
2 3 4 2 
0
0
0
1
3 
0
0
0
0
4
4 5 6 4 
0
5
3 4 5 6 4 
0
0
0
0
0
0

result:

ok all puzzle solved (63 test cases)

Test #6:

score: -100

Runtime Error

input:

output:

9
1 3 5 2 4 5 6 7 5 
2
3 6 
2
4 7 
5
5 7 1 2 7 
2
1 5 
3
2 4 7 
5
6 1 2 3 1 
8
4 6 3 5 2 1 7 2 
2
2 6 
5
5 7 1 4 6 
3
1 3 5 
4
3 4 7 2 
5
7 2 3 4 2 
4
2 3 5 1 
8
1 2 5 4 5 6 7 5 
1
6 
2
3 7 
5
2 4 5 1 3 
5
1 2 6 7 5 
2
4 6 
3
2 4 6 
6
6 5 2 1 7 2 
4
1 4 5 3 
5
7 1 2 3 1 
5
1 3 4 5 3 
2
2 7 
4
3 4 6 ...