jonathan-uy / cses-solutions Goto Github PK

View Code? Open in Web Editor NEW

419.0 419.0 136.0 364 KB

Accepted Solutions to the CSES Competitive Programming Problem Set

C++ 100.00%

algorithms algorithms-and-data-structures competitive-programming cpp cses-solutions

cses-solutions's People

Contributors

Stargazers

Watchers

Forkers

akshitm169 mrmuffin157 shankar9834 architkumar1 daniel777y vrnsbharadhwaj satyamitra edju03 lucifer7355 sajeeree aryanbhat ka1pe5h gattu-karthik ravisritejakuriseti harsh3107-02 twopieare rahulsid55 quant108 pratikdevlekar sunliho khushi-mineeyar abhishekgupta368 rakshitsharmaa vivek-lahole dzungtum shinchan16 anugrahyadav mh-13 piggypiggyrun 1someshverma utkarsh1210-tech jicanta jaydevsharma sabertoaster kostekgol bipplavtiwari alomgir27 wenatnyu sum28it shashankyadava sidd-github-codes abidh8820 future-outlier future-outliers sanskar6000 dragonstar712 prami1806 tokiesan rochisha0 krishnaagarwal2001 jpsxlr8 prabhatravi icedaway hamzawy63 s-pzhang arthavruksha workrit therealakhil2222 quanbuianh sishir2001 luvyrself siddhant-sarkar ayushlath ramanujdas venkatchinmay krishkumar3004 ntarsis30 saavrm26 dadoudou1 slyderek avivblattner ashishkingdom humblef-oo-l mohamtahab karan345 lispwizard anchaliya75 dhananjay-biyani lalwalataukir satyamrawat625 niketh23 jjentaa reala10n presidentsam100 chintansuthar72 iamvibhavtripathi kingcode28 gauridahake24 urrg thiemhoang4807 nagiur anjali29singh anubhav100rao kushagra164 mhayter kinzs2001 jingxianlin arush414 vdahiya aryangauravjain

cses-solutions's Issues

What does "rt" stands for?

CSES-Solutions/Graph Algorithms/Giant Pizza.cpp

Line 8 in 3d17634

int N, M, K, in[maxN], rt[maxN];

hi I stuck at this problem for quite a long time (coding company - cses), I really need to understand the newk. For example, the sample input /output in cses: 3 2/ 2 5 3. so from dp[0][0][0] there is a way to caculate dp[1][1][0], the newk is 0 which is easy to understand, but for example we consider a case that to i = 1, the numer of unfinished team: 1, and k = 0, the case is: {2) [ ')' mean haven't finished yet] so
from dp[1][1][0] simultaneously it leads to dp[2][2][1], this is where I stuck, i mean from the case that have 1 unfinished team and zero penalty how can it becomes 2 unfinished team and penalty = 1 because i think 2 unfinished team is {2), and {3) or i am misunderstanding and the team is {2,3) and (} which is a team that don't have anyone? which is the case, please help me.