QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#124934	#6636. Longest Strictly Increasing Sequence	KKT89	AC ✓	2ms	3472kb	C++17	1.4kb	2023-07-15 19:31:00	2023-07-15 19:31:03

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-15 19:31:03]
评测

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

查看

[2023-07-15 19:31:00]
提交

answer

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int q; cin >> q;
    while (q--) {
        int n; cin >> n;
        vector<int> b(n);
        bool ok = true;
        for (int i = 0; i < n; ++i) {
            cin >> b[i];
            if (b[i] > i+1) ok = false;
        }
        for (int i = 1; i < n; ++i) {
            if (b[i] == b[i-1] or b[i] == b[i-1]+1) {

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

源文件, 语言: C++17

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 3460kb

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 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)