AlgoUtsav 2024 Inter College Coding Competition (Prizes worth 50K INR)

№	Пользователь	Рейтинг
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

Are you ready to take your programming skills to new heights?

The Algorithmic and Programming Society (APS) of NIT Rourkela proudly presents AlgoUtsav 2024! This coding competition is open to all undergraduate programmers across India. Whether you're a seasoned coder or just starting out, AlgoUtsav offers an opportunity to challenge yourself and showcase your talent.

The contest will be held online according to ICPC guidelines

Rules and Guidelines:

AlgoUtsav 2024 is open to all Indian college students, providing a platform for young minds to showcase their coding skills.
Teams must consist of 2-3 members, and all team members must belong to the same organization encouraging collaboration and teamwork.
Multiple registrations will not be allowed to ensure fairness and equal opportunity for all.
Sharing solutions during the contest period is strictly against the rules, promoting integrity and individual effort.
Any attempt to deliberately destabilize the testing process or hack the contest will result in immediate disqualification, upholding the integrity of the competition.

Registration Link:

Link: https://unstop.com/p/algoutsav-2024-nit-rourkela-905708

Contest Timing:

The contest will be on 16th February 2024 at 14:30 IST of duration 3:00 hrs.

Contest Link

Click on the link below to take part in the contest. Registration for the contest will start 6 hours before the contest

Link: https://codeforces.me/contestInvitation/94c98ba6995d24eb14165d5801d0805da1a0eddc

Special thanks to MikeMirzayanov for amazing Codeforces and Polygon platforms.

See you on the leaderboard!!

UPD1: The Registrations have started!

UPD2: Editorial is out!!

i seen the submission of the people have solved it they use the same code for n,m Means it will work for n,m also right Now i know like , in Ax = B B has entries like D[i] + k1*365 So we need to do something like crt right to find the first value, then corresponding k1 k2 .. can be found But what they doing like , 5 * 73 = 365 , 5 as p1 , 73 as p2 Did you know what they do?

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

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

ninjamayank

9 месяцев назад, # |

Auto comment: topic has been updated by ninjamayank (previous revision, new revision, compare).

→ Ответить

Bosscoder

Prize breakdown?

ishat_jha

I have no other CP person in my school, so I can't meet atleast 2 people from same organization requirement. Please can something be done for it?

devansh789

8 месяцев назад, # |

When will the editorial be provided

Vaid23

Could Someone please give the idea or approach of problem C ? I tried thinking in direction of DP but got nowhere as range was too large to make submask as DP state. I tried some random constructive ideas but they didn't worked either. help appreciated.

18o3

8 месяцев назад, # ^ |

Same problem.

Snapper_001

← Rev. 2 →

Bro did you solve the B problem I think of gausss elimination but don't know how to correct implement it

i tried the code from cp algorithm , but it is for n = m , n+1 th column for B (Ax = B)

But i don't know what to do , i make matrix then max(n , m) * max(n ,m) Please help!

Thanks

vok8

I was getting WA. Not sure what I missed. But, here are my insights:

You can get stuck at infinite solutions if you go with max(n, m) * max(n, m) matrix.

Instead, what's better is: find the variables (columns) which are non-zero in >= 1 row. That will be the n for you. Now, take n rows from the given m rows (if m < n, definite answer is not possible): and here you get the n x n base matrix with an additional (n + 1)th column in each row being the number of days (for that row)

Thanks!

I read the editorial but I am unable to follow the row canonical optimization part and if possible could you also give some resource for the proof of why and how is it working.

Where is the editorial

Oh! Sorry for not being clear. I read the editorial of the problem mentioned by 18o3 in the comment, not the contest's editorial.

Xor basis Technique

I understood about XOR basis from this blog. **https://codeforces.me/blog/entry/100066** But how is this helping in finding maximum xor subset from a set? Thanks.

There is another blog https://codeforces.me/blog/entry/68953

Here in practise problem Section ,you can find the solution of this problem with explanation

Thanks a lot bro!

shadow9236

Let the xor of all elements in the array be $$$x$$$. The bits where $$$x$$$ has $$$1$$$, will be set in one subset xor and unset in the other regardless of the choice of subsets. For bits which are unset in $$$x$$$, we can have either them set in both subsets or unset in both. To maximise, just consider all unset bits in $$$x$$$ and find the maximum xor subset over the array.

My doubt lies in your last line, that how do we find maximum xor subset over the array. I saw the atcoder editorial and it was using some canonical row transformation which I was unable to understand that why was it working

striker_46

Can anyone tell how to approach problem h.

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