QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#127026	#6636. Longest Strictly Increasing Sequence	yy_zq^#	AC ✓	9ms	3580kb	C++14	636b	2023-07-19 12:25:30	2023-07-19 12:25:32

Judging History

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

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

[2023-07-19 12:25:32]
评测

测评结果：AC
用时：9ms
内存：3580kb

查看

[2023-07-19 12:25:30]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define FOR(i,j,k) for(int i=j;i<=k;++i) 
int b[13];
int a[13];
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		FOR(i,1,n){
			cin>>b[i];
		}
		int ys = 1;
		FOR(i,1,n){
			if(b[i]>b[i-1]) a[i] = min(i*10+1,100);
			if(b[i]==b[i-1]) a[i] = 11-i;
			if(b[i]<b[i-1]||b[i]>b[i-1]+1){
				ys=0;
			}
		}
		if(ys){
			cout<<"YES"<<endl;
			FOR(i,1,n) cout<<a[i]<<' ';
			cout<<endl;
		}
		else cout<<"NO"<<endl;
	}
	return 0;
}
/*
3
6
1 2 3 4 5 7
6
1 2 2 2 2 2 
6
2 2 2 2 2 2 
*/

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3580kb

input:

2
6
1 2 3 2 5 7
2
1 2

output:

NO
YES
11 21

result:

ok t=2 (2 test cases)

Test #2:

score: 0

Accepted

time: 9ms

memory: 3556kb

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
11 21 31 41 6 61 71 3 2 100 
YES
11 9 31 7 6 5 71 81 2 100 
NO
NO
NO
YES
11 21 8 7 6 5 4 81 2 1 
YES
11 9 31 41 51 61 4 3 2 100 
YES
11 21 31 41 51 5 71 3 91 
NO
NO
YES
11 21 31 7 6 5 71 3 2 100 
NO
NO
YES
11 21 8 41 51 5 4 3 91 1 
NO
NO
NO
NO
NO
NO
YES
11 9 8 41 6 61 4 81 2 
NO
NO
NO
NO
N...

result:

ok t=3483 (3483 test cases)