-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjune4.cpp
More file actions
51 lines (51 loc) · 680 Bytes
/
june4.cpp
File metadata and controls
51 lines (51 loc) · 680 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include<iostream>
#include<algorithm>
#define ll long long int
#define s 1000000007
using namespace std;
int main()
{
ll a[100000],b[100000],c[100000];
ll no,n,m,k,i,j,p,s2,s3,s1,s4,q;
cin>>no;
while(no--)
{
cin>>n>>m>>k;s1=0,s3=0;
for(i=0;i<n;i++){
cin>>a[i];
s1+=a[i];}
for(i=0;i<m;i++)
cin>>b[i];
for(i=0;i<k;i++){
cin>>c[i];
s3+=c[i];
}
s4=0;
sort(a,a+n);
sort(b,b+m);
sort(c,c+k);
for(j=0;j<m;j++)
{
for(i=0;i<n;i++)
{
if(a[i]>b[j])
s1=s1-a[i];
else
break;
}
p=n-i;
for(i=0;i<k;i++)
{
if(c[i]>b[j])
s3=s3-c[i];
else
break;
}
q=k-i;
s2=(((q*b[j])%s*(s1%s))%s+((s1%s)*(s3%s))%s+((p*b[j])%s*(s3%s))%s+((q*p)%s *((b[j]*b[j])%s))%s)%s;
s4+=s2;
}
cout<<s4%s<<"\n";
}
return 0;
}