When submitting a solution in C++, please select either C++14 (GCC 6-32) or C++17 (GCC 7-32) as your compiler. ×

hmehta's blog

By hmehta, history, 5 years ago, In English

Hi!

Topcoder SRM 751 is scheduled to start at 21:00 UTC -5, Feb 21, 2018. Registration is now open for the SRM in the Web Arena or Applet and will close 5 minutes before the match begins.

Problem Setter: majk -- majk

Editorials: https://www.topcoder.com/blog/single-round-match-751-editorials/

This is the third SRM of Stage 3 of TCO19 Algorithm. This stage will also help you qualify and win reimbursements/tickets to TCO19 Regional Events.

Stage 3 TCO19 Points Leaderboard | Topcoder Java Applet | Next SRM 752 — March 6

All the best!

  • Vote: I like it
  • +24
  • Vote: I do not like it

| Write comment?
»
5 years ago, # |
Rev. 3   Vote: I like it +49 Vote: I do not like it

Is 316 * 16 intended in hard?

UPD: Juding from the editorial it seems the intended solution is O(3NN2). We can cut a factor of N by finding shortest paths instead of doing boolean DP with lengths.