Invitation to Alkhwarizm 2017

№	Пользователь	Рейтинг
1	tourist	3993
2	jiangly	3743
3	orzdevinwang	3707
4	Radewoosh	3627
5	jqdai0815	3620
6	Benq	3564
7	Kevin114514	3443
8	ksun48	3434
9	Rewinding	3397
10	Um_nik	3396

№	Пользователь	Вклад
1	cry	167
2	Um_nik	163
3	maomao90	162
3	atcoder_official	162
5	adamant	159
6	-is-this-fft-	158
7	awoo	155
8	TheScrasse	154
9	Dominater069	153
10	djm03178	152

The much awaited signature event of IIIT Allahabad's Tech Fest Aparoksha 2017 — Alkhwarizm is here to endeavour with a challenging problem set.

It will be a 5 hour individual contest with algorithmic problem-set of diverse nature to be hosted on Codechef. Contest link is here.

Prize money worth INR 30k for Indian winners and other exciting goodies for Global winners. CODE ON !!!

So be ready to have a nail biting experience on March 24th, 2017 — 9 pm to 2 am IST.

It will be first External rated contest that will be hosted on Codechef.

Problem Setters — m17, lucifer2709, shivamg_isc, hybrid

For any updates follow our event page.

Update

The contest has ended, Thank you all for participating. Hope you liked the problem set.

Following are winners of Alkhwarizm 2017

Congratulations to the winners !!!

For now we have provided small editorials for 8 problems. You can find it here. Detailed editorials will be published soon.

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

Написать комментарий?

rajat1603

8 лет назад, # |

+44

I still haven't recieved any cashprize from last year's contest.

→ Ответить

shivamg_isc

8 лет назад, # ^ |

Hi Rajat.

I apologize to you on behalf of Aparoksha 16 organizing team. There was a serious blunder last time.

I am seriously sorry for your bad experience of Alkhwarizm last year. Though I assure you that the same blunder won't happen again. The prize money will be rewarded for sure this time.

I hope you have a great contest tomorrow. :)

mavil.sittal.savil

+51

You won't have the same problem this year coz I am competing. Ez

Single_Ready_To_Mingle

Will there be any editorial ?

Also how to solve Charles and the BRUTAL subsequences ?

shubhiks1032

← Rev. 2 →

Let dp1[i]-> No. of subsequences if the last chosen string is i and it has greater length than the previous one.
Let dp2[i]-> No. of subsequences if the last chosen string is i and it has lesser length than the previous one.
Then we have: dp1[i]= Summation (dp2[j]) j is 1.2...i-1 && s[i] and s[j] have common prefix, dp2[i]= Summation (dp1[j]) j is 1.2...i-1 && s[i] and s[j] have common prefix
The check for second condition could be implemented using segment or fenwick tree.
Figuring out base cases and answer is easy.

The solution hints to some problems can be found here

Detailed editorials will be posted soon.

nilotpal

When will the editorials come??

+10

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