QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#180817	#6636. Longest Strictly Increasing Sequence	UrgantTeam^#	AC ✓	2ms	3648kb	C++23	817b	2023-09-16 13:20:58	2023-09-16 13:20:59

Judging History

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

[2023-09-16 13:20:59]
评测

测评结果：AC
用时：2ms
内存：3648kb

查看

[2023-09-16 13:20:58]
提交

answer

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long double ld;
typedef long long ll;

int mas[15];

int main()
{
 	//freopen("input.txt", "r", stdin);
 	//freopen("output.txt", "w", stdout);
	ios_base::sync_with_stdio(0); cin.tie(0);

	int test;
	cin >> test;

	for (int rep = 1; rep <= test; rep++)
	{
	 	int n;
	 	cin >> n;
	 	for (int i = 1; i <= n; i++) cin >> mas[i];

	 	bool fl = true;
	 	if (mas[1] != 1) fl = false;
	 	for (int i = 2; i <= n; i++)
	 		if (mas[i] != mas[i - 1] && mas[i] != mas[i - 1] + 1) fl = false;

	 	if (!fl) cout << "NO\n";
	 	else
	 	{
	 	 	cout << "YES\n";
	 	 	for (int i = 1; i <= n; i++) cout << mas[i] << ' ';
	 	 	cout << '\n';
	 	}
	}

	return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3576kb

input:

2
6
1 2 3 2 5 7
2
1 2

output:

NO
YES
1 2

result:

ok t=2 (2 test cases)

Test #2:

score: 0

Accepted

time: 2ms

memory: 3648kb

input:

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

output:

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

result:

ok t=3483 (3483 test cases)