QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#113510	#6636. Longest Strictly Increasing Sequence	neko_nyaa	AC ✓	2ms	3552kb	C++23	757b	2023-06-18 10:35:02	2023-06-18 10:35:05

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-06-18 10:35:05]
评测

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

查看

[2023-06-18 10:35:02]
提交

answer

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

#define int long long

void solve() {
	int n; cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	if (a[0] != 1) {
		cout << "NO\n";
		return;
	}

	vector<int> b(n);
	b[0] = 10;
	for (int i = 1; i < n; i++) {
		if (a[i] < a[i-1]) {
			cout << "NO\n";
			return;
		}
		if (a[i] == a[i-1]) {
			b[i] = b[i-1] - 1;
			continue;
		}
		if (a[i] - a[i-1] == 1) {
			b[i] = b[i-1] + 10;
			continue;
		} else {
			cout << "NO\n";
			return;
		}
	}

	cout << "YES\n";
	for (int i: b) cout << i << ' ';
		cout << '\n';
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	
	int t; cin >> t;
	while (t--) {
		solve();
	}

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

input:

2
6
1 2 3 2 5 7
2
1 2

output:

NO
YES
10 20

result:

ok t=2 (2 test cases)

Test #2:

score: 0

Accepted

time: 2ms

memory: 3552kb

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
10 20 30 40 39 49 59 58 57 67 
YES
10 9 19 18 17 16 26 36 35 45 
NO
NO
NO
YES
10 20 19 18 17 16 15 25 24 23 
YES
10 9 19 29 39 49 48 47 46 56 
YES
10 20 30 40 50 49 59 58 68 
NO
NO
YES
10 20 30 29 28 27 37 36 35 45 
NO
NO
YES
10 20 19 29 39 38 37 36 46 45 
NO
NO
NO
NO
NO
NO
YES
10 9 8 18 1...

result:

ok t=3483 (3483 test cases)