-
Notifications
You must be signed in to change notification settings - Fork 13
/
SUMFOUR.cpp
63 lines (40 loc) · 1.12 KB
/
SUMFOUR.cpp
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
52
53
54
55
56
57
58
59
60
61
62
63
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int v[4000*4000],v1[4000*4000];
int main()
{
int n;
scanf("%d",&n);
int a[4000],b[4000],c[4000],d[4000];
for(int i=0;i<n;i++)
scanf("%d%d%d%d",&a[i],&b[i],&c[i],&d[i]);
int cnt=0;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
{
v[cnt]=a[i]+b[j];
v1[cnt++]=c[i]+d[j];
}
sort(v,v+cnt);
sort(v1,v1+cnt);
long long int ans=0;
int i=0,j=cnt-1;
int freq1=1,freq2=1;
while(i<cnt && j>=0)
{
long long sum=v[i]+v1[j];
while(i+1<cnt && v[i]==v[i+1]) freq1++, i++;
while(j-1>=0 && v1[j]==v1[j-1]) freq2++ , j-- ;
if(sum==0)
ans+=(long long)freq1*(long long)freq2,i++,j--,freq1=1,freq2=1;
else if(sum>0)
j-- , freq2=1;
else i++, freq1=1;;
}
printf("%lld\n",ans);
system ("pause");
return 0;
}