QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#189374	#6636. Longest Strictly Increasing Sequence	huamuyichun^#	AC ✓	1ms	3540kb	C++14	1.3kb	2023-09-27 13:44:12	2023-09-27 13:44:14

Judging History

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

[2023-09-27 13:44:14]
评测

测评结果：AC
用时：1ms
内存：3540kb

查看

[2023-09-27 13:44:12]
提交

answer

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
using namespace std;
#define _for(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define debug(a) cout<<#a<<a<<endl;
#define io_speed_up ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef unsigned long long u64;
typedef pair<int,int> pii;
typedef vector<int> vi;
int T;
const int N=13;
void solve(){
    int n;
    cin>>n;
    vector<int> a(n+3),b(n+3);
    for(int i=1;i<=n;i++){
        cin>>b[i];
    } 
    b[0]=0;
    for(int i=1;i<=n;i++){
        if(b[i]>i) {cout<<"No"<<endl;return;}
        else if(b[i]<b[i-1]){cout<<"No"<<endl;return;}
        else if(b[i]>=b[i-1]+2){cout<<"No"<<endl;return ;}
    }
    cout<<"Yes"<<endl;
    a[1]=1;
    for(int i=2;i<=n;i++){
        if(b[i]==b[i-1]) a[i]=a[i-1];
        else if(b[i]==b[i-1]+1){
            a[i]=a[i-1]+1;
        }
    }
    for(int i=1;i<=n;i++){
        cout<<a[i]<<" ";
    }
    cout<<endl;
}
int main(){
    io_speed_up;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3540kb

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

memory: 3516kb

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)