CSES Geometry Problem Set | Coding Live!
Вставка
- Опубліковано 15 січ 2021
- Live coding of 7 geometry problems from cses.fi/problemset. Line segment intersection, polygon area, convex hull, and more.
Streaming schedule: calendar.google.com/calendar/...
- FAQ & GitHub Wiki: github.com/Errichto/youtube/w...
- Discord: / discord
- Twitch: / errichto
- Main YT channel with educational videos: / errichto
This is better than Avenger: End Games
0:00 Intro
2:22 Cross-Product recap
9:04 Point Location Test
27:38 Line Segment Intersection
1:03:07 Polygon Area
1:27:38 Point in Polygon
1:54:43 Polygon Lattice Points
2:09:44 Convex Hull
you are the best teacher I have ever learned from. keep up the good work.
You are just amazing, thanks vm for this, i really struggled with geometry and this is a gem for me
damn this is amazing. Seems like you can solve a lot of problems with just cross product + bounding boxes.
A no 9:05
B no 28:42
C no 1:03:09
D no 1:27:45
E no 1:55:06
G no 2:10:01
This video is "A blessing from the lord".
I'm at 2 hours mark. Damm ,keep producing such content Kamil
Thank you for this stream!
Have you watched it completely? 😁
@@nikhildabhade9334 u know it!!😄
really helpful video thank u
Thanks a lot man
Please upload streming Codeforces Problem-Solving (difficulty 1700-2200) on youtube please please
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)
Why didn't you solve 2nd last problem ( problem 6) ??
2:34:12 Another way to implement convex hull
We want daily streams 🤔 anyways i will try to solve these on my own and if I am stuck , I will look back at your code.
He is a human, after all. Atleast appreciate his attempt to continue live-streaming for years, just for us.
@@imranif3899 that was a joke man and i do appreciate his hard work.
LAST TEST CASE FAILED PLEASE REVIEW IS THERE ANYTHING WRONG??
CSES Problem Set
Point in Polygon
#include
using namespace std;
#include
#include
#define ll long long
ll orientation(paira,pairb,pairc){
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= min(a.first, b.first) && c.first = min(a.second, b.second) && c.second >n>>m;
vectorvertices;
for(ll i=0;i>a>>b;
vertices.push_back({a,b});
}
vectorpoints;
for(ll i=0;i>a>>b;
points.push_back({a,b});
}
for(auto currPoint:points){
pairendpoint=make_pair(INT_MAX,INT_MAX+1ll);
ll cntIntersect=0;
bool boundary=false;
for(ll i=0;i