Submission #1152854
Source Code Expand
#include<iostream> #include<algorithm> using namespace std; long M=1e9+7,d[1<<17],a[1<<17],x[1<<17]; main() { int n;cin>>n; for(int i=0;i<n;i++)cin>>d[i]; sort(d,d+n); long b=0; for(int i=0;i<n;i++) { for(;b<n&&d[i]*2>d[b];b++); a[i]=n-b;x[i]=b; } for(int i=n-1;i;i--)a[i-1]+=a[i]; //for(int i=0;i<30;i++)cout<<i<<" : "<<a[i]<<endl; b=0;long ans=0; for(int i=0;i<n;i++) { for(;d[b]*2<=d[i];b++); ans=(ans+b*a[x[i]]%M)%M; } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 難易度 |
User | kotatsugame |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 489 Byte |
Status | AC |
Exec Time | 47 ms |
Memory | 2560 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | 50 / 50 | ||||||
Status |
|
|
|
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 | 256 KB |
subtask1_04.txt | AC | 2 ms | 256 KB |
subtask1_05.txt | AC | 2 ms | 256 KB |
subtask1_06.txt | AC | 2 ms | 256 KB |
subtask1_07.txt | AC | 2 ms | 256 KB |
subtask1_08.txt | AC | 2 ms | 256 KB |
subtask1_09.txt | AC | 2 ms | 256 KB |
subtask1_10.txt | AC | 2 ms | 256 KB |
subtask1_11.txt | AC | 2 ms | 256 KB |
subtask1_12.txt | AC | 2 ms | 256 KB |
subtask1_13.txt | AC | 2 ms | 256 KB |
subtask1_14.txt | AC | 2 ms | 256 KB |
subtask1_15.txt | AC | 3 ms | 384 KB |
subtask1_16.txt | AC | 3 ms | 384 KB |
subtask1_17.txt | AC | 3 ms | 384 KB |
subtask1_18.txt | AC | 3 ms | 384 KB |
subtask1_19.txt | AC | 3 ms | 384 KB |
subtask2_01.txt | AC | 16 ms | 1024 KB |
subtask2_02.txt | AC | 12 ms | 896 KB |
subtask2_03.txt | AC | 7 ms | 512 KB |
subtask2_04.txt | AC | 7 ms | 512 KB |
subtask2_05.txt | AC | 36 ms | 2048 KB |
subtask2_06.txt | AC | 32 ms | 1920 KB |
subtask2_07.txt | AC | 3 ms | 384 KB |
subtask2_08.txt | AC | 3 ms | 384 KB |
subtask2_09.txt | AC | 38 ms | 2176 KB |
subtask2_10.txt | AC | 23 ms | 1408 KB |
subtask2_11.txt | AC | 3 ms | 384 KB |
subtask2_12.txt | AC | 22 ms | 1280 KB |
subtask2_13.txt | AC | 4 ms | 384 KB |
subtask2_14.txt | AC | 28 ms | 1664 KB |
subtask2_15.txt | AC | 47 ms | 2560 KB |
subtask2_16.txt | AC | 46 ms | 2560 KB |
subtask2_17.txt | AC | 46 ms | 2560 KB |
subtask2_18.txt | AC | 45 ms | 2560 KB |
subtask2_19.txt | AC | 47 ms | 2560 KB |
subtask2_20.txt | AC | 23 ms | 2560 KB |
subtask2_21.txt | AC | 23 ms | 2560 KB |