Submission #1455174


Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define int long long
using namespace std;
typedef long long ll;
const int INF = 1e9;

int N;
int D[101010];
int A[101010], B[101010];
int Asum[101010];

signed main()
{
    cin >> N;
    REP(i,N) cin >> D[i];

    sort(D, D + N);
    REP(i,N) {
        A[i] = N - (lower_bound(D, D + N, 2 * D[i]) - D);
        //cout << A[i] << endl;
        Asum[i] = A[i];
        B[i] = upper_bound(D, D + N, D[i] / 2) - D;
        //cout << B[D[i]] << endl;
    }
    
    for (int i=N-2; i>=0; i--) {
        Asum[i] += Asum[i+1];
    }

    //REP(i,N) cout << Asum[i] << endl;

    int ans = 0;
    for (int i=1; i<N-1; i++) {
        int idx = lower_bound(D, D + N, 2 * D[i]) - D;
        ans += B[i] * Asum[idx];
        ans %= MOD;
    }

    cout << ans << endl;
}

Submission Info

Submission Time
Task B - 難易度
User hiyokko2
Language C++14 (GCC 5.4.1)
Score 100
Code Size 926 Byte
Status AC
Exec Time 49 ms
Memory 3328 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 3
AC × 22
AC × 43
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.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
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 2 ms 384 KB
subtask1_04.txt AC 2 ms 384 KB
subtask1_05.txt AC 2 ms 256 KB
subtask1_06.txt AC 2 ms 384 KB
subtask1_07.txt AC 2 ms 256 KB
subtask1_08.txt AC 2 ms 384 KB
subtask1_09.txt AC 2 ms 384 KB
subtask1_10.txt AC 2 ms 256 KB
subtask1_11.txt AC 2 ms 384 KB
subtask1_12.txt AC 2 ms 384 KB
subtask1_13.txt AC 2 ms 256 KB
subtask1_14.txt AC 2 ms 256 KB
subtask1_15.txt AC 2 ms 384 KB
subtask1_16.txt AC 2 ms 384 KB
subtask1_17.txt AC 2 ms 384 KB
subtask1_18.txt AC 2 ms 384 KB
subtask1_19.txt AC 2 ms 384 KB
subtask2_01.txt AC 15 ms 1152 KB
subtask2_02.txt AC 13 ms 1024 KB
subtask2_03.txt AC 6 ms 640 KB
subtask2_04.txt AC 8 ms 640 KB
subtask2_05.txt AC 37 ms 2688 KB
subtask2_06.txt AC 33 ms 2432 KB
subtask2_07.txt AC 3 ms 384 KB
subtask2_08.txt AC 3 ms 384 KB
subtask2_09.txt AC 39 ms 2816 KB
subtask2_10.txt AC 24 ms 1792 KB
subtask2_11.txt AC 3 ms 384 KB
subtask2_12.txt AC 22 ms 1664 KB
subtask2_13.txt AC 4 ms 512 KB
subtask2_14.txt AC 29 ms 2176 KB
subtask2_15.txt AC 49 ms 3328 KB
subtask2_16.txt AC 47 ms 3328 KB
subtask2_17.txt AC 47 ms 3328 KB
subtask2_18.txt AC 47 ms 3328 KB
subtask2_19.txt AC 48 ms 3328 KB
subtask2_20.txt AC 27 ms 3328 KB
subtask2_21.txt AC 26 ms 3328 KB