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

КОМЕНТАРІ • 22

  • @toddchaney2454
    @toddchaney2454 3 роки тому +13

    This is better than Avenger: End Games

  • @limakbear325
    @limakbear325 2 роки тому +14

    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

  • @kaushalkumar-ob2mw
    @kaushalkumar-ob2mw 2 роки тому +10

    you are the best teacher I have ever learned from. keep up the good work.

  • @shrayammitra6447
    @shrayammitra6447 3 роки тому +10

    You are just amazing, thanks vm for this, i really struggled with geometry and this is a gem for me

  • @Squirrelschaser
    @Squirrelschaser 3 роки тому +4

    damn this is amazing. Seems like you can solve a lot of problems with just cross product + bounding boxes.

  • @parthapratimmazumder6460
    @parthapratimmazumder6460 3 роки тому +7

    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

  • @RohitSharma-li6hn
    @RohitSharma-li6hn Рік тому +1

    This video is "A blessing from the lord".

  • @AnkitJosh
    @AnkitJosh 3 роки тому +1

    I'm at 2 hours mark. Damm ,keep producing such content Kamil

  • @tejasbagal8068
    @tejasbagal8068 3 роки тому +5

    Thank you for this stream!

  • @aditya_01
    @aditya_01 2 роки тому +2

    really helpful video thank u

  • @bojack_human1110
    @bojack_human1110 3 роки тому +2

    Thanks a lot man

  • @Amritanjali
    @Amritanjali 3 роки тому +5

    Please upload streming Codeforces Problem-Solving (difficulty 1700-2200) on youtube please please

  • @mahamfatima6117
    @mahamfatima6117 6 місяців тому

    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)

  • @anandprakash296
    @anandprakash296 9 місяців тому

    Why didn't you solve 2nd last problem ( problem 6) ??

  • @uddiptakalita3006
    @uddiptakalita3006 7 місяців тому

    2:34:12 Another way to implement convex hull

  • @GGxEpsilon
    @GGxEpsilon 3 роки тому +2

    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.

    • @imranif3899
      @imranif3899 3 роки тому +5

      He is a human, after all. Atleast appreciate his attempt to continue live-streaming for years, just for us.

    • @GGxEpsilon
      @GGxEpsilon 3 роки тому +1

      @@imranif3899 that was a joke man and i do appreciate his hard work.

  • @bitsnation1578
    @bitsnation1578 7 місяців тому

    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