QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#384688	#6506. Chase Game 3	514imba	WA	5ms	3644kb	C++11	732b	2024-04-10 10:25:21	2024-04-10 10:25:21

Judging History

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

[2024-04-10 10:25:21]
评测

测评结果：WA
用时：5ms
内存：3644kb

查看

[2024-04-10 10:25:21]
提交

answer

#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define fi first
#define se second
#define Mp make_pair
using namespace std;
typedef long long ll;
int rd() {
	int r=0; bool w=false; char ch=getchar();
	while( ch < '0' || ch > '9' ) w = !(ch^45), ch = getchar();
	while( ch >= '0' && ch <= '9' ) r = (r<<1) + (r<<3) + (ch^48), ch = getchar();
	return w ? -r : r;
}

#define MAXN 400000


int p[MAXN+5], n;
void solve() {
	n = rd();
	FOR(i,1,n) {
		p[i] = rd();
	}
	FOR(i,1,n) if( i > 1 && abs(p[i] - p[i-1]) > 2 ) {
		puts("NO"); return;
	}
	puts("YES");
}

int main() {
	int t = rd(); while( t-- ) solve();
	return 0;
}

源文件, 语言: C++11

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3644kb

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

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

memory: 3640kb

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]