Submission #2245596
Source Code Expand
#include <bits/stdc++.h> #define int long long #define N 100005 using namespace std; const int mod = 1e9 + 7; int n, A[N*2], L[N*2], R[N*2], S[N*2]; signed main(){ cin>>n; for(int i=0;i<n;i++){ int a; cin>>a; A[a]++; } for(int i=1;i<N;i++) L[i] = L[i-1] + A[i]; for(int i=N-2;i>=0;i--) R[i] = R[i+1] + A[i]; for(int i=1;i<N;i++) if( A[i] ) S[i] = R[ i * 2 ]; for(int i=N-2;i>=0;i--) S[i] += S[i+1]; int ans = 0; for(int i=1;i<N;i++){ ans += ( L[ i / 2 ] % mod ) * ( S[ i * 2 ] % mod ); ans %= mod; } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 難易度 |
User | Gacho_0716 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 661 Byte |
Status | WA |
Exec Time | 31 ms |
Memory | 5632 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 4 ms | 5632 KB |
sample_02.txt | AC | 4 ms | 5632 KB |
sample_03.txt | AC | 4 ms | 5632 KB |
subtask1_01.txt | WA | 4 ms | 5632 KB |
subtask1_02.txt | WA | 4 ms | 5632 KB |
subtask1_03.txt | WA | 5 ms | 5632 KB |
subtask1_04.txt | WA | 4 ms | 5632 KB |
subtask1_05.txt | WA | 4 ms | 5632 KB |
subtask1_06.txt | WA | 5 ms | 5632 KB |
subtask1_07.txt | WA | 4 ms | 5632 KB |
subtask1_08.txt | WA | 5 ms | 5632 KB |
subtask1_09.txt | WA | 5 ms | 5632 KB |
subtask1_10.txt | WA | 4 ms | 5632 KB |
subtask1_11.txt | WA | 5 ms | 5632 KB |
subtask1_12.txt | WA | 5 ms | 5632 KB |
subtask1_13.txt | WA | 4 ms | 5632 KB |
subtask1_14.txt | WA | 4 ms | 5632 KB |
subtask1_15.txt | WA | 5 ms | 5632 KB |
subtask1_16.txt | WA | 5 ms | 5632 KB |
subtask1_17.txt | WA | 5 ms | 5632 KB |
subtask1_18.txt | WA | 5 ms | 5632 KB |
subtask1_19.txt | WA | 5 ms | 5632 KB |
subtask2_01.txt | WA | 12 ms | 5632 KB |
subtask2_02.txt | WA | 11 ms | 5632 KB |
subtask2_03.txt | WA | 7 ms | 5632 KB |
subtask2_04.txt | WA | 8 ms | 5632 KB |
subtask2_05.txt | WA | 25 ms | 5632 KB |
subtask2_06.txt | WA | 23 ms | 5632 KB |
subtask2_07.txt | WA | 5 ms | 5632 KB |
subtask2_08.txt | WA | 5 ms | 5632 KB |
subtask2_09.txt | WA | 27 ms | 5632 KB |
subtask2_10.txt | WA | 18 ms | 5632 KB |
subtask2_11.txt | WA | 5 ms | 5632 KB |
subtask2_12.txt | WA | 17 ms | 5632 KB |
subtask2_13.txt | WA | 6 ms | 5632 KB |
subtask2_14.txt | WA | 21 ms | 5632 KB |
subtask2_15.txt | WA | 31 ms | 5632 KB |
subtask2_16.txt | WA | 31 ms | 5632 KB |
subtask2_17.txt | WA | 31 ms | 5632 KB |
subtask2_18.txt | WA | 31 ms | 5632 KB |
subtask2_19.txt | WA | 31 ms | 5632 KB |
subtask2_20.txt | WA | 19 ms | 5632 KB |
subtask2_21.txt | AC | 19 ms | 5632 KB |