| ENG RUS | Timus Online Judge |
Обсуждение задачи 1721. Две стороны одной монеты👑TIMOFEY👑 wa 1,2,3,4 and greedy algo // Задача 1721. Две стороны одной монеты 3 июл 2023 09:55 why greedy with catching two mins dont work pseydotests: #1: test test, universal base #2: universal, base base, universal #3: universal base test universal DarksideCoder Be Careful // Задача 1721. Две стороны одной монеты 16 мар 2022 17:38 The man texted "anything" can only do one work Programmer Greedy solution // Задача 1721. Две стороны одной монеты 21 ноя 2015 14:02 Why simple greedy algo: take two people with minimal rank - is not work Grigor Gevorgian Help with algo please [10] // Задача 1721. Две стороны одной монеты 11 окт 2009 00:58 How to solve this problem ? Flow seems not enough because of the vertexes of "anything" type. wcwswswws Re: Help with algo please [2] // Задача 1721. Две стороны одной монеты 11 окт 2009 21:40 Flow can solve it but there's a better way in fact. Edited by author 11.10.2009 21:40 Grigor Gevorgian Re: Help with algo please [1] // Задача 1721. Две стороны одной монеты 11 окт 2009 22:23 Could you tell me, please, how to construct the graph for a flow ? Tbilisi SU: Gio (Away) Re: Help with algo please // Задача 1721. Две стороны одной монеты 11 окт 2009 23:57 you should construct bipartite graph. for example , you have people with ranks: 2 4 6 8 10 2 , 6 , 10 - to the left side 4 , 8 - to the right side Pavel Kovalenko Re: Help with algo please // Задача 1721. Две стороны одной монеты 16 окт 2009 23:14 I tried to use Kuhn (max pair-combination), but get WA#11. And don't know, what to do next... SkidanovAlex Re: Help with algo please [5] // Задача 1721. Две стороны одной монеты 17 окт 2009 00:00 You always can put all the people with skill < 2 (modulo 4) to the left part and all the people with skill >= 2 (modulo 4) to the right. Definitely, all the edges will connect vertices from different parts, so this graph will be bipartite. Igor9669(Tashkent IAC) Re: Help with algo please [2] // Задача 1721. Две стороны одной монеты 18 окт 2009 19:30 My algo is O(n^3),but it got TLE 11! What is right algo here? acm_tester Re: Help with algo please [1] // Задача 1721. Две стороны одной монеты 25 апр 2011 00:20 My algo is O(n^2*m) and AC in 0.093 It is standart bipartite matching algo xurshid_n Re: Help with algo please // Задача 1721. Две стороны одной монеты 11 янв 2012 13:21 acm_tester писал(a) 25 апреля 2011 00:20 My algo is O(n^2*m) and AC in 0.093 It is standart bipartite matching algo I was use Hopcroft_Karp algo (from wiki) and AC. 0.031 s. Michael Uskov [USU] Re: Help with algo please [1] // Задача 1721. Две стороны одной монеты 11 дек 2014 13:29 SkidanovAlex писал(a) 17 октября 2009 00:00 You always can put all the people with skill < 2 (modulo 4) to the left part and all the people with skill >= 2 (modulo 4) to the right. Definitely, all the edges will connect vertices from different parts, so this graph will be bipartite. But why will the maximum match in this graph will be answer to the problem?SergeiEgorov Re: Help with algo please // Задача 1721. Две стороны одной монеты 22 сен 2015 01:30 I used a Hopcroft-Karp algorithm to solve this problem and got AC in 31 ms. So, not bad :) Fyodor Menshikov wa3 [1] // Задача 1721. Две стороны одной монеты 31 окт 2010 01:44 Pairs in output should be ordered: in each pair first the name of a person writing the statement and then the name of a person preparing the tests. Solution printing unordered pairs gets wa3. Zakharov Konstantin Re: wa3 // Задача 1721. Две стороны одной монеты 20 июл 2015 13:25 My solution got wa1 because of this)) sherbina_evgeniy WA14 // Задача 1721. Две стороны одной монеты 17 июл 2015 23:34 I got WA 14. I don't understand why? Please give me some tests or explain where is my mistake. Michael Uskov [USU] WA5 // Задача 1721. Две стороны одной монеты 12 дек 2014 15:41 Could you give me some tests please? Churchill About the statement of the problem [1] // Задача 1721. Две стороны одной монеты 13 окт 2009 21:53 Can there be two persons that have the same Specialization and the same rank?? Michael Uskov [USU] Re: About the statement of the problem // Задача 1721. Две стороны одной монеты 11 дек 2014 13:19 No, difference between two ranks should be equal 2 ConanKudo Can anyone help me shortening this problem statement ? [1] // Задача 1721. Две стороны одной монеты 3 авг 2010 20:41 Can anyone tell me what does the problem say in short ? This problem is too long to read...-.-" 2rf [Perm School #9] Re: Can anyone help me shortening this problem statement ? // Задача 1721. Две стороны одной монеты 3 авг 2010 23:15 Just read only two last paragraphs of statement. McArchuk WA 2 // Задача 1721. Две стороны одной монеты 10 окт 2009 16:02 I use greedy. Is this rigth? Give me some tests.
|