Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity must be as small as possible (nlogn or n at best, no n^2). Apply a greedy algorithm in the problem. Make sure the code can pass all the test cases mentioned plus could also work for larger values and unique cases. The actual Incompelete code-"""This function solves a test case.Parameters:n : int - number of duties availablet : int - time to do duties in minutesduties : array-like - a 3-tuple of string values in the format (name, wait time, completion time)Returns:A string containing the answer or "I need to find friends." """def solve(n,t,duties): # TODO passn, t = list(map(int,input().split(" ")))duties = []for i in range(n): name = input() w,c = list(map(int,input().split(" "))) duties.append([name,w,c])print(solve(n,t,duties)) Sample Input 03 10Brayflox's Longstop1 2Sastasha32Urth's Fount66Sample Output 03Sample Input 132Copperbell Mines13 14Thornmarch (Hard)227 228The Aurum Vale7 10Sample Output 12Sample Input 242Haukke Manor117 111Thornmarch (Hard)118 115The World of Darkness114 113The Aery114 110Sample Output 2I need to find friends. Did you know that the critically acclaimed MMORPG Final Fantasy XIV has a free trial and includes the entiretyof A Realm Reborn AND the award-winning Heavensward expansion up to level 60 with no restrictions onplaytime? Sign up, and enjoy Eorzea today!Despite the critical acclaim, however, one disadvantage for people without friends is that they have to resortto the duty finder to do co-op duties, which are required for the main scenario quest.To simplify this scenario, assume that for each possible duty, we know exactly two values to the most precisedegree: the time W; it will take to find a party of other players for the duty and C₂ the time it will take tocomplete the duty successfully. All time is in seconds.You have exactly I minutes before your next class, and you wish to complete as many duties as possible. Youalso do not want to repeat any duties you have completed in this period. Can you identify the set of duties toqueue for and to complete?Input FormatEach test case begins with two space-separated integers N and T, indicating the number of available dutiesand the time (in minutes) you will have to complete as many duties as possible.2N lines follow. The first line contains the name of the duty, which may consist of any ASCII values that can beshown on the screen. The second line contains two space-separated integers W₂ and C₂, indicating the duty'swaiting time and completion time (in seconds).Constraints1≤N ≤2-1051 ≤T, W₁, C ≤ 10⁹Output FormatOutput a single integer indicating the total number of duties that can be completed within the time limit. If noduties can be completed, print "I need to find friends." (without quotes)

A greedy algorithm is an algorithmic approach that solves a problem by making the locally optimal…

Answered: Information is present in the…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity must be as small as possible (nlogn or n at best, no n^2). Apply a greedy algorithm in the problem. Make sure the code can pass all the test cases mentioned plus could also work for larger values and unique cases.

The actual Incompelete code-

"""
This function solves a test case.

Parameters:
n : int - number of duties available
t : int - time to do duties in minutes
duties : array-like - a 3-tuple of string values in the format (name, wait time,
completion time)

Returns:
A string containing the answer or "I need to find friends."
"""
def solve(n,t,duties):
# TODO
pass

n, t = list(map(int,input().split(" ")))
duties = []

for i in range(n):
name = input()
w,c = list(map(int,input().split(" ")))
duties.append([name,w,c])

print(solve(n,t,duties))

Sample Input 0
3 10
Brayflox's Longstop
1 2
Sastasha
32
Urth's Fount
66
Sample Output 0
3
Sample Input 1
32
Copperbell Mines
13 14
Thornmarch (Hard)
227 228
The Aurum Vale
7 10
Sample Output 1
2
Sample Input 2
42
Haukke Manor
117 111
Thornmarch (Hard)
118 115
The World of Darkness
114 113
The Aery
114 110
Sample Output 2
I need to find friends.

Expert Solution

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions