I never participated in IOI, but at least in ACM contests I have never seen a problem where suboptimal heuristic search was allowed.
Well a lot of prolog implementations also feature finite domain and rational domain solvers, global constrains that I don't think your 15 year old buddies would be able to code in an hour. Having said that, most…
I think you are overestimating the current capabilities of JIT's. Also, unfortunately, current compilers are notoriously bad at generating code with special instructions (vectorized code). So in the end applications…
I never participated in IOI, but at least in ACM contests I have never seen a problem where suboptimal heuristic search was allowed.
Well a lot of prolog implementations also feature finite domain and rational domain solvers, global constrains that I don't think your 15 year old buddies would be able to code in an hour. Having said that, most…
I think you are overestimating the current capabilities of JIT's. Also, unfortunately, current compilers are notoriously bad at generating code with special instructions (vectorized code). So in the end applications…