AIOC Banner

Problem: Ruckus League

Want to try solving this problem? You can submit your code online if you log in or register.

Ruckus League

Input File: ruckusin.txt
Output File: ruckusout.txt
Time Limit: 1 second

It's that time of year again! The Annual Ruckus World Championships is fast approaching and you are absolutely determined to see Australia victorious. As the name implies, the goal of the competition is to be as loud and obnoxious as possible. Players compete in teams of at least M people (there is no upper limit on team sizes). To make sure teams don't mix, team members must hold hands with each other.

Of course, you've found that there is nothing more obnoxious than spoilt kindergarteners, so you've rounded up N of the loudest ones you could find. You were hoping to send as many teams as possible, but some of the children have already started holding hands with their friends. Being as stubborn as they are, you are finding it rather difficult to convince them to let go of each other, or even to hold hands with anyone else.

Now for any other person, the story would end here; you'd have to send whatever teams their 'friendships' have forged. However, being the social engineering master you are, you've brought K lollipops to use to bribe the children. You can pass a lollipop to the hand of a child, which will make them let go of the hand they are holding.

Using your K lollipops, what is the largest number of teams with at least M children you can form?


The first line of the input file will contain four space separated integers on a single line, in the format: N L K M.

The following L lines will each contain two integers, in the format: li ri. This indicates that the lith child's left hand is holding the rith child's right hand. The children are numbered from 1 to N. No one can hold their own hands.


Output should consist of a single integer: the maximum number of teams with at least M children you can form.

Sample Input 1

8 6 0 1
1 2
4 6
5 4
2 3
7 5
6 7

Sample Input 1



In the first example, you cannot break up any pair of hands (since you have no lollipops), and teams can have any number of people in them. Initially, the children have formed three teams: one of size 3, one of size 4 and one of size 1. Thus the output should be 3.

Sample Input 2

15 13 5 2
1 2
2 6
6 10
10 7
8 9
9 8
3 4
4 5
15 11
11 12
12 13
13 14
14 15

Sample Input 2



In the second example, each team needs at least 2 people. Currently there are four teams of size 2, 3, 5 and 5. (The team of size 2 consists of children 8 and holding both hands with each other.) By breaking the friendships 6-10, 14-15 and 11-12, we can create up to six teams, of size 2, 2, 2, 3, 3 and 3. Thus the best answer is 6.

Note that even though we have 5 lollipops, we don't have to use them all in order to make the maximum number of teams (even though we can).

Subtasks & Constraints

For all subtasks, 0 ≤ L ≤ N, 1 ≤ M ≤ N and 0 ≤ K ≤ L.


Privacy statement
© Australian Mathematics Trust 2001-2019

Page generated: 24 May 2019,  3:18am AEST