Can someone share the solution of both problem on the techgig code gladiator contest? Also do they really give out Rs 500 Amazon voucher?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
aneesh2312
I did the same thing that sdssudhu did..
The first one was simple just simulate the possibilities considering only when the fish enters.
The second one was max-flow. Consider a universal source U. Now add edges U to i with weight as the number of monkeys on tree i(ti).
Let sum of all ti = S.
Now next create nodes 0',1',2',.. which have exactly 1 incoming edge from 0,1,2,... with some infinite weight . The position of 0 and 0' are same , 1 and 1' are same and so on..,
Now from 0' add edges to all original nodes(0,1,2,...) that are reachable from it.
Now perform maxflow from U to 0 , U to 1 ,... and for nodes whose maxflow is S increment the answer.
P.S. Regarding amazon vouchers will let you know if I receive it.
Can you share your code?
For the amazon voucher, I think if someone who participated last year could provide information.
Did they mention amazon voucher anywhere? Last year they gave 3 months gaana.com vouchers..
Also I don't know why but I don't think these 300 people selected were actually capable of writing max flow. Almost every one of them is in jobs like Jio,Vodafone,Fliplkart,IG Infotech,Wipro,etc and I don't think many of them is present on major programming platforms like CF,CC,Hackerrank so how can they do the complex second problem being in "normal" jobs.
LOL, what a shit I read. The rest of the comment would be in Captain Obvious mode.
I see several options, how it may happens:
they could be involved in competitive programming (CP) and gained major experience before they started working;
they do CP in their free time as a hobby;
1 + 2.
And, IMHO, you shouldn't think about their successes and look for deception there, but concentrate on your performance and self-development if you want to achieve something.
Just checked your other posts here — you are really miserable! You asked for help with problems from this tournament while it was in progress and now you suspect of cheating others? Shame on you!