Submission #1500409


Source Code Expand

#include <bits/stdc++.h>
#define rep(n) for (int I = 0; (I) < (n); ++(I) )
#define repeat(i, n) for( int i = 0; (i) < (n); ++(i) )
#define repeat_to(i, n) for( int i = 0; (i) <= (n); ++(i) )
#define repeat_from(i, m, n) for( int i = (m); (i) < (n); ++(i) )
#define repeat_from_to(i, m, n) for( int i = (m); (i) <= (n); ++(i) )
#define repeat_from_reverse(i, m, n) for( int i = (n) - 1; (i) >= (m); --(i) )
#define dump(x) cout << " " << #x << "=" << x
#define vdump(v) for(size_t t=0; t<v.size(); ++t){cout << " " << #v << "[" << t << "]=" << v[t];} cout << endl
using namespace std;
using lint = long long;
using ld = long double;

// べき乗の剰余
lint modpow(lint x, lint y, lint m) {
    if (y == 0) return 1;
    lint res = modpow(x, y / 2, m);
    return res * res % m * (y & 1 ? x : 1) % m;
}

int main(void) {
    int n; cin >> n;
    vector<int> a(n);
    repeat(i, n) cin >> a[i];
    if(a[0] != 0) { cout << 0 << endl; return 0; }
    
    sort(a.begin(), a.end());
    if(a[1] == 0) { cout << 0 << endl; return 0; }
    
    // d[i] = j ... 頂点からの距離がiであるような頂点がj個
    int m = a[n-1]; // max distance
    vector<int> d(m+1);
    repeat_from_to(i, 0, m) {
        auto l = lower_bound(a.begin(), a.end(), i);
        auto u = upper_bound(a.begin(), a.end(), i);
        d[i] = distance(l, u);
        if (d[i] == 0) { cout << 0 << endl; return 0; }
    }
    
    const int MOD = 1e9 + 7;
    lint ans = 1;
    repeat_from_to(i, 0, m) {
        lint y = d[i] * (d[i] - 1) / 2;
        ans *= modpow(2, y, MOD);
        ans %= MOD;
    }
    
    repeat_from_to(i, 0, m-1) {
        lint x = modpow(2, d[i], MOD) - 1;
        x %= MOD;
        ans *= modpow(x, d[i+1], MOD);
        ans %= MOD;
    }
    cout << ans << endl;
    return 0;
}
        

Submission Info

Submission Time
Task B - 最短路問題
User maphylageo
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1854 Byte
Status WA
Exec Time 51 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 4
AC × 42
WA × 4
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 1 ms 256 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 AC 1 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 1 ms 256 KB
test_10.txt AC 1 ms 256 KB
test_11.txt WA 18 ms 640 KB
test_12.txt WA 18 ms 640 KB
test_13.txt WA 18 ms 640 KB
test_14.txt AC 18 ms 640 KB
test_15.txt AC 18 ms 640 KB
test_16.txt AC 18 ms 640 KB
test_17.txt AC 19 ms 640 KB
test_18.txt AC 19 ms 640 KB
test_19.txt AC 19 ms 640 KB
test_20.txt AC 21 ms 640 KB
test_21.txt AC 22 ms 640 KB
test_22.txt AC 23 ms 640 KB
test_23.txt AC 27 ms 640 KB
test_24.txt AC 28 ms 640 KB
test_25.txt AC 43 ms 768 KB
test_26.txt AC 51 ms 1024 KB
test_27.txt AC 51 ms 1024 KB
test_28.txt AC 44 ms 768 KB
test_29.txt AC 28 ms 640 KB
test_30.txt AC 27 ms 640 KB
test_31.txt AC 1 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 1 ms 256 KB
test_34.txt WA 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 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 AC 1 ms 256 KB
test_41.txt AC 1 ms 256 KB
test_42.txt AC 1 ms 256 KB