QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#572709#9353. Interesting Permutationleo2005AC ✓108ms3852kbC++14846b2024-09-18 16:02:342024-09-18 16:02:35

Judging History

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

  • [2024-09-18 16:02:35]
  • 评测
  • 测评结果:AC
  • 用时:108ms
  • 内存:3852kb
  • [2024-09-18 16:02:34]
  • 提交

answer

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#include<sstream>
#include<queue>
#include<stack>
using namespace std;
#define ll long long
const int mod=1e9+7;
int n;
void solve()
{
    ll p,q,flag=1;
    scanf("%lld",&n);
    scanf("%lld",&p);//第一个数p下一个数q
    if(p!=0)flag=0;
    ll ans=1,cnt=0;//ans为总数,cnt为中间数
   for(int i=0;i<n-1;i++)
      {scanf("%lld",&q);
       if(q<p||q>=n)flag=0;
       if(q>p)//1
       {cnt=(cnt+q-p-1)%mod;
       ans=(ans*2)%mod;}
          else if(q==p)//2
            {ans=(ans*cnt)%mod;
            cnt=(cnt-1)%mod;}
            p=q;
      }
    if(flag)printf("%lld\n",ans);
       else printf("0\n");
}
int main()
{
    int t;
   scanf("%d",&t);
    while(t--)
    {
        solve();
    }
}


这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3852kb

input:

3
3
0 2 2
3
0 1 2
3
0 2 3

output:

2
4
0

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 79ms
memory: 3796kb

input:

10039
14
5 6 7 8 9 10 11 12 13 13 13 13 13 13
14
0 5 6 7 8 9 10 11 12 13 14 14 14 14
1
1
14
0 5 4 8 9 10 11 12 13 13 13 13 13 13
45
0 1 1 2 2 3 5 5 6 6 8 9 11 13 15 17 18 18 20 22 22 24 26 26 26 26 27 27 27 28 30 32 32 33 34 34 34 36 36 38 38 38 39 39 44
24
0 2 3 5 7 9 9 10 11 12 13 14 14 14 14 15 1...

output:

0
0
0
0
0
0
24576
0
0
0
0
0
658159182
0
805306368
8
572589350
12288
2
0
981283070
0
0
2
0
0
0
0
4423680
0
0
14155776
16
0
768
0
0
0
855189487
0
2
0
0
0
0
2
0
2
797370259
0
0
0
0
4
0
0
0
301989888
0
0
0
0
0
0
0
0
0
0
0
0
0
2
0
0
0
0
192
0
0
12288
0
0
2
8
0
0
495514526
0
0
955131071
768
0
0
147456
0
0...

result:

ok 10039 lines

Test #3:

score: 0
Accepted
time: 108ms
memory: 3844kb

input:

20
100000
0 1 2 3 5 6 7 9 10 10 12 12 12 13 14 15 17 17 18 19 21 22 24 26 28 28 28 28 29 31 32 34 35 36 38 39 39 39 41 41 42 44 45 47 48 49 51 53 54 56 58 58 58 60 62 62 64 64 64 66 66 66 66 68 70 70 71 72 72 74 74 75 76 77 77 78 80 80 82 82 84 85 86 86 88 88 89 90 91 91 93 93 95 97 98 100 101 103 1...

output:

202795881
940225306
406525679
536765675
729062616
366047380
66289678
199278830
570456350
993317415
17778389
674797620
787821942
841428534
632185280
579006079
822641126
664256526
482813708
821188194

result:

ok 20 lines

Test #4:

score: 0
Accepted
time: 0ms
memory: 3808kb

input:

1
14
5 6 7 8 9 10 11 12 13 13 13 13 13 13

output:

0

result:

ok single line: '0'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3848kb

input:

1
14
0 5 6 7 8 9 10 11 12 13 14 14 14 14

output:

0

result:

ok single line: '0'

Test #6:

score: 0
Accepted
time: 1ms
memory: 3776kb

input:

1
1
1

output:

0

result:

ok single line: '0'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3784kb

input:

1
14
0 5 4 8 9 10 11 12 13 13 13 13 13 13

output:

0

result:

ok single line: '0'

Extra Test:

score: 0
Extra Test Passed