Mark and His Unfinished Essay || Codeforces Round 807 Div2 Problem C

🔥𝐏𝐚𝐲 𝐀𝐟𝐭𝐞𝐫 𝐏𝐥𝐚𝐜𝐞𝐦𝐞𝐧𝐭
Newton School's 𝐅𝐮𝐥𝐥 𝐒𝐭𝐚𝐜𝐤 𝐂𝐨𝐮𝐫𝐬𝐞 𝟐𝟎𝟐𝟐 - bit.ly/FullSta...
Newton School Official WhatsApp Support Number: [phone]
-----------------------------------------------------------------------------------
📌𝐓𝐞𝐥𝐞𝐠𝐫𝐚𝐦:
📌𝐋𝐢𝐧𝐤𝐞𝐝𝐈𝐧: / newto. .
📌𝐈𝐧𝐬𝐭𝐚𝐠𝐫𝐚𝐦: / newtonschoo. .
📌𝐅𝐚𝐜𝐞𝐛𝐨𝐨𝐤: / newtonschool.co
------- 𝐀𝐛𝐨𝐮𝐭 𝐍𝐞𝐰𝐭𝐨𝐧 𝐒𝐜𝐡𝐨𝐨𝐥 -------
🔵NEWTON SCHOOL is an online Edtech company providing the highest-rated FULL STACK DEVELOPMENT PROGRAM for professionals, graduates, and women.
🌕NEWTON SCHOOL is your gateway to a high-paying tech career in 6 months with Zero fees till placement, transforming you into a rockstar full-stack developer earning 5-40 Lakh per annum salary. Newton School’s students are already working in more than 150+ top companies of India including Zomato, Unacademy, Deloitte, Nutanix, etc.
🔵To watch more videos on programming, Data Structures, Android Development, Data Science, C++, Java, React, subscribe to our channel.
- - - - - - - - - - - - -
If you're reading this far down, hello, you look nice today :)
Mark and His Unfinished Essay || Codeforces Round 807 Div2 Problem C
#NewtonSchool #NS #Fullstack #FSD #Datascience #MS #Postgrad #webdeveloper #programming #programmer #programmers #developer #coder #programmingmemes #coders #coding #frontenddeveloper #backenddeveloper #html #softwaredeveloper #hacking #python

[@SahilNarwal-e7v]

great explanation !! :)

[@AkashKumar-lr6hc]

ur explanations are top notch

[@competitivecoding-newtonsc9601]

Thanks Akash

[@SaurabhGupta-qx8hs]

Top class effort man!😇

[@competitivecoding-newtonsc9601]

Thanks Saurabh

[@imzerofnlol]

is it necessary to calculate the gap every single time, wouldn't it be constant always ? could you please give a sample where I could be wrong

[@yourbestie4138]

really good explanation

[@competitivecoding-newtonsc9601]

Thanks :)

[@mohamedtamer9041]

amazing.thanks alot❤️

[@competitivecoding-newtonsc9601]

Thanks Mohamed

[@utsavaggrawal2697]

thanks sir

[@competitivecoding-newtonsc9601]

Most welcome

[@nimeshsingh6229]

Nice explanation

[@competitivecoding-newtonsc9601]

Thanks

[@rishabh507]

Thanks for the editorial

[@rishabh507]

Flunked today’s contest, 2 WA each on A and B , then 10 WA and no solve on C 🙂

[@rishabh507]

Will upsolve C and D

[@competitivecoding-newtonsc9601]

:)

[@jeevanalexen]

what will be the rating of this problem?

[@whynesspower]

1300

[@competitivecoding-newtonsc9601]

1400ish

[@ДарьяМинакова-м3т]

Thanks a lot

[@competitivecoding-newtonsc9601]

You're welcome:)

[@d_d2813]

Why we cannot really append the string and we can easily find the character ??

[@competitivecoding-newtonsc9601]

Size will become very large, after just 30 operation size will be around 10^9 which is too much.

[@kartikgarg9379]

Thank you bhaiya

[@competitivecoding-newtonsc9601]

No worries Kartik

[@ahmednafis]

hi, whats the name of the app , u use to draw for the explanations?

[@competitivecoding-newtonsc9601]

Windows one note

[@manaskumarpanda3343]

how to approach this type of problem bro ?

[@competitivecoding-newtonsc9601]

See that you can iterate over number of operations but it is impossible to iterate over length of string.

[@asthagupta3813]

What is the rating range of div2 Cs??

[@doodleman5421]

i think it is between 1400 - 1700

[@competitivecoding-newtonsc9601]

1400ish

[@shambhavamchoudhary67]

sir plz upload code too

[@competitivecoding-newtonsc9601]

You can get code from my profile epsilon_573.

[@ayushanandtripathi352]

perfect

[@competitivecoding-newtonsc9601]

Thanks

[@UEIPRAYASHSATPATHY]

for this same type of code i m getting tle in test case 4 #include using namespace std; long long int search(vectortr,long long int idx,int c){ short int s=1,e=c,m; while(sidx){ e=m-1; } else{s=m+1;} } if(tr[m]t; vectorl(41),r(41),tr(41); while(t>0){ int n,c,q; cin>>n>>c>>q; vectora(n); for(int i=0;i>a[i]; } tr[0]=n-1; int i=1; while(i>l[i]>>r[i]; l[i]--;r[i]--; tr[i]=tr[i-1]+1+r[i]-l[i]; i++; } while(q>0){ long long int idx; cin>>idx; idx--; if(idx

[@competitivecoding-newtonsc9601]

Define endl ' ' and use fast input output

[@Negijicoder]

2.5 hour lga diye is ques pr fir bhi ni hora..

[@deepakjoshi4318]

is question ki rating kya hogi

[@competitivecoding-newtonsc9601]

1400ish

[@pratickbhowmick6409]

Didn't understand the explanation.

[@competitivecoding-newtonsc9601]

Which part?

[@pratickbhowmick6409]

@@competitivecoding-newtonsc9601 8:20 To reiterate your explanation before this part, left is the length of the string before carrying out operation c3, and right is the length of the string after c3. Given, index x is somewhere between left and right, you have taken gap = x-left. And l3, r3 are the indices of the substring copied in operation c3. What do you mean by x = l3 + gap?

[@Manishkumar-mw2zw]

Nice explanation