HackerRank

HackerRank : Apple and Orange (c++)

TIN9 2023. 10. 19.
반응형

HackerRank 링크

https://www.hackerrank.com/challenges/apple-and-orange/problem?isFullScreen=true

Sam's house has an apple tree and an orange tree that yield an abundance of fruit. Using the information given below, determine the number of apples and oranges that land on Sam's house.

In the diagram below:

  • The red region denotes the house, where  is the start point, and  is the endpoint. The apple tree is to the left of the house, and the orange tree is to its right.
  • Assume the trees are located on a single point, where the apple tree is at point , and the orange tree is at point .
  • When a fruit falls from its tree, it lands  units of distance from its tree of origin along the -axis. *A negative value of  means the fruit fell  units to the tree's left, and a positive value of  means it falls  units to the tree's right. *
HackerRank : Apple and Orange (c++) - undefined - HackerRank 링크

Given the value of  for  apples and  oranges, determine how many apples and oranges will fall on Sam's house (i.e., in the inclusive range )?

For example, Sam's house is between  and . The apple tree is located at  and the orange at . There are  apples and  oranges. Apples are thrown  units distance from , and  units distance. Adding each apple distance to the position of the tree, they land at . Oranges land at . One apple and two oranges land in the inclusive range  so we print

1
2

Function Description

Complete the countApplesAndOranges function in the editor below. It should print the number of apples and oranges that land on Sam's house, each on a separate line.

countApplesAndOranges has the following parameter(s):

  • s: integer, starting point of Sam's house location.
  • t: integer, ending location of Sam's house location.
  • a: integer, location of the Apple tree.
  • b: integer, location of the Orange tree.
  • apples: integer array, distances at which each apple falls from the tree.
  • oranges: integer array, distances at which each orange falls from the tree.

Input Format

The first line contains two space-separated integers denoting the respective values of  and .
The second line contains two space-separated integers denoting the respective values of  and .
The third line contains two space-separated integers denoting the respective values of  and .
The fourth line contains  space-separated integers denoting the respective distances that each apple falls from point .
The fifth line contains  space-separated integers denoting the respective distances that each orange falls from point .

Constraints

  •  
  •  
  •  

Output Format

Print two integers on two different lines:

  1. The first integer: the number of apples that fall on Sam's house.
  2. The second integer: the number of oranges that fall on Sam's house.

Sample Input 0

7 11
5 15
3 2
-2 2 1
5 -6

Sample Output 0

1
1

Explanation 0

The first apple falls at position .
The second apple falls at position .
The third apple falls at position .
The first orange falls at position .
The second orange falls at position .
Only one fruit (the second apple) falls within the region between  and , so we print  as our first line of output.
Only the second orange falls within the region between  and , so we print  as our second line of output.

코드 풀이

사과와 오렌지가 나무 주변 랜덤한 위치로 떨어지게 되는데 떨어진 위치가 s, t의 범위 내에 있다면 카운트 해주는 문제이다.

  • AppleCount, OrangeCount 변수 선언
  • 사과가 떨어질 위치?를 나무의 위치에 더해 정학한 위치를 구해준다
  • 떨어진 위치가 s, t 사이라면 AppleCount 증가
  • 오렌지도 동일

코드

void countApplesAndOranges(int s, int t, int a, int b, vector<int> apples, vector<int> oranges) {
    
    int AppleCount = 0;
    int OrangeCount = 0;
    for(auto AppleValue : apples)
    {
        int ApplePos = a + AppleValue;
        if(ApplePos >= s && ApplePos <= t)
        {
            ++AppleCount;
        }
    }

    for(auto OrangeValue : oranges)
    {
        int OrangePos = b + OrangeValue;
        if(OrangePos >= s && OrangePos <= t)
        {
            ++OrangeCount;
        }
    }
    
    cout << AppleCount << '\n';
    cout << OrangeCount;
}

 

반응형

'HackerRank' 카테고리의 다른 글

HackerRank : Dijkstra: Shortest Reach 2 (c++)  (2) 2023.10.19
HakerRank : Revising the Select Query I (SQL)  (0) 2023.10.19

댓글