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
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 →Fibonacci Numbers Tree
Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T
View Solution →Pair Sums
Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v
View Solution →Lazy White Falcon
White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi
View Solution →Ticket to Ride
Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o
View Solution →Heavy Light White Falcon
Our lazy white falcon finally decided to learn heavy-light decomposition. Her teacher gave an assignment for her to practice this new technique. Please help her by solving this problem. You are given a tree with N nodes and each node's value is initially 0. The problem asks you to operate the following two types of queries: "1 u x" assign x to the value of the node . "2 u v" print the maxim
View Solution →