Submission #1650285
Source Code Expand
// // Created by Akifumi Ohata on 2017/10/04. // #include<iostream> #include <vector> #include <numeric> #include <math.h> #include <cmath> #include <algorithm> #include <iomanip> using namespace std; using ll = long long int; int main() { ios::sync_with_stdio(false); int N, M; ll MOD=1000000007; cin >> N ; std::vector<int> RankArrays(N,0); for(int i=0;i<N ;i++){ int tmp; cin >> tmp; RankArrays[tmp]++; } std::vector<ll> AnsArray(N,0); AnsArray[0]=1; int k=0; for(k=0;k<N;k++){ int ranknum = RankArrays[k]; if(k==0){ if(ranknum!=1){ cout<< 0 << endl; return 0; } continue; }else{ if(ranknum==0){ goto END; } } ll A= (static_cast<ll>(pow((-1 + pow(2, RankArrays[k - 1])), RankArrays[k])))%MOD; ll B= (static_cast<ll>(pow(2, (RankArrays[k] - 1)*RankArrays[k]/2)))%MOD; AnsArray[k]=(AnsArray[k-1]*A*B)%MOD; } END: /* for(const auto &p : AnsArray){ cout<< p << endl; }*/ cout << AnsArray[k-1] << endl ; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 最短路問題 |
User | aki_oht |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 1285 Byte |
Status | WA |
Exec Time | 83 ms |
Memory | 1536 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.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 |
sample_04.txt | AC | 2 ms | 384 KB |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | AC | 1 ms | 256 KB |
test_04.txt | AC | 1 ms | 256 KB |
test_05.txt | WA | 2 ms | 256 KB |
test_06.txt | WA | 2 ms | 256 KB |
test_07.txt | WA | 2 ms | 256 KB |
test_08.txt | AC | 2 ms | 256 KB |
test_09.txt | AC | 2 ms | 256 KB |
test_10.txt | AC | 2 ms | 256 KB |
test_11.txt | WA | 47 ms | 1408 KB |
test_12.txt | WA | 47 ms | 1408 KB |
test_13.txt | WA | 47 ms | 1408 KB |
test_14.txt | WA | 48 ms | 1408 KB |
test_15.txt | WA | 48 ms | 1408 KB |
test_16.txt | WA | 47 ms | 1408 KB |
test_17.txt | WA | 48 ms | 1408 KB |
test_18.txt | WA | 48 ms | 1408 KB |
test_19.txt | WA | 49 ms | 1408 KB |
test_20.txt | WA | 53 ms | 1408 KB |
test_21.txt | WA | 55 ms | 1408 KB |
test_22.txt | WA | 56 ms | 1408 KB |
test_23.txt | WA | 62 ms | 1408 KB |
test_24.txt | WA | 64 ms | 1408 KB |
test_25.txt | WA | 81 ms | 1536 KB |
test_26.txt | AC | 83 ms | 1408 KB |
test_27.txt | AC | 82 ms | 1408 KB |
test_28.txt | WA | 79 ms | 1408 KB |
test_29.txt | AC | 78 ms | 1408 KB |
test_30.txt | AC | 63 ms | 1408 KB |
test_31.txt | WA | 1 ms | 256 KB |
test_32.txt | AC | 1 ms | 256 KB |
test_33.txt | WA | 1 ms | 256 KB |
test_34.txt | AC | 1 ms | 256 KB |
test_35.txt | AC | 1 ms | 256 KB |
test_36.txt | WA | 1 ms | 256 KB |
test_37.txt | AC | 1 ms | 256 KB |
test_38.txt | AC | 1 ms | 256 KB |
test_39.txt | AC | 1 ms | 256 KB |
test_40.txt | WA | 1 ms | 256 KB |
test_41.txt | AC | 1 ms | 256 KB |
test_42.txt | WA | 1 ms | 256 KB |