|
|
Show all threads Hide all threads Show all messages Hide all messages | Easy | Mickkie | 1764. Transsib | 25 Nov 2023 18:04 | 1 | Easy Mickkie 25 Nov 2023 18:04 No need to use simplex alg. Simple brute force linear programming done in O( Choose(10,4) * 4^3 ) time | Intended solution | Djok [Clown Fiesta] | 1764. Transsib | 24 Aug 2018 22:11 | 1 | What is the intended solution for this problem? I used simulated annealing in order to get AC, but I don't think this is intended to pass. | how to take in account the time ? | svr | 1764. Transsib | 25 Oct 2011 12:58 | 2 | Is it standard maxflow problem? May be it is 4-types of products flow? AC without times using. LP problem for 4-component flow with help of simplex method(my smpmeth is above struct{__int64 intpart;__int64 num;__int64 denum;char sign;};) By the way, very good question: why maxflow algo doesn't work. Edited by author 24.10.2010 01:48 Edited by author 24.10.2010 01:49 Maxflow algo doesn't work because it uses ways like M-1-2-3-Y or M-4-5-6-Y, that are not available. |
|
|
|