Invitation to CodeChef March Starters 29 (Rated for Div 2, 3 & 4)

№	Пользователь	Рейтинг
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	143
5	Errichto	139
6	adamant	137
7	AmShZ	135
8	maroonrk	133
9	BledDest	132
10	qwexd	129

We invite you to participate in CodeChef’s Starters 29, in collaboration with Neuromancers, IIT-BBS, this Wednesday, 9th March, rated for Div 2, 3 & 4 Coders.

Time: 8 PM — 11:00 PM IST

Joining me on the problem setting panel are:

Setters and Editorialists: Arpit Kesharwani ak82, Agamya Yadav Sky_Warrior, Akshat Gupta gakshat468, Sarthak Gupta sg0071729
Tester: Anshu Garg CoderAnshu
Statement Verifier: Kanhaiya Mohan notsoloud1
Contest Admin: Nishant Shah nishant403

Neuromancers is the Programming Society of IIT Bhubaneswar and is proud to present CodeChef Starters 29. With an interesting problem set lined up, we promise to provide you with a challenge!

The video editorials of the problems will be available on our YouTube channel as soon as the contest ends. Subscribe to get notifications about our new editorials.

Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here.

Hope to see you participating. Good Luck!

I created a directed graph from the given equations like p -> a*q + b*r so adj[p] = {(q,a),(r,b)} ..now I will push element which are parent of themselves into the queue and apply bfs the transition would be : for Childs for any node p if q is not visited if will push it to queue and increase a[q]+=a[p]*a else do a[q]+=a[p]*a without inserting it in queue . So in the end only leaf nodes will remain and rest will decompose . also in mathematical operation I have taken care of MOD.

I created array par[x] which tells number of parent x currently has. Initially I am pushing all the nodes which have 0 parent to my queue. then for child q of node p , I am decrementing par[q] by 1 if par[q] equals zero then pushing it to queue and increase a[q]+=a[p]*w otherwise just increase a[q]+=a[p]*w .

Комментарии (13)

Показать архивные | Написать комментарий?

SmartCoder

5 лет назад, скрыть # |

There's Topcoder happening at the same time, you guys should sync, https://codeforces.me/blog/entry/100704

→ Ответить

jakubd

5 лет назад, скрыть # ^ |

Ok thanks I thought they should sync.

CodeChef_admin

Reminder: Contest starts in 2 hours!

Reminder 2: 20 minutes to go

qwi

← Rev. 2 →

+23

Now that the contest is over, I want to point out a huge flaw: Problem Max Heat (COST_MANIA) is same as 1554B Cobb with OR operation being changed to XOR operation and a simple check for A[i] <= j.

nishant403

Sorry, this was unexpected and unknown to us. I couldn't find this problem while searching for it, otherwise this wont be there.

Parvej

Don't be sorry. This problem helped me to become 5* on CodeChef.(◠‿◕)

gnudgnaoh

i got the idea from that problem too :v

enlightrahulrm333

In Decomposition Reaction Problem my approach of bfs on directed graph was giving me wrong answer can someone explain why ? Update: Solved with little tweak in my algorithm

18o3

Think of a graph like this 1->2 4->3 3->2 2->5.

Thanks a lot ...got an AC with little tweak in my algorithm .

My code

Congratulations. You just used Kahn's Algorithm for topological sorting.

Блог пользователя ak82