Very useful stream, dziękuję!

239wpm is my record. 95% accuracy

When you've reached a point that you understand everything and start stressing about things that you can only understand.

🥇💝💝👩🏼‍❤️‍💋‍👨🏼👩🏻‍❤️‍👨🏻👨‍👩‍👧👨‍👩‍👧💞🇮🇳🚠👰🏻‍♀️👰🏻‍♀️🏏🏠🏠🏏👨🏻‍🎓🥥🏠

Is it me or emplace_back was nicer to avoid calling copy constructor 17:20

What about binary search overflow by using mid = L+R /2 formula instead of R-L

Awesome!!

I tried to join the discord server but I got expired invitation message

Your video is useless. Even in full screen I cannot see what you are doing - fonts are too small and too fuzzy. Also, STOP mumbling as I cannot understand what you are mumbling about.

in teory, binary search is simple, but when im trying to solve binary search problem, i absolute don't know how to implement the teory, and i found this video.

I finished all 3 b2back, binary lifting, rmq and segment trees, i feel powdered

Watching in 2024, still as refreshing.❤

Man I miss this guy, wish he restarts

Does it required to understand how the dp array grows on every call?

ukposts.info/have/v-deo/iad_Ya2chYmjops.html 3 years ago Errichto said that Machine Learning cannot solve problems like that and we are at least 10 years away from it. Meantime ChatGPT solves this problem beautifully.

read about islam man❤

Can you please make a video on centroid decomposition

Do you think there is a problem on codeforces that you cannot solve ? and how many problems have you solved on codeforces ?

wow great implementation of gaussian, i never knew thanks.

Can you please do a video on centroid decomposition and solve some problems on it ?

How to add div-2 like scoring system in gym mashup i.e. penalties

my name is patrick bateman

and like everything feels so concrete after you claim a thing :) with other teachers there is still a 1% of doubt left in mind if they claim something which is not that easily acceptable even if its correct..but when you claim something, my mind refuses any intent of not believing it automatically and can so easily accept and trust you

there is a whole different vibe studying from you :) honestly....so grateful for people like you who contribute sm to the community after acing a particular skill... _/\_ orz SIR

Thank you!

they all seems in there late 20's or 30's and there CF says they are doing it from more than decade .They are GOD Man and ,Radewoosh looks like Klaus Mikaleson

legends brain fight ohh WOW

Can anyone please tell which software is he using for the notes?

I felt like watching Oppenheimer Cs version

While you are checking collinear What if the line segment 1 is (3,4) - (5,7) And line segment 2 is (-2,-1) - (2,3)

oh mr richto back again?

We need more content like this

Hes back

welcome back 😁

Erricto please create some videos on graphs and tree in basic level please

Great to see u again ❤

errichto comeback ?

Why dont icpc get non Chinese companies to sponsor them like meta, or may be nvidia.

You solve problems faster than I can read lol. Where do you work?

will u be resuming coding streams ?

Bro is talking to himself

Awesome video!

adding timestamps can make it good @errichto thank you for such content <3

LAST TEST CASE FAILED PLEASE REVIEW IS THERE ANYTHING WRONG?? CSES Problem Set Point in Polygon #include <iostream> using namespace std; #include <vector> #include<bits/stdc++.h> #define ll long long ll orientation(pair<ll,ll>a,pair<ll,ll>b,pair<ll,ll>c){ ll x1=a.first; ll y1=a.second; ll x2=b.first; ll y2=b.second; ll x3=c.first; ll y3=c.second; ll sigma=(y2-y1)*(x3-x2)-(y3-y2)*(x2-x1); if(sigma==0)return 0; else if(sigma<0)return 1; return 2; } bool onSegment(pair<ll,ll> a, pair<ll,ll> b, pair<ll,ll> c){ if ((c.first >= min(a.first, b.first) && c.first <= max(a.first, b.first)) && (c.second >= min(a.second, b.second) && c.second <= max(a.second, b.second))) { return true; } return false; } bool intersects(pair<ll,ll>a,pair<ll,ll>b,pair<ll,ll>c,pair<ll,ll>d){ ll d1=orientation(a,b,c); ll d2=orientation(a,b,d); ll d3=orientation(c,d,a); ll d4=orientation(c,d,b); if(d1!=d2&&d3!=d4)return true; return false; } void solve(){ ll n,m; cin>>n>>m; vector<pair<ll,ll>>vertices; for(ll i=0;i<n;i++){ ll a,b; cin>>a>>b; vertices.push_back({a,b}); } vector<pair<ll,ll>>points; for(ll i=0;i<m;i++){ ll a,b; cin>>a>>b; points.push_back({a,b}); } for(auto currPoint:points){ pair<ll,ll>endpoint=make_pair(INT_MAX,INT_MAX+1ll); ll cntIntersect=0; bool boundary=false; for(ll i=0;i<n;++i){ pair<ll,ll>a=vertices[i]; pair<ll,ll>b=vertices[(i+1)%n]; if(orientation(a,b,currPoint)==0&&onSegment(a,b,currPoint)){ boundary=true; break; } if(intersects(a,b,currPoint,endpoint)){ cntIntersect++; } } if(boundary){ cout<<"BOUNDARY"<<endl; } else if((cntIntersect%2)==0){ cout<<"OUTSIDE"<<endl; } else cout<<"INSIDE"<<endl; } return; } int main(){ solve(); return 0; }

They both are op

2:34:12 Another way to implement convex hull

why do you use gen.cpp ?

❤❤❤

Hi! Kindly asking for uploads on IOI 2023 lectures

Ur code will fail if u will be asked to update some node to -1.