Hash Tables: Ice Cream Parlor
Problem Statement :
Each time Sunny and Johnny take a trip to the Ice Cream Parlor, they pool their money to buy ice cream. On any given day, the parlor offers a line of flavors. Each flavor has a cost associated with it. Given the value of money and the cost of each flavor for trips to the Ice Cream Parlor, help Sunny and Johnny choose two distinct flavors such that they spend their entire pool of money during each visit. ID numbers are the 1- based index number associated with a cost. For each trip to the parlor, print the ID numbers for the two types of ice cream that Sunny and Johnny purchase as two space-separated integers on a new line. You must print the smaller ID first and the larger ID second. Note: Two ice creams having unique IDs and may have the same cost (i.e. cost[ i ] = cost[ j ] ). There will always be a unique solution. Function Description Complete the function whatFlavors in the editor below. It must determine the two flavors they will purchase and print them as two space-separated integers on a line. whatFlavors has the following parameter(s): cost: an array of integers representing price for a flavor money: an integer representing the amount of money they have to spend Input Format The first line contains an integer, t , the number of trips to the ice cream parlor. Each of the next t sets of 3 lines is as follows: The first line contains money. The second line contains an integer, n, the size of the array cost. The third line contains n space-separated integers denoting the cost[ i ]. Output Format Print two space-separated integers denoting the respective indices for the two distinct flavors they choose to purchase in ascending order. Recall that each ice cream flavor has a unique ID number in the inclusive range from 1 to cost. Sample Input 2 4 5 1 4 5 3 2 4 4 2 2 4 3 Sample Output 1 4 1 2
Solution :
Solution in C :
In C :
#include <stdio.h>
int main(int argc, const char * argv[]) {
int t;
//printf("Enter number of trips to the ice cream parlor:\n");
scanf("%d", &t);
for (int trip = 0; trip < t; trip++) {
int m;
//printf("Enter amount of dollars:\n");
scanf("%d", &m);
int n;
//printf("Enter number of flavors:\n");
scanf("%d", &n);
int cost[n];
for (int id = 0; id < n; id++) {
//printf("Enter the cost of flavor %d", id);
scanf("%d", &cost[id]);
}
int total = 0;
for (int cost1 = 0; cost1 < n; cost1++) {
for (int cost2 = cost1 + 1; cost2 < n; cost2++) {
total = cost[cost1] + cost[cost2];
if (total == m && cost1 < cost2) {
printf("%d %d\n", cost1 + 1, cost2 + 1);
break;
}
}
if (total == m) {
break;
}
}
}
}
Solution in C++ :
In C++ :
#include <bits/stdc++.h>
using namespace std;
class IceCream {
public:
int flavor;
int index;
IceCream(int flavor, int index) {
this->flavor = flavor;
this->index = index;
}
};
int binarySearch(int first, int last, vector<IceCream> arr, int search) {
int n = last;
int mid = (first+last)/2;
while(first <= last){
if(arr[mid].flavor==search)
return arr[mid].index;
else{
if(arr[mid].flavor>search)
last = mid-1;
else
first = mid+1;
}
mid = (first+last)/2;
}
return -1;
}
bool compare(IceCream i1, IceCream i2)
{
return (i1.flavor < i2.flavor);
}
int main() {
int t;
int n, m;
cin >> t;
for(int test = 0; test < t; test++) {
cin >> m >> n;
vector<IceCream> arr;
arr.reserve(n);
for (int i = 0; i < n; i++) {
int cost;
cin >> cost;
arr.push_back(IceCream(cost, i + 1));
}
sort(arr.begin(), arr.end(), compare);
/*for (int i = 0; i < n; i++) {
cout<<arr[i].flavor<<"\t";
}*/
int firstIndex = 100000, secondIndex = 100000;
for(int i = 0; i < n - 1 ; i++) {
int search = m - arr[i].flavor;
//cout<<search<<endl;
if(search >= arr[i].flavor) {
int index = binarySearch( i + 1, n - 1, arr, search);
if( index != -1 ) {
cout << min(arr[i].index, index) << " " << max(arr[i].index, index) << endl;
break;
}
}
}
}
}
Solution in Java :
In Java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
int t;
int n, m;
Scanner in = new Scanner(System.in);
t = in.nextInt();
HashMap<Integer, Integer> h = new HashMap<>();
for(int test = 0; test < t; test++) {
m = in.nextInt();
n = in.nextInt();
int first=-99999999;
int last=-99999999;
for (int i = 0; i < n; i++)
{
int r=in.nextInt();
if(h.containsKey(m-r))
{
// System.out.println("contains key "+r);
first= Math.min(h.get(m-r),i+1);
last = Math.max(h.get(m-r),i+1);
}
else{
if(m-r>=0)
h.put(r,i+1);
}
}
h.clear();
System.out.println(first+" "+last);
}
}
}
Solution in Python :
In Python3 :
def flavors(m,a):
prices = {}
for idx, p in enumerate(a):
if m-p in prices:
return prices[m-p], idx
prices[p] = idx
return None
t = int(input().strip())
for a0 in range(t):
m = int(input().strip())
n = int(input().strip())
a = list(map(int, input().strip().split(' ')))
f1, f2 = flavors(m,a)
print(f1+1, f2+1)
View More Similar Problems
Counting On a Tree
Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n
View Solution →Polynomial Division
Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie
View Solution →Costly Intervals
Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the
View Solution →The Strange Function
One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting
View Solution →Self-Driving Bus
Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever
View Solution →Unique Colors
You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti
View Solution →