Submission #1884249


Source Code Expand

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> mat;
#define FOR(i,a,b) for(int (i)=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define mset(a,x) memset(a,x,sizeof(a))
#define FASTIO() cin.tie(0),ios::sync_with_stdio(0);
#define dbg(x) cout<<#x<<": "<<x<<endl

const int mod = (int)1e9 + 7;
ll pows[114514]; // 2^i % mod

int main() {
    mset(pows, 0);
    FASTIO();
    int n; cin >> n;
    vector<int> a(n);
    for (int& i : a) cin >> i;

    bool ng = false;
    rep(i, n) ng |= (i == 0 && a[i] != 0) | (i != 0 && a[i] == 0);
    if (ng) {
        cout << 0 << endl;
        return 0;
    }
    sort(ALL(a));
    // [0,n]
    pows[0] = 1;
    rep(i, n) pows[i + 1] = (2 * pows[i]) % mod;

    static int k[114514] = {0};
    k[0] = 1;
    ll ans = 1;
    FOR(i, 1, n) {
        ll x = pows[k[a[i] - 1]] - 1;
        ll y = pows[k[a[i]]];
        ans *= x * y;
        ans %= mod;
        k[a[i]]++;
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task B - 最短路問題
User fushime2
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1144 Byte
Status WA
Exec Time 17 ms
Memory 1920 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 4
AC × 31
WA × 15
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 2 ms 1152 KB
sample_02.txt AC 2 ms 1152 KB
sample_03.txt AC 2 ms 1152 KB
sample_04.txt AC 2 ms 1152 KB
test_01.txt AC 2 ms 1152 KB
test_02.txt AC 2 ms 1152 KB
test_03.txt AC 2 ms 1152 KB
test_04.txt AC 2 ms 1152 KB
test_05.txt AC 2 ms 1152 KB
test_06.txt WA 2 ms 1152 KB
test_07.txt WA 2 ms 1152 KB
test_08.txt AC 2 ms 1152 KB
test_09.txt AC 2 ms 1152 KB
test_10.txt AC 2 ms 1152 KB
test_11.txt AC 10 ms 1536 KB
test_12.txt WA 10 ms 1536 KB
test_13.txt WA 10 ms 1536 KB
test_14.txt WA 10 ms 1536 KB
test_15.txt WA 10 ms 1536 KB
test_16.txt WA 10 ms 1536 KB
test_17.txt WA 10 ms 1536 KB
test_18.txt WA 10 ms 1536 KB
test_19.txt WA 15 ms 1536 KB
test_20.txt WA 12 ms 1536 KB
test_21.txt WA 12 ms 1536 KB
test_22.txt WA 12 ms 1536 KB
test_23.txt WA 14 ms 1536 KB
test_24.txt WA 14 ms 1536 KB
test_25.txt AC 17 ms 1664 KB
test_26.txt AC 17 ms 1920 KB
test_27.txt AC 17 ms 1920 KB
test_28.txt AC 17 ms 1664 KB
test_29.txt AC 10 ms 1536 KB
test_30.txt AC 8 ms 1536 KB
test_31.txt AC 2 ms 1152 KB
test_32.txt AC 2 ms 1152 KB
test_33.txt AC 2 ms 1152 KB
test_34.txt AC 2 ms 1152 KB
test_35.txt AC 2 ms 1152 KB
test_36.txt AC 2 ms 1152 KB
test_37.txt AC 2 ms 1152 KB
test_38.txt AC 2 ms 1152 KB
test_39.txt AC 2 ms 1152 KB
test_40.txt AC 2 ms 1152 KB
test_41.txt AC 2 ms 1152 KB
test_42.txt AC 2 ms 1152 KB