-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
114 lines (93 loc) · 3.6 KB
/
Solution.java
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.List;
import java.util.stream.Stream;
import static java.util.stream.Collectors.toList;
/**
* Created on Tue Feb 21 2023
*
* @author Carlos Páez
*/
class Result {
/*
* Complete the 'countApplesAndOranges' function below.
*
* The function accepts following parameters:
* 1. INTEGER s
* 2. INTEGER t
* 3. INTEGER a
* 4. INTEGER b
* 5. INTEGER_ARRAY apples
* 6. INTEGER_ARRAY oranges
*/
/**
* It takes in the house's starting and ending points, the apple and orange
* trees' locations, and
* the distances the apples and oranges fell from their respective trees. It
* then prints out the
* number of apples and oranges that landed on the house
*
* @param s starting point of Sam's house location.
* @param t integer, denoting the number of apples that fell on Sam's
* house
* @param a starting point of Sam's house location.
* @param b starting point of Sam's house location.
* @param apples an array of integers representing the distances that each
* apple falls from point
* a.
* @param oranges -2, 2, 1
*/
public static void countApplesAndOranges(int s, int t, int a, int b, List<Integer> apples, List<Integer> oranges) {
final int MIN_LIMIT = -100000;
final int MAX_LIMIT = 100000;
for (int param : new int[] { s, t, a, b }) {
if (param < 1 || param > MAX_LIMIT) {
System.out.println("Error");
return;
}
}
int validApples = 0;
int validOranges = 0;
for (int apple : apples) {
if (apple < MIN_LIMIT || apple > MAX_LIMIT) {
continue;
}
if (s <= (apple + a) && (apple + a) <= t) {
validApples++;
}
}
for (int orange : oranges) {
if (orange < MIN_LIMIT || orange > MAX_LIMIT) {
continue;
}
if (s <= (orange + b) && (orange + b) <= t) {
validOranges++;
}
}
System.out.println(validApples);
System.out.println(validOranges);
}
}
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
String[] firstMultipleInput = bufferedReader.readLine().replaceAll("\\s+$", "").split(" ");
int s = Integer.parseInt(firstMultipleInput[0]);
int t = Integer.parseInt(firstMultipleInput[1]);
String[] secondMultipleInput = bufferedReader.readLine().replaceAll("\\s+$", "").split(" ");
int a = Integer.parseInt(secondMultipleInput[0]);
int b = Integer.parseInt(secondMultipleInput[1]);
String[] thirdMultipleInput = bufferedReader.readLine().replaceAll("\\s+$", "").split(" ");
int m = Integer.parseInt(thirdMultipleInput[0]);
int n = Integer.parseInt(thirdMultipleInput[1]);
List<Integer> apples = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
List<Integer> oranges = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
Result.countApplesAndOranges(s, t, a, b, apples, oranges);
bufferedReader.close();
}
}