Блог пользователя a00012025

A strange TLE of problem 504-D
Автор a00012025, 9 лет назад, По-английски

Here are TLE code and AC code of the problem 504D-Misha and XOR, the difference between them is only the condition of the for loop, but i<maxn && m>=0 is a stronger condition. Does anyone have idea about what happened? Thanks a lot.

  • Проголосовать: нравится
  • +14
  • Проголосовать: не нравится

»
9 лет назад, # |
← Rev. 2   Проголосовать: нравится +6 Проголосовать: не нравится

I've added inline and it's Accepted with the condition 11191452

It's really interesting to know why this happened!

→ Ответить
»
9 лет назад, # |
  Проголосовать: нравится +10 Проголосовать: не нравится

This is even more weird!

Here I added a variable x, and made it equal to m, it got TLE.

Here I made it equal to m+1 before the loop, and equal to m in the loop, it got AC!

Here I made it equal to m before the loop, and don't change it in the loop, it got AC!

Maybe it is a bug in the compiler optimizer? I hope someone figures that out!

→ Ответить