Attending Workshops C++


Problem Statement :


A student signed up for n workshops and wants to attend the maximum number of workshops where no two workshops overlap. You must do the following:

Implement 2 structures:

   1.  struct Workshop having the following members:
        The workshop's start time.
        The workshop's duration.
        The workshop's end time.

    2 . struct Available_Workshops having the following members:
        An integer, n (the number of workshops the student signed up for).
An array of type Workshop array having size n.

Implement  2 functions:

1. Available_Workshops* initialize (int start_time[], int duration[], int n)
Creates an Available_Workshops object and initializes its elements using the elements in the start_time[] and duration[] parameters (both are of size n ). Here, start_time[i] and duration[i] are the respective start time and duration for the ith workshop. This function must return a pointer to an Available_Workshops object.

2 . int CalculateMaxWorkshops(Available_Workshops* ptr)
Returns the maximum number of workshops the student can attend—without overlap. The next workshop cannot be attended until the previous workshop ends.


Note: An array of unknown size (n) should be declared as follows:

DataType* arrayName = new DataType[n];

Input Format

Input from stdin is handled by the locked code in the editor; you simply need to write your functions to meet the specifications of the problem statement above.

Constraints 

  1 <=  N  <= 10^5
  0  <= start_time(i) <= 10^3
  0  <= duration(i)   <= 10^3

Output Format

Output to stdout is handled for you.

Your initialize function must return a pointer to an Available_Workshops object.
Your CalculateMaxWorkshops function must return maximum number of non-overlapping workshops the student can attend.


Solution :



title-img 


                            Solution in C :

struct Workshop {
	int start_time, duration, end_time;
	bool operator<(const Workshop& another) const {
		return end_time < another.end_time;
	}
};

struct Available_Workshops {
	int N;
	vector<Workshop> arr;
};

Available_Workshops* initialize(int start_time[], int duration[], int N) {
	Available_Workshops* workshop = new Available_Workshops;
	workshop->N = N;
	for (int i = 0; i < N; i++) {
		Workshop temp;
		temp.start_time = start_time[i];
		temp.duration = duration[i];
		temp.end_time = start_time[i] + duration[i];
		workshop->arr.push_back(temp);
	}
	return workshop;
}

int CalculateMaxWorkshops(Available_Workshops* ptr) {
	int res = 0;
	sort(ptr->arr.begin(), ptr->arr.end());
	int end_time = -1;
	for (int i = 0; i < ptr->N; i++) {
		if (ptr->arr[i].start_time >= end_time) {
			res++;
			end_time = ptr->arr[i].end_time;
		}
	}
	return res;
}








View More Similar Problems

No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

View Solution →

Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

View Solution →

Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

View Solution →

Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →

Kindergarten Adventures

Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti

View Solution →

Mr. X and His Shots

A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M

View Solution →