QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#168382	#6636. Longest Strictly Increasing Sequence	ucup-team1209^#	AC ✓	3ms	3448kb	C++20	941b	2023-09-08 13:15:28	2023-09-08 13:15:29

Judging History

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

[2023-09-08 13:15:29]
评测

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

查看

[2023-09-08 13:15:28]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
#define templ template<typename T>
templ bool chkmin(T &x,T y){return x>y?x=y,1:0;}
templ bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;
#define sz 101010

int n;
int a[sz],b[sz];

void work() {
    cin>>n;
    rep(i,1,n) cin>>b[i];
    rep(i,1,n) if (b[i]<b[i-1]||b[i]>b[i-1]+1) return cout<<"NO\n",void();
    a[1]=n+1; int mn=n+1,mx=n+1;
    rep(i,2,n) if (b[i]==b[i-1]) a[i]=--mn; else a[i]=++mx;
    cout<<"YES\n";
    rep(i,1,n) cout<<a[i]<<" \n"[i==n];
}

int main() {
    file();
    ios::sync_with_stdio(false),cin.tie(0);
    int T; cin>>T;
    while (T--) work();
    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 2ms

memory: 3440kb

input:

2
6
1 2 3 2 5 7
2
1 2

output:

NO
YES
3 4

result:

ok t=2 (2 test cases)

Test #2:

score: 0

Accepted

time: 3ms

memory: 3448kb

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
11 12 13 14 10 15 16 9 8 17
YES
11 10 12 9 8 7 13 14 6 15
NO
NO
NO
YES
11 12 10 9 8 7 6 13 5 4
YES
11 10 12 13 14 15 9 8 7 16
YES
10 11 12 13 14 9 15 8 16
NO
NO
YES
11 12 13 10 9 8 14 7 6 15
NO
NO
YES
11 12 10 13 14 9 8 7 15 6
NO
NO
NO
NO
NO
NO
YES
10 9 8 11 7 12 6 13 5
NO
NO
NO
NO
NO
NO
N...

result:

ok t=3483 (3483 test cases)