QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#299605	#6506. Chase Game 3	111445^#	WA	52ms	3764kb	C++23	664b	2024-01-07 02:39:48	2024-01-07 02:39:48

Judging History

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

[2024-01-07 02:39:48]
评测

测评结果：WA
用时：52ms
内存：3764kb

查看

[2024-01-07 02:39:48]
提交

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>=4)return 1;
		if(k==3){
			j=min(a[i],a[i-1]); k=max(a[i],a[i-1]);
			if(!mp.count({j,k-1})&&!mp.count({j+1,k}))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";
	}
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3516kb

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: 3764kb

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: 52ms

memory: 3584kb

input:

output:

Yes
Yes
No
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
No
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Y...

result:

wrong answer expected NO, found YES [4th token]