I am Back | Codeforces Edu Round 132 | Post Contest Discussion | Solutions to Problems A, B, C, D

[@PriyanshAgarwal]

Sorry for the lag in the middle at some places. I need to configure my OBS Studio to act in the way it used to long time back. Overall yes, planning to be more active on this channel now. Let's Goooooooooo

[@abhisekmohanty7386]

How do we attend the zoom meets ?

[@rishav144]

thanks priyansh ....looking forward to upcoming codeforces contests 🔥

[@allmighty2000]

Not only back , and talk about you recent two good contests! You rock! I guess it's your time to shine and reach MASTERS in codeforces as soon as possible.

[@girishbhargava6367]

Thanks a ton, man. Feels great to see your productive and intuitive videos.

[@amateursoundz6262]

Problem D was the first time I ever used segment tree in a contest! In my opinion, it was a problem that showed how the data structure can be applied beyond in a trivial way.

[@srijitmondal4190]

Try the problem ahoy pirates from UVA oj 😁

[@satyampatidar5848]

29:30 what a prove: i was struggling with that

[@rishav144]

thanks priyansh ....looking forward to upcoming codeforces contests 🔥

[@arijitdey8419]

superb explanation for problem c...hats off and thanks a lot for the post contest discussion

[@chandraveersingh5561]

Welcome back bhaiya!

[@mathematics6199]

D can be done using sparse table, and d was easier than c

[@devilronak7262]

Congrats for MASTER in codechef 😏😏😏

[@as4928]

39:00 I did the same and couldn't find why it was giving wa

[@orewaluffy1374]

Thanks a lot bhaiya , this vedios help a lot.

[@saqibali-ku4hr]

Thankx for breaking it down.. great tutorial for beginners

[@sahilanand30]

King is back 👑

[@9-teen77]

Welcome back buddy❤️

[@shri9229]

ty ty ty

[@devendrajadhav4104]

mera ye first contest tha, i solved the first problem, but on my profile it still says unrated and contests mai bhi kuch nhi dikh raha

[@nocode659]

legend is back

[@TarunKumar-cn6in]

Thanks so much for post contest discussion 🙂

[@crustycrabs577]

Nice explanation 😀

[@samwaadvivaad8607]

Please keep this good work👍

[@nagendrababu8869]

i was able to solve only a, b problems in 45 minutes and i tried to c half an hour but later i gave up

[@yeswanthh5068]

Plss make more such videos

[@rudranilacharya5293]

Hello sir, I am in my first year and i have recently started cp, here is my approach for a, I thought it was simpler, for every door I am storing the key given for it in a map named ans, and now in a set I will insert x, the given key and then insert ans[x] and ans[ans[x]], now if in the set 1 2 and 3 are present, I print yes otherwise not. Also I wanted to ask for some advice, I have been solving 1200-1300 ques for a month now but I am not able to solve div 2 c in the contest, very rarely sometimes, what should I do for it?

[@dakshsingh5891]

hey, actually div2 c questions are rated around 1400-1500 most of the time, thus try to practice more in this range.

[@rudranilacharya5293]

@@dakshsingh5891 okay sir , thank you!

[@xcoder420]

The Real OG Is Back.

[@ajeetstationajeet]

Make a video describing your syntax template or different helpful macros

[@abhisekmohanty7386]

How to attend the zoom calls ?

[@Sa-So]

Crazy how you're getting views even at 1pm ;) btw nice approach for C

[@PriyanshAgarwal]

I was wondering the same... I thought all the subscribers would be gone, now that I am uploading a video after 3 months

[@rachitgarg12]

@@PriyanshAgarwal maybe it's a thing that programmers sleep time is after 3am😂😂,

[@yousefsameh4622]

best up solving video

[@SouravKumar-rg4yj]

king is back 🤩

[@nikhilkumarv2577]

It would be really helpfull, if u tell after solving each problem wt concept do we have to know in order solve that problem 🙏🏻

[@ayushwalker2003]

Apka face video bhaiya, solution ke upar aarha hai.. can you please make it a little small... Otherwise OP Explation..🔥🔥🔥

[@PriyanshAgarwal]

Sorry I didn't configure everything properly. Will be careful from the next one. Thanks for the suggestion.

[@devsagar5812]

danke mi man

[@abhijeetfasate6131]

When will tle eliminators 7 start?

[@aayushdhankecha1056]

Hey Priyansh, I am pupil on codeforces , My I'd (aayushdhankecha) , I can't solve problems (rating>=1500). What should I do ? If I need to learn some topics, then please recommend.

[@animeshsingh7060]

hi wanted to know, how to join these post contest online calls? and on which app are these hosted. got to learn so much from this

[@sidforreal]

Can we expect leetcode contest only hard problem discussions as well?

[@anshshah4927]

Greedy sucks. You can't arrive at your solution until you prove why it works. And if you try without proving you can get penalties

[@jeevanalexen]

can you explain why this implementation for D is giving tle at test case 11 #include using namespace std; void build(int si, int ss, int se, vector &st, int arr[]){ if(ss == se){ st[si] = arr[ss]; return; } int mid = (ss+se)/2; build(si*2, ss, mid, st, arr); build(si*2+1, mid+1, se, st, arr); st[si] = max(st[si*2], st[si*2+1]); } int query(int si, int ss, int se, int qs, int qe, vector &st){ if(qe < ss or qs > se) return -(1e9); if(ss >= qs and se > n >> m; int arr[m+1]; int x = (int)(ceil(log2(m))); int max_size = 2*(int)pow(2, x) + 1; //cout > q; while(q--){ int sr, sc, er, ec, k; cin >> sr >> sc >> er >> ec >> k; int p = query(1, 1, m, min(sc, ec), max(ec, sc), st); bool check = true; if(abs(sr-er)%k != 0 or abs(sc-ec)%k != 0) check = false; if(sr

[@aaravarya4406]

Use fast i/o it won't get you tle. ios_base::sync_with_stdio(false); cin.tie(nullptr);

[@jeevanalexen]

@@aaravarya4406 wow, thanks

[@gdthegreat]

thanks bro, how do we join your zoom classes? earlier I saw we could get enroll in your live course, but now can't see option, just curious to know.

[@gurijaladinesh4600]

it's called TLE eliminators, and the classes happen weekly and he only teaches a particular topic, not every topic

[@gdthegreat]

@@gurijaladinesh4600 thanks

[@rashidaziz2215]

How can I join the discussion?

[@rishav144]

discord

[@gsa3194]

Which month next(TLE) batch will start?

[@PriyanshAgarwal]

Aug 14

[@gsa3194]

@@PriyanshAgarwal Okay! Thankyou

[@realnight_bot2536]

😀😀

[@narendrapandey5820]

Problem C- homework Total no. of valid RBS I think it's a binary search on answer + pnc Please reply! If I'm guessing correct then I'll try to solve this

[@anunay_sharma]

how to get as good as you

[@PriyanshAgarwal]

Kill me. It is COMPETITIVE programming you see. If all the people better than you die, you're number 1👀

[@anunay_sharma]

@@PriyanshAgarwal good idea

[@LegitGamer2345]

@@PriyanshAgarwal 😂😂

[@bs04anishmakhija84]

Kya matlab me first comment krunga to me cool nahi lgunga😳

[@rohangangwar6604]

mine for first- int givenKey; cin >> givenKey; int arr[3]; fr(i, 0, 3)cin >> arr[i]; int ct = 2; while (ct--) { if (arr[givenKey - 1] == 0) { cout

[@priyamagarwal3469]

top most row point will be xs+ ((n-xs)/k*)k

[@PriyanshAgarwal]

Yess boss.