You are given a undirected weighted graph with at most 50000 vertices, 100000 edges and 2 vertices A and B. You have to find 2 paths from A to B that no edge is used twice (but they can have common vertices), and the sum of the length of these 2 paths is minimal.

I'm currently stuck on this problem. Can anyone give me a hint? Thank you.

Hello everyone, Codeforces is a big competitive programming community so I hope this is the right place to ask this question :)

First of all, I have absolutely no experience working with Linux so installing and using DomJudge is a real struggle for me.

I managed to setup domserver successfully (I think) so now I can create contest, add teams, users and problems. However, I have no idea how to setup the judgehost, so now I cannot judge teams' submissions. I tried to read the documents but it's just too complicated to understand for a total noob like myself.

So I hope anyone can please give me a clear step by step instruction on how to setup the judgehost.

Thank you :)