Here is the our group home page.
For contest we are used computers of the IntelliJ Software, which currently is employer of two from us (Dmitry Boulytchev and Eugege Vigdorchik). Thanks, IntelliJ.
Languages used:We use mix of the O'Caml and the GNU C (we use such GNU-specific features as inline functions and 64-bit arithmetic).
You can download our last submission here.
The results are following:
SPbTeam Solution Sources:
The sources organized as follows:
Since we didn't manage to find any proven-optimal algorithm we've used search-and-cut strategy flavoured with miscellaneous heuristics.
The algotrithm look like this:
This is a screenshot of the process:
Initially active set consists of starting state.
Some heuristics used to cut the active set:
Some adaptive features are introduced: "closeness" criteria strengthens near the bounds of track, distance from the "leader" is reduced when active set become too large and increased if active set become too small.
Two optimizations are performed: