Submission #1240546
Source Code Expand
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
// Problem Specific Parameter:
int a[100010];
int b[100010];
const ll mod=1000000007LL;
int main(void){
int n;
cin >> n;
rep(i,n){
cin >> a[i];
int l=i,r=n-1-i;
b[i]=abs(r-l);
}
sort(a,a+n);
sort(b,b+n);
bool zero=false;
rep(i,n) if(a[i]!=b[i]) zero=true;
if(zero){
puts("0");
return 0;
}
ll num=n/2;
ll ans=1LL;
rep(loop,num) ans=2LL*ans%mod;
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Lining Up |
User |
Hec |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
1603 Byte |
Status |
AC |
Exec Time |
50 ms |
Memory |
1024 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_invalid_01.txt, subtask_1_invalid_02.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_max_valid_01.txt, subtask_1_max_valid_02.txt, subtask_1_min_valid_01.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_valid_01.txt, subtask_1_valid_02.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
9 ms |
764 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
subtask_1_invalid_01.txt |
AC |
42 ms |
896 KB |
subtask_1_invalid_02.txt |
AC |
9 ms |
384 KB |
subtask_1_max_01.txt |
AC |
50 ms |
1024 KB |
subtask_1_max_02.txt |
AC |
49 ms |
1024 KB |
subtask_1_max_valid_01.txt |
AC |
50 ms |
1024 KB |
subtask_1_max_valid_02.txt |
AC |
49 ms |
1024 KB |
subtask_1_min_valid_01.txt |
AC |
1 ms |
256 KB |
subtask_1_rand_01.txt |
AC |
30 ms |
768 KB |
subtask_1_rand_02.txt |
AC |
45 ms |
1024 KB |
subtask_1_valid_01.txt |
AC |
27 ms |
640 KB |
subtask_1_valid_02.txt |
AC |
10 ms |
384 KB |