QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#61017	#3890. Corrupted Contest	SayedHassan^#	AC ✓	39ms	3548kb	C++	1000b	2022-11-09 05:19:03	2022-11-09 05:19:05

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-11-09 05:19:05]
评测

测评结果：AC
用时：39ms
内存：3548kb

查看

[2022-11-09 05:19:03]
提交

answer


#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define fi first
#define sc second

const int N=1e5+5;
int n,m;
int c[N],a[N],b[N],p[N];
int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    /*cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        cin>>c[i]>>a[i];
        p[c[i]]=a[i];
    }
    for(int i=0;i<n;i++)
    {
        cin>>b[i];
    }*/
    int x;
    cin>>n>>x;
    int a[n],b[n]={0},ans[n]={0},ch=0;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    if(a[n-1])ans[n-1]=1;
    for(int i=n-2;i>=0;i--)
    {
        if(a[i]>a[i+1])
        {
            ans[i]=1;
        }
        ans[i]+=ans[i+1];
        if(a[i]<=a[i+1])ch=1;
    }
    if(ans[0]!=x&&a[0]!=0)cout<<"ambiguous";
    else
    {
        for(int i=0;i<n;i++)cout<<ans[i]<<endl;
    }
    return 0;
}

源文件, 语言: C++

详细

Test #1:

score: 100

Accepted

time: 2ms

memory: 3300kb

input:

output:

result:

ok 9 lines

Test #2:

score: 0

Accepted

time: 2ms

memory: 3432kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #3:

score: 0

Accepted

time: 0ms

memory: 3364kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #4:

score: 0

Accepted

time: 2ms

memory: 3392kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #5:

score: 0

Accepted

time: 1ms

memory: 3496kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #6:

score: 0

Accepted

time: 18ms

memory: 3428kb

input:

output:

result:

ok 10000 lines

Test #7:

score: 0

Accepted

time: 26ms

memory: 3544kb

input:

output:

result:

ok 10000 lines

Test #8:

score: 0

Accepted

time: 0ms

memory: 3304kb

input:

output:

result:

ok 10 lines

Test #9:

score: 0

Accepted

time: 3ms

memory: 3296kb

input:

output:

result:

ok 10 lines

Test #10:

score: 0

Accepted

time: 2ms

memory: 3292kb

input:

output:

result:

ok 10 lines

Test #11:

score: 0

Accepted

time: 3ms

memory: 3304kb

input:

output:

result:

ok 10 lines

Test #12:

score: 0

Accepted

time: 2ms

memory: 3244kb

input:

output:

result:

ok 10 lines

Test #13:

score: 0

Accepted

time: 19ms

memory: 3544kb

input:

output:

result:

ok 10000 lines

Test #14:

score: 0

Accepted

time: 32ms

memory: 3444kb

input:

output:

result:

ok 10000 lines

Test #15:

score: 0

Accepted

time: 39ms

memory: 3424kb

input:

10000 10000
1000000
999900
999800
999700
999600
999500
999400
999300
999200
999100
999000
998900
998800
998700
998600
998500
998400
998300
998200
998100
998000
997900
997800
997700
997600
997500
997400
997300
997200
997100
997000
996900
996800
996700
996600
996500
996400
996300
996200
996100
996000
...

output:

result:

ok 10000 lines

Test #16:

score: 0

Accepted

time: 3ms

memory: 3428kb

input:

10000 10000
100
200
300
400
500
600
700
800
900
1000
1100
1200
1300
1400
1500
1600
1700
1800
1900
2000
2100
2200
2300
2400
2500
2600
2700
2800
2900
3000
3100
3200
3300
3400
3500
3600
3700
3800
3900
4000
4100
4200
4300
4400
4500
4600
4700
4800
4900
5000
5100
5200
5300
5400
5500
5600
5700
5800
5900
60...

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #17:

score: 0

Accepted

time: 16ms

memory: 3480kb

input:

output:

result:

ok 10000 lines

Test #18:

score: 0

Accepted

time: 2ms

memory: 3312kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #19:

score: 0

Accepted

time: 0ms

memory: 3308kb

input:

output:

result:

ok 100 lines

Test #20:

score: 0

Accepted

time: 26ms

memory: 3428kb

input:

output:

result:

ok 10000 lines

Test #21:

score: 0

Accepted

time: 37ms

memory: 3452kb

input:

output:

result:

ok 10000 lines

Test #22:

score: 0

Accepted

time: 8ms

memory: 3548kb

input:

output:

result:

ok 10000 lines

Test #23:

score: 0

Accepted

time: 7ms

memory: 3360kb

input:

output:

result:

ok 10000 lines

Test #24:

score: 0

Accepted

time: 14ms

memory: 3424kb

input:

output:

result:

ok 10000 lines

Test #25:

score: 0

Accepted

time: 1ms

memory: 3428kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #26:

score: 0

Accepted

time: 0ms

memory: 3364kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #27:

score: 0

Accepted

time: 3ms

memory: 3424kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #28:

score: 0

Accepted

time: 3ms

memory: 3496kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #29:

score: 0

Accepted

time: 29ms

memory: 3448kb

input:

output:

result:

ok 10000 lines

Test #30:

score: 0

Accepted

time: 0ms

memory: 3428kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #31:

score: 0

Accepted

time: 2ms

memory: 3492kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #32:

score: 0

Accepted

time: 1ms

memory: 3432kb

input:

10000 10000
330609
382236
539767
554277
91057
146218
96179
550753
773919
929519
551462
768692
856234
5942
185135
445427
825381
711007
94941
292487
191264
249487
457005
731576
746466
136779
267662
116350
17559
282990
293053
361378
436294
387525
699346
156487
756118
927191
448916
999305
382286
811625
...

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #33:

score: 0

Accepted

time: 2ms

memory: 3300kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #34:

score: 0

Accepted

time: 2ms

memory: 3336kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #35:

score: 0

Accepted

time: 0ms

memory: 3372kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #36:

score: 0

Accepted

time: 2ms

memory: 3304kb

input:

output:

result:

ok 10 lines

Test #37:

score: 0

Accepted

time: 2ms

memory: 3248kb

input:

output:

result:

ok 10 lines

Test #38:

score: 0

Accepted

time: 2ms

memory: 3364kb

input:

output:

result:

ok 100 lines

Test #39:

score: 0

Accepted

time: 34ms

memory: 3424kb

input:

output:

result:

ok 10000 lines

Test #40:

score: 0

Accepted

time: 8ms

memory: 3428kb

input:

output:

result:

ok 10000 lines

Test #41:

score: 0

Accepted

time: 22ms

memory: 3428kb

input:

output:

result:

ok 10000 lines

Test #42:

score: 0

Accepted

time: 3ms

memory: 3480kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #43:

score: 0

Accepted

time: 3ms

memory: 3368kb

input:

output:

ambiguous

result:

ok single line: 'ambiguous'

Test #44:

score: 0

Accepted

time: 8ms

memory: 3356kb

input:

output:

result:

ok 10000 lines

Test #45:

score: 0

Accepted

time: 25ms

memory: 3424kb

input:

output:

result:

ok 10000 lines

Test #46:

score: 0

Accepted

time: 21ms

memory: 3544kb

input:

10000 10000
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

output:

result:

ok 10000 lines

Test #47:

score: 0

Accepted

time: 0ms

memory: 3372kb

input:

1 10
0

output:

result:

ok single line: '0'

Test #48:

score: 0

Accepted

time: 1ms

memory: 3308kb

input:

output:

result:

ok 5 lines