QOJ.ac

QOJ

The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#221267	#6636. Longest Strictly Increasing Sequence	Nerovix^#	AC ✓	2ms	3432kb	C++20	772b	2023-10-21 11:26:29	2023-10-21 11:26:30

Judging History

This is the latest submission verdict.

[2023-10-21 11:26:30]
Judged

Verdict: AC
Time: 2ms
Memory: 3432kb

Show

[2023-10-21 11:26:29]
Submitted

answer

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

typedef vector<int> vi;

void solve() {
    int n;
    cin >> n;
    vi b(n);
    for(int &i : b) cin >> i;
    if(b[0] != 1) {
        cout << "NO\n";
        return;
    }
    for(int i = 1; i < n; i++)
        if(b[i] < b[i - 1] || b[i] > b[i - 1] + 1) {
            cout << "NO\n";
            return;
        }
    cout << "YES\n";
    int now = 1;
    cout << now << ' ';
    for(int i = 1; i < n; i++) {
        if(b[i] == b[i - 1]) {
            cout << 1 << ' ';
        } else {
            cout << ++now << ' ';
        }
    }
    cout << '\n';
}
signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int _; for(cin >> _; _; _--) solve();
    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3432kb

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

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 1 5 6 1 1 7 
YES
1 1 2 1 1 1 3 4 1 5 
NO
NO
NO
YES
1 2 1 1 1 1 1 3 1 1 
YES
1 1 2 3 4 5 1 1 1 6 
YES
1 2 3 4 5 1 6 1 7 
NO
NO
YES
1 2 3 1 1 1 4 1 1 5 
NO
NO
YES
1 2 1 3 4 1 1 1 5 1 
NO
NO
NO
NO
NO
NO
YES
1 1 1 2 1 3 1 4 1 
NO
NO
NO
NO
NO
NO
NO
YES
1 2 3 1 1 4 1 1 5 1 
YES
1 1 2 1 1...

result:

ok t=3483 (3483 test cases)