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

Simple Text Editor

In this challenge, you must implement a simple text editor. Initially, your editor contains an empty string, S. You must perform Q operations of the following 4 types: 1. append(W) - Append W string to the end of S. 2 . delete( k ) - Delete the last k characters of S. 3 .print( k ) - Print the kth character of S. 4 . undo( ) - Undo the last (not previously undone) operation of type 1 or 2,

View Solution →

Poisonous Plants

There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan

View Solution →

AND xor OR

Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value

View Solution →

Waiter

You are a waiter at a party. There is a pile of numbered plates. Create an empty answers array. At each iteration, i, remove each plate from the top of the stack in order. Determine if the number on the plate is evenly divisible ith the prime number. If it is, stack it in pile Bi. Otherwise, stack it in stack Ai. Store the values Bi in from top to bottom in answers. In the next iteration, do the

View Solution →

Queue using Two Stacks

A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic que

View Solution →

Castle on the Grid

You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):

View Solution →