E - Lining Up AtCoder - 2271

最新推荐文章于 2024-06-19 11:21:09 发布

原创最新推荐文章于 2024-06-19 11:21:09 发布 · 504 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

思维专栏收录该内容

45 篇文章

订阅专栏

本文介绍了一种通过报告中给出的绝对差值来确定人们昨天站位顺序的方法，并提供了具体的编程实现，包括输入输出格式、约束条件及样例。文章讨论了如何验证报告的一致性并计算可能的排列数。

Problem Statement

There are N people, conveniently numbered 1through N. They were standing in a row yesterday, but now they are unsure of the order in which they were standing. However, each person remembered the following fact: the absolute difference of the number of the people who were standing to the left of that person, and the number of the people who were standing to the right of that person. According to their reports, the difference above for person i is A_i.

Based on these reports, find the number of the possible orders in which they were standing. Since it can be extremely large, print the answer modulo 10⁹+7. Note that the reports may be incorrect and thus there may be no consistent order. In such a case, print 0.

Constraints

1≦N≦10⁵
0≦A_i≦N−1

Input

The input is given from Standard Input in the following format:

N
A₁ A₂ … A_N

Output

Print the number of the possible orders in which they were standing, modulo 10⁹+7.

Sample Input 1

5
2 4 4 0 2

Sample Output 1

There are four possible orders, as follows:

2,1,4,5,3
2,5,4,1,3
3,1,4,5,2
3,5,4,1,2

Sample Input 2

7
6 4 0 2 4 0 2

Sample Output 2

Any order would be inconsistent with the reports, thus the answer is 0.

Sample Input 3

8
7 5 1 1 7 3 5 3

Sample Output 3

做题时极容易忽略情况，要认真考虑，而且最后输出要分情况。

AC:

#include<stdio.h>

int mod=1000000007;
long long fun(int a,int b,int mod)
{
long long d=1,t=a;
while(b)
{
if(b&1)
d=(d*t)%mod;
b/=2;
t=(t*t)%mod;
}
return d;
}

int main()
{
int n,i,f;
long long sum;
int a[100005],m[100000];
scanf("%d",&n);
f=0;
for(i=0;i<n;i++)
{
m[i]=0;
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
m[a[i]]++;
if(n%2==1)
{
if(m[0]!=1)
f=1;
for(i=2;i<n;i+=2)
if(m[i]!=2)
f=1;
}
else
{
for(i=1;i<n;i+=2)
if(m[i]!=2)
f=1;

}
sum=fun(2,n/2,mod);
if(n%2)
{
if(f)
printf("0\n");
else
printf("%lld\n",sum);
}
else
{
if(f)
printf("0\n");
else
printf("%lld\n",sum);
}
return 0;
}