QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#127621	#6636. Longest Strictly Increasing Sequence	pyrus	AC ✓	2ms	3500kb	C++20	873b	2023-07-19 20:49:58	2023-07-19 20:50:01

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-19 20:50:01]
评测

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

查看

[2023-07-19 20:49:58]
提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
#define Yes cout<<"YES\n"
#define No  cout<<"NO\n"
#define all(a) a.begin(),a.end()
#define pb push_back
#define endl '\n'
//#define int ll
const ll mod=1e9+7;const int M=2e5+5;const int N=2e5+5;
int dx[] = {-1, 1, 0, 0};int dy[] = {0, 0, -1, 1};
void solve()
{
    int n;cin>>n;
    vector<int> a(n);
    int f=1;
    for(int i=0;i<n;i++){
        cin>>a[i];
        if(a[0]!=1) f=0;
        if(i>=1){
            if(a[i]<a[i-1]||a[i]>a[i-1]+1){
                f=0;
            }
        }
    } 
    if(f){
        Yes;
        for(auto v:a) cout<<v<<' ';cout<<endl;
    }
    else No;
}
signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int __;
    __=1;
    cin>>__;
    while(__--)
    {
    solve();
    }
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3440kb

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

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)