Submission #1774705
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; int main() { unsigned long long ans=0; int N; cin >> N; int D[N]; for(int i=0; i<N; i++){ cin >> D[i];} sort(D,D+N); // O(nlogn) int E[N]={0}; //D[N]の2倍以上のものの個数 int F[N]={0}; //D[N]の1/2倍以下のもの int k=0; for(int i=0; i<N; i++){ for(; (k<N && D[k]<2*D[i]); k++){} E[i]=N-k; } k=0; for(int i=0; i<N; i++){ for(; (k<N && D[k]<=D[i]/2) ; k++){} F[i]=k; } for(int i=N-E[0]; i<F[N-1]; i++){ for(int j=F[N-1]-1; 2*D[i]<=D[j]; j--){ ans+=(F[i]*E[j])%1000000007; ans%=1000000007; } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 難易度 |
User | monptt |
Language | C++14 (GCC 5.4.1) |
Score | 50 |
Code Size | 675 Byte |
Status | WA |
Exec Time | 2103 ms |
Memory | 1408 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | 0 / 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 | 4 ms | 256 KB |
subtask1_04.txt | AC | 3 ms | 256 KB |
subtask1_05.txt | AC | 3 ms | 256 KB |
subtask1_06.txt | AC | 4 ms | 256 KB |
subtask1_07.txt | AC | 3 ms | 256 KB |
subtask1_08.txt | AC | 4 ms | 256 KB |
subtask1_09.txt | AC | 4 ms | 256 KB |
subtask1_10.txt | AC | 2 ms | 256 KB |
subtask1_11.txt | AC | 3 ms | 256 KB |
subtask1_12.txt | AC | 4 ms | 256 KB |
subtask1_13.txt | AC | 2 ms | 256 KB |
subtask1_14.txt | AC | 3 ms | 256 KB |
subtask1_15.txt | AC | 4 ms | 256 KB |
subtask1_16.txt | AC | 4 ms | 256 KB |
subtask1_17.txt | AC | 5 ms | 256 KB |
subtask1_18.txt | AC | 5 ms | 256 KB |
subtask1_19.txt | AC | 4 ms | 256 KB |
subtask2_01.txt | AC | 219 ms | 640 KB |
subtask2_02.txt | AC | 160 ms | 512 KB |
subtask2_03.txt | AC | 42 ms | 384 KB |
subtask2_04.txt | AC | 52 ms | 384 KB |
subtask2_05.txt | AC | 1460 ms | 1152 KB |
subtask2_06.txt | AC | 1137 ms | 1024 KB |
subtask2_07.txt | AC | 7 ms | 256 KB |
subtask2_08.txt | AC | 7 ms | 256 KB |
subtask2_09.txt | AC | 1631 ms | 1280 KB |
subtask2_10.txt | AC | 597 ms | 768 KB |
subtask2_11.txt | AC | 10 ms | 256 KB |
subtask2_12.txt | AC | 513 ms | 768 KB |
subtask2_13.txt | AC | 16 ms | 384 KB |
subtask2_14.txt | AC | 883 ms | 896 KB |
subtask2_15.txt | TLE | 2103 ms | 1408 KB |
subtask2_16.txt | TLE | 2103 ms | 1408 KB |
subtask2_17.txt | TLE | 2103 ms | 1408 KB |
subtask2_18.txt | TLE | 2103 ms | 1408 KB |
subtask2_19.txt | TLE | 2103 ms | 1408 KB |
subtask2_20.txt | TLE | 2103 ms | 1408 KB |
subtask2_21.txt | WA | 21 ms | 1408 KB |