-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsumfour.cpp
executable file
·79 lines (61 loc) · 1.45 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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
vector<int> X;
vector<int> Y;
void generate_sum(vector<int> first, vector<int> second, int flag)
{
for(int i = 0; i < first.size(); i++)
{
for(int j = 0; j < second.size(); j++)
{
int sum = first[i] + second[j];
if(flag)
X.push_back(sum);
else
Y.push_back(sum);
}
}
}
int get_solution(vector<int> A, vector<int> B, vector<int> C, vector<int> D)
{
generate_sum(A, B, 1);
generate_sum(C, D, 0);
sort(Y.begin(), Y.end());
int sol = 0;
for(int i = 0; i < X.size(); i++)
{
int a = 0 - X[i];
int x = lower_bound(Y.begin(), Y.end(), a) - Y.begin();
int y = upper_bound(Y.begin(), Y.end(), a) - Y.begin();
if(y >= x)
sol += (y - x);
}
return sol;
}
int main()
{
int N, a;
cin >> N;
vector<int> A;
vector<int> B;
vector<int> C;
vector<int> D;
for(int i = 0; i < N; i++)
{
for(int j = 0; j < 4; j++)
{
cin >> a;
if(j == 0)
A.push_back(a);
else if(j == 1)
B.push_back(a);
else if(j == 2)
C.push_back(a);
else
D.push_back(a);
}
}
int sol = get_solution(A, B, C, D);
cout << sol << endl;
}