Submission #2242921


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i,a) for(int i=0;i<(a);i++)
#define MOD 1000000007

const int NMAX=100000;
ll A[NMAX],B[NMAX],D[NMAX],sumA[NMAX+1];

int main(){
  int N; cin>>N;
  rep(i,N) cin>>D[i];
  sort(D,D+N);
  rep(i,N){
    A[i]=N-(lower_bound(D,D+N,D[i]*2)-D);
    int x=lower_bound(D,D+N,D[i]/2+1)-D;
    while(D[x]*2>D[i]) x--;
    x=max(0,x);
    B[i]=x+(D[0]*2<=D[i]?1:0);
    cout<<A[i]<<" "<<B[i]<<endl;
  }
  rep(i,N) sumA[N-1-i]=sumA[N-i]+A[N-1-i];
  ll ans=0;
  rep(i,N){
    int ind=lower_bound(D,D+N,D[i]*2)-D;
    (ans+=sumA[ind]*B[i])%=MOD;
  }
  cout<<ans<<endl;
  return 0;
}

Submission Info

Submission Time
Task B - 難易度
User misosoup
Language C++14 (GCC 5.4.1)
Score 0
Code Size 710 Byte
Status WA
Exec Time 218 ms
Memory 4352 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 50 0 / 50
Status
WA × 3
WA × 22
WA × 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 WA 1 ms 256 KB
sample_02.txt WA 1 ms 256 KB
sample_03.txt WA 1 ms 256 KB
subtask1_01.txt WA 1 ms 256 KB
subtask1_02.txt WA 2 ms 256 KB
subtask1_03.txt WA 7 ms 384 KB
subtask1_04.txt WA 6 ms 384 KB
subtask1_05.txt WA 5 ms 384 KB
subtask1_06.txt WA 7 ms 384 KB
subtask1_07.txt WA 5 ms 256 KB
subtask1_08.txt WA 7 ms 384 KB
subtask1_09.txt WA 7 ms 384 KB
subtask1_10.txt WA 4 ms 256 KB
subtask1_11.txt WA 6 ms 384 KB
subtask1_12.txt WA 7 ms 384 KB
subtask1_13.txt WA 4 ms 256 KB
subtask1_14.txt WA 5 ms 384 KB
subtask1_15.txt WA 8 ms 384 KB
subtask1_16.txt WA 7 ms 384 KB
subtask1_17.txt WA 7 ms 384 KB
subtask1_18.txt WA 7 ms 384 KB
subtask1_19.txt WA 7 ms 384 KB
subtask2_01.txt WA 67 ms 1408 KB
subtask2_02.txt WA 55 ms 1280 KB
subtask2_03.txt WA 26 ms 768 KB
subtask2_04.txt WA 31 ms 768 KB
subtask2_05.txt WA 169 ms 3456 KB
subtask2_06.txt WA 150 ms 3072 KB
subtask2_07.txt WA 10 ms 384 KB
subtask2_08.txt WA 10 ms 384 KB
subtask2_09.txt WA 179 ms 3712 KB
subtask2_10.txt WA 106 ms 2304 KB
subtask2_11.txt WA 12 ms 512 KB
subtask2_12.txt WA 99 ms 2176 KB
subtask2_13.txt WA 16 ms 512 KB
subtask2_14.txt WA 129 ms 2688 KB
subtask2_15.txt WA 211 ms 4352 KB
subtask2_16.txt WA 211 ms 4352 KB
subtask2_17.txt WA 210 ms 4352 KB
subtask2_18.txt WA 218 ms 4352 KB
subtask2_19.txt WA 212 ms 4352 KB
subtask2_20.txt WA 196 ms 4352 KB
subtask2_21.txt WA 191 ms 4096 KB