jqdai0815's blog

By jqdai0815, history, 8 years ago, In English

I accepted this problem during the training using a solution.

When I read the model solutions submitted by Mike, I found they are brute force too. And It will failed on a easy case n = 218 - 1, ai = i, bi = i + 1.

Only my solution and Los_Angelos_Laycurse's solution pass this case.

I think we implemented more clever brute force solutions.

But I don't know how to prove my solution is right or construct some hard cases to make my solution TLE.

I really want to know: Is there any provable solution to solve this problem?

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

»
7 years ago, # |
Rev. 2   Vote: I like it -99 Vote: I do not like it

.

»
7 years ago, # |
  Vote: I like it -47 Vote: I do not like it

Come! On! Stop solving every single problem under the sun. I will never reach you guys this way.

  • »
    »
    7 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    YES INDEED , You will NEVER reach these guys if you keep thinking this way -_-

»
7 years ago, # |
  Vote: I like it +41 Vote: I do not like it

As far as I know, the intended solution is and the problem author is ilyakor.

  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Can you share some insights about that solution? I am really curious