Number of pairs of sets

Question

1.00/5 (1 vote)

See more:

There are N sets of integers from 1 to K both inclusive. Find out number of pairs of sets whose union contains all the K elements.

What I have tried:

i have used set_union but its giving TLE , what should i do to optimise it ?

Posted 6-Jun-17 10:41am

Member 13244314

Updated 6-Jun-17 22:25pm

Sean Ewington

Add a Solution

Comments

Patrice T 6-Jun-17 18:43pm

"what should i do to optimise it ?"
What have you done ?

OriginalGriff 7-Jun-17 1:43am

Without seeing the relevant code fragments, we can't even begin to guess how to improve your execution speed or time - that like you trying to improve the flavour of my Rogan Josh over the internet when I can't describe the current taste to you!
Use the "Improve question" widget to edit your question and provide better information.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CPallini · Answer 1 · 2017-06-06T22:25:00

You don't need to fully perform the union of each pair: abandon the union computing process on first missing item, e.g.

Suppose

k=5, s1 = {1,2,5}, s2 = {1,4}

since 3 is missing in both s1 and s2 then you don't have to fully perform the union of the two sets to discover they are bad candidates.