Submission #8000919
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define REP(i,s,n) for(int i=(s);i<(n);i++) #define repr(i,n) for(int i=n-1;i>=0;i--) #define REPR(i,s,n) for(int i=(s);i>=(n);i--) #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() #define Eunique(v) v.erase(unique(all(v)),v.end()) #define pvec(v) rep(i,v.size()){cout << v[i] << " ";};cout<<endl; #define pb push_back #define pf push_front #define mod 1e9+7 #define m_p make_pair typedef vector<int> vi; typedef vector<string> vs; typedef long long ll; typedef vector<ll> vll; typedef pair<int,int> pii; typedef vector<pii> vpii; typedef pair<ll,ll> pll; typedef vector<pll> vpll; typedef vector<vector<int>> vvi; typedef vector<vector<ll>> vvll; const double pi = acos(-1.0); ll gcd(ll x, ll y) { return (y == 0) ? x : gcd(y, x % y); } ll lcm(ll x, ll y) { return x * y / gcd(x, y); } bool IsPrime(int num) { if (num < 2) return false; else if (num == 2) return true; else if (num % 2 == 0) return false; double sqrtNum = sqrt(num); for (int i = 3; i <= sqrtNum; i += 2) { if (num % i == 0) { return false; } } return true; } int main() { ll n; bool b=true; map<ll,ll> mp; cin >> n; vll a(n); rep(i,n){ cin >> a[i]; mp[a[i]]++; } if(n%2==0){ rep(i,n/2){ if(mp[i*2+1]!=2) b=false; } } else{ if(mp[0]!=1) b=false; rep(i,n/2){ if(mp[(i+1)*2]!=2) b=false; } } ll ans=pow(2,n/2); cout << (b?ans%1000000007:0) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | mitsui321 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1724 Byte |
Status | WA |
Exec Time | 64 ms |
Memory | 6144 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_invalid_01.txt | AC | 49 ms | 3584 KB |
subtask_1_invalid_02.txt | AC | 9 ms | 896 KB |
subtask_1_max_01.txt | AC | 64 ms | 6144 KB |
subtask_1_max_02.txt | AC | 64 ms | 6144 KB |
subtask_1_max_valid_01.txt | WA | 59 ms | 4096 KB |
subtask_1_max_valid_02.txt | WA | 59 ms | 4096 KB |
subtask_1_min_valid_01.txt | AC | 1 ms | 256 KB |
subtask_1_rand_01.txt | AC | 37 ms | 3840 KB |
subtask_1_rand_02.txt | AC | 59 ms | 5632 KB |
subtask_1_valid_01.txt | WA | 31 ms | 2432 KB |
subtask_1_valid_02.txt | WA | 11 ms | 1024 KB |