THEATRE - Editorial

a_nonymous · February 19, 2020, 1:11pm

Initially I thought that this is stable marriage problem with ties, did a bit of research but finally gave up.

anon70990627 · February 19, 2020, 2:33pm

Your solution fails for this test case-

1
24
A 12
A 9
A 9
A 9
B 12
B 12
B 9
B 9
B 9
B 9
C 12
C 12
C 3
C 3
C 3
C 6
C 6
D 3
D 3
D 3
D 3
D 6
D 6
D 6

Expected output-
825
825

Your program’s output-
925
925

Hope this helps

vickyvanshaj · February 20, 2020, 9:40am

If you don’t know the NQueens problem, I’ll first advice you to study that and then try to understand my solution.

tmwilliamlin · February 20, 2020, 11:35am

Try

Test case

1
4
A 6
C 6
C 6
C 9

tmwilliamlin · February 20, 2020, 11:42am

Try

Test Case

1
2
B 9
D 9

allenjv123 · February 20, 2020, 11:59am

I am familiar the NQueens approach. I was finding difficult to understand your implementation. Which is why I asked if you could please elaborate a bit…

akshayar01 · February 20, 2020, 1:11pm

WTF mahn!!! Respect = infinity;

when my code was long (according to noob me) I thought there ought to be some other solution and stopped coding.

Now I know what it takes for an AC;

sudheerays123 · February 20, 2020, 2:08pm

Smart work is better than hard work

Should have done it easier but couldn’t think of any other solution

anshulbansal53 · February 20, 2020, 2:19pm

Oh! god, Silly Mistake! the ticket variable was to be reinitialized for every best_choice and I forgot about it. By the way thanks for your time.

akshayar01 · February 20, 2020, 2:31pm

Yeah…I know .
I was pointing out your dedication.

sunny_52525 · February 20, 2020, 2:58pm

Oh, Thank you mate. One combination messed it up. AC now

fun221 · February 21, 2020, 1:01pm

I am only getting 30 points,can you fix it.

nanoprecision · February 21, 2020, 2:37pm

Can someone please provide a JAVA implementation of this, as in JAVA we don’t have any nextPermutation kinda function, so its becoming lil bit comlicated for me to go through, kindly help if any one can traslate the same implementation to simplest efficient JAVA code…

Thanks in advance…

nishantnimbare · February 21, 2020, 3:08pm

can someone tell me where I am going wrong

https://www.codechef.com/viewsolution/29830163

anon70990627 · February 21, 2020, 3:51pm

Try this test case-

Test case

1
10
B 12
C 3
A 6
D 12
A 12
C 6
A 9
D 3
C 12
A 3

Ans- 250

tmwilliamlin · February 22, 2020, 9:20am

Try

Test case

1
4
A 12
A 9
B 6
C 9

tmwilliamlin · February 22, 2020, 9:22am

Could you fix the link? It doesn’t point to any submission.

tmwilliamlin · February 22, 2020, 9:24am

The recursive method works in pretty much every language and it is simple enough. Moreover, it can be easily extended (find all arrays with integers from 1 to n where each value can appear at most twice).

nishantnimbare · February 22, 2020, 10:17am

thanks a lot:+1:

ACR · February 22, 2020, 1:40pm

Can we use Hungarian Algorithm to solve this problem?