Submission #3620542
Source Code Expand
#include "bits/stdc++.h" #define rep(i,a,n) for(int i = a;i < n;i++) #define MOD 1000000007 typedef unsigned long long ull; typedef long long ll; using namespace std; int main(){ ll n,cnt = 1; cin >> n; ll a[n],b[n]; rep(i,0,n){ cin >> a[i]; b[i] = abs(n-2*i-1); } sort(a,a+n); sort(b,b+n); rep(i,0,n){ if(a[i] != b[i]){ cout << 0 << endl; return 0; } } rep(i,0,n/2){ cnt *= 2; cnt %= MOD; } cout << cnt << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | new_textfile |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 503 Byte |
Status | AC |
Exec Time | 43 ms |
Memory | 1792 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 | 2 ms | 256 KB |
sample_02.txt | AC | 2 ms | 256 KB |
sample_03.txt | AC | 2 ms | 256 KB |
subtask_1_invalid_01.txt | AC | 36 ms | 1536 KB |
subtask_1_invalid_02.txt | AC | 8 ms | 512 KB |
subtask_1_max_01.txt | AC | 43 ms | 1792 KB |
subtask_1_max_02.txt | AC | 43 ms | 1792 KB |
subtask_1_max_valid_01.txt | AC | 43 ms | 1792 KB |
subtask_1_max_valid_02.txt | AC | 43 ms | 1792 KB |
subtask_1_min_valid_01.txt | AC | 1 ms | 256 KB |
subtask_1_rand_01.txt | AC | 27 ms | 1152 KB |
subtask_1_rand_02.txt | AC | 40 ms | 1664 KB |
subtask_1_valid_01.txt | AC | 24 ms | 1152 KB |
subtask_1_valid_02.txt | AC | 9 ms | 512 KB |