QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#118831	#6636. Longest Strictly Increasing Sequence	ideograph_advantage^#	AC ✓	2ms	3436kb	C++17	1.1kb	2023-07-04 13:26:19	2023-07-04 13:26:20

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-04 13:26:20]
评测

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

查看

[2023-07-04 13:26:19]
提交

answer


#include <bits/stdc++.h>

using namespace std;

#define io ios_base::sync_with_stdio(false); cin.tie(0); cerr.tie(0)
#define iter(v) v.begin(), v.end()
#define SZ(v) int(v.size())
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug(){cerr << "\n";}
template<class T, class ... U>
void debug(T a, U ... b){cerr << a << " ", debug(b...);}
template<class T> void pary(T l, T r){
	while(l != r) cerr << *l << " ", l++;
	cerr << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif
template<class A, class B>
ostream& operator<<(ostream& o, pair<A, B> p){
	return o << '(' << p.ff << ',' << p.ss << ')';
}

void solve(){
	int n;
	cin >> n;

	vector<int> b(n + 1);
	bool ans = true;
	for(int i = 1; i <= n; i++){
		cin >> b[i];
		if (b[i] > i) ans = false;
		if (i > 1 && (b[i-1] > b[i] || b[i-1] + 1 < b[i])) ans = false;
	}

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

}

int main(){
	io;

	int T;
	cin >> T;
	while(T--) solve();



}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3408kb

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

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 3 3 3 3 ...

result:

ok t=3483 (3483 test cases)