### scnucjh's blog

By scnucjh, history, 6 weeks ago, ,

I passed 1307D - Cow and Fields with code which is obviously wrong! Because I solve the promble in this way:

• if k<7000 using the $O(n^2)$ algorithm.
• else use a obviously fake algorithm which should be hacked.

Submission is here : 71566996

Who can hack me?

• +16

 » 6 weeks ago, # |   +53 Done
•  » » 6 weeks ago, # ^ |   0 Now try hack my $O(k^2)$: 71334468
•  » » » 6 weeks ago, # ^ |   +5 I don't think it's possible. If $k > \frac{n}{2}$, the flag fll is triggered. Otherwise $k \le 10^5$ and the $O(k^2)$ part works in 1s, thanks to low constant and pragmas.