QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#708621	#6636. Longest Strictly Increasing Sequence	kalikari	AC ✓	2ms	3804kb	C++17	1.7kb	2024-11-04 01:03:05	2024-11-04 01:03:06

Judging History

你现在查看的是最新测评结果

[2024-11-04 01:03:06]
评测

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

查看

[2024-11-04 01:03:05]
提交

answer

#include<bits/stdc++.h>
using namespace std;
/*
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
*/
// #define int long long
#define ld long double
//#define INT __int128
#define eb(x) emplace_back(x)
#define fi first
#define se second
#define sc(x) scanf("%d",&x)
#define SC(x) scanf("%lld",&x)
#define reserve reserve
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<long long, long long> PLL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const ld eps = 1e-12;
const int N = 1e5 + 10, M = N + 10;
int n;
PII a[N];

void solve(){
    scanf("%d",&n);
    std::vector<int> v(20);
    int mx=0,fg=0;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i].first);
        a[i].second=i;
        v[a[i].first]=1;
        mx=max(mx,a[i].first);
        if(a[i].first<a[i-1].first)fg=1;
    }   
    if(fg){
        puts("NO");
        return;
    }
    for(int i=1;i<=mx;i++){
        if(v[i]==0){
            // cout<<"_________"<<i<<endl;
            puts("NO");
            return;
        }
    } 
    puts("YES");
    // sort(a+1,a+1+n,[](const PII&A,const PII&B){
    //     if(A.first==B.first){
    //         return A.second>B.second;
    //     }
    //     return A.first<B.first;
    // });
    // vector<int>ans(15);
    // for(int i=1;i<=n;i++){
    //     ans[a[i].second]=i;
    // }
    for(int i=1;i<=n;i++){
        printf("%d ",a[i].first );
    }
    printf("\n");
}

signed main(){
    // ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    int T=1,cas=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3804kb

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

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)