QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#299613	#6506. Chase Game 3	111445^#	WA	49ms	3744kb	C++23	546b	2024-01-07 02:50:59	2024-01-07 02:50:59

Judging History

This is the latest submission verdict.

[2024-01-07 02:50:59]
Judged

Verdict: WA
Time: 49ms
Memory: 3744kb

Show

[2024-01-07 02:50:59]
Submitted

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

#define N 400000

int i,j,k,n,m,t,a[N+50];

bool fuck(){
	int i,j,k;
	map<pair<int,int> ,int> mp;
	for(i=2;i<=n;i++){
		mp[{a[i],a[i-1]}]=1;
		mp[{a[i-1],a[i]}]=1;
		mp[{i,i-1}]=1;
		mp[{i-1,i}]=1;
	}
	for(i=2;i<=n;i++){
		k=abs(a[i]-a[i-1]);
		if(k>=3)return 1;
	}
	return 0;
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0);
	cin>>t;
	while(t--){
		cin>>n;
		for(i=1;i<=n;i++)cin>>a[i];
		if(!fuck())cout<<"Yes\n";
		else cout<<"No\n";
	}
}

源文件, 语言: C++23

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3524kb

input:

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

output:

Yes
Yes
No
No
Yes

result:

ok 5 token(s): yes count is 3, no count is 2

Test #2:

score: 0

Accepted

time: 0ms

memory: 3600kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes

result:

ok 8 token(s): yes count is 8, no count is 0

Test #3:

score: -100

Wrong Answer

time: 49ms

memory: 3744kb

input:

output:

No
No
No
Yes
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
No
No
No
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
No
Yes
Yes
Yes
No
Yes
No
No
Yes
No
No
No
Yes
Yes
Yes
Yes
No
No
No
No
No
No
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
No
No
Yes
Yes
No
No
No
Yes
Yes
Yes
Yes
Yes
Yes
No
No
Yes
Yes
No
No
Yes
No
Yes
No
Yes
Yes
No
...

result:

wrong answer expected YES, found NO [1st token]