QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#130353	#6636. Longest Strictly Increasing Sequence	RobeZH^#	AC ✓	3ms	3488kb	C++14	1.0kb	2023-07-23 21:42:42	2023-07-23 21:42:43

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-23 21:42:43]
评测

测评结果：AC
用时：3ms
内存：3488kb

查看

[2023-07-23 21:42:42]
提交

answer

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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define subnb true
#define Lnb true
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

const int N = (int)15;

int n, a[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int T;
    cin >> T;
    while(T--) {
        cin >> n;
        rep(i, 0, n) cin >> a[i];
        bool good = true;
        rep(i, 0, n) {
            bool found = a[i] == 1;
            rep(j, 0, i) {
                found |= a[j] == a[i] - 1;
            }
            good &= found;
        }
        rep(i, 1, n) good &= a[i - 1] <= a[i];
        if(good) {
            cout << "YES\n";
            rep(i, 0, n) cout << a[i] << " ";
            cout << '\n';
        } else {
            cout << "NO\n";
        }
    }

}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3468kb

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: 3ms

memory: 3488kb

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

result:

ok t=3483 (3483 test cases)