#1 mst solution
Closed this issue · 5 comments
We have the second best solution on https://kth.kattis.com/problems/kth.avalg.approxspanningforest/statistics
Can we achieve number 1?
As part of #1, I removed the coin flipping from the code (it wasn't functional at all). It may be worthwhile to figure out a way to properly implement it to help us toward the first place.
At some point I got a score of 2910, so we're really close
Good news
The poor man's way of achieving # 1 is using e.g. https://github.com/ThimLohse/kattis-automated-submit-wrapper
If anyone can figure out an algorithmic improvement, that's even better.
Good news
The poor man's way of achieving # 1 is using e.g. https://github.com/ThimLohse/kattis-automated-submit-wrapper
If anyone can figure out an algorithmic improvement, that's even better.
Should we maybe use the automated submit wrapper to make submissions faster?