QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#118851	#6636. Longest Strictly Increasing Sequence	8BQube^#	AC ✓	2ms	3472kb	C++20	1.0kb	2023-07-04 13:51:27	2023-07-04 13:51:31

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:51:31]
评测

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

查看

[2023-07-04 13:51:27]
提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back

int arr[105], ans[105];

void solve() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> arr[i];
    }
    if (arr[1] != 1) {
        cout << "NO\n";
        return;
    }
    ans[1] = 1;
    int lst = 1;
    for (int i = 2; i <= n; ++i) {
        if (arr[i] < arr[i - 1]) {
            cout << "NO\n";
            return;
        }
        if (arr[i] == arr[i - 1]) {
            ans[i] = 1;
        }
        else if (arr[i] == arr[i - 1] + 1) {
            ans[i] = lst + 1;
            ++lst;
        }
        else {
            cout << "NO\n";
            return;
        }
    }
    cout << "YES\n";
    for (int i = 1; i <= n; ++i)
        cout << ans[i] << " \n"[i == n];
}

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

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3372kb

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

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

result:

ok t=3483 (3483 test cases)