Hello :) Could someone please give me test 48 or similar to let me understand what is wrong with my program ? :)

You can get it yourself, take a look at https://acm.timus.ru/forum/thread.aspx?id=40290&upd=637441513367513050

My program works fast on this test case :) (about 0.5 seconds) but still have TLE 48 )

What is the best way to collect information for particular test? Time/100ms (if there is window for that), memory/100kB, WA, TLE, RE... what else? What maximum number of bits per try? Let's call it `bitrate`. Serious enough term for further discussion =), isn't it?

How to match particular test? Binary search for hash value of the input?

Please, reveal your super-duper technology with your fancy-nancy metrics.

Edited by author 18.12.2017 22:11
Re: test case 70:
Posted by Shen Yang 19 Dec 2017 05:08
I just use stupid bianry search every veriable and submit many many many times

I don't have better ideas

and I have only test case 70...

Edited by author 19.12.2017 05:09

Thank you for prompt :) But I guess I found one which helped me:

Ships:
93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 83, 83, 83, 83, 73, 73, 73, 73, 73, 72, 72, 72, 62, 62, 57, 57, 57, 57, 57, 57, 57, 53, 53, 50, 50, 50, 50, 46, 46, 46, 42, 42, 42, 42, 42, 42, 42, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 24, 24, 24, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 10

Rows:
159, 516, 57, 724, 146, 1014, 688, 507, 1039