Hackrndm wa

dursalakihoegalo 2012-05-09 06:47:54 UTC #1

I solved this question at interviewstreet and got accepted in python. Why do I get a WA here?

edit: got AC.

dursalakihoegalo 2012-05-09 07:26:56 UTC #2

I found the problem but my O(N) gives a TLE..

edit: AC..

dursalakihoegalo 2012-05-09 07:53:54 UTC #3

AC..

conclusion: set(a).intersection(set(b)) is faster than set(a)&set(b).

rc1024 2012-08-06 16:04:33 UTC #4

I have a O(nlogn) solution. (The algorithm is O(n) but requires a sort first, which I believe is O(nlogn).)

But I believe I'm getting TLE because my input is slow, or at least I want to eliminate this possibility.

What's the fastest way to input this data? I'm currently using:

numdeck = [int(line) for line in f]

Is there a way to speed this up, especially given we know how many lines there are? (n).

daft_wullie 2012-08-06 18:56:12 UTC #5

Ther are several questions / answers / samples here in the forum. From your snippet it is impossible (for me) to give a hint. What is "f"? Do you already use sys.stdin?