Codeforces Round 954 (Div. 3) || Editorial for Problem A,B,C,D,E,F

Поделиться
HTML-код
  • Опубликовано: 26 авг 2024

Комментарии • 25

  • @dewsara2888
    @dewsara2888 2 месяца назад +2

    You have explained E very very well. Thanks a lot for your help.

    • @nicspyy
      @nicspyy  2 месяца назад +1

      You are most welcome

  • @user-mk4su7dl3g
    @user-mk4su7dl3g Месяц назад +2

    Really helpful but a suggestion would be to please elaborate on intuition p.s. loved your videos

    • @nicspyy
      @nicspyy  Месяц назад +1

      Great suggestion!

  • @ujjwalagrawalvideos
    @ujjwalagrawalvideos 29 дней назад +1

    nicely explained

    • @nicspyy
      @nicspyy  29 дней назад +1

      @@ujjwalagrawalvideos thanks

  • @ronakkriplani1838
    @ronakkriplani1838 Месяц назад +1

    very niceeeee 🔥🔥🔥🔥🔥🔥🔥🔥

  • @aviralyadav8798
    @aviralyadav8798 2 месяца назад +1

    @nicspy your explanation is really to the point, I dont agree with other's keep posting editorials it is really helpful.

    • @nicspyy
      @nicspyy  2 месяца назад +2

      🚀🚀🫡

  • @user-kl3qv1sc8k
    @user-kl3qv1sc8k 2 месяца назад +1

    great explaination! please mention your codeforces id

  • @ashish3487
    @ashish3487 2 месяца назад +1

    one suggestion from my side please thoda sa code ka dry run bhi kraya kro bhaiya... logic clear hojata hai but baad me code dikkat krta hai kahin kahin jagah

    • @nicspyy
      @nicspyy  2 месяца назад +1

      okay sure, Will make sure from next time 👍

  • @nicspyy
    @nicspyy  2 месяца назад +1

    A solution:
    void solve(){

    int a,b,c;
    cin>>a>>b>>c;

    vector arr = {a, b, c};
    sort(all(arr));

    coutm;

    vector a(n, vector(m, 0));
    forn(i,0,n){
    forn(j,0,m) cin>>a[i][j];
    }

    for(int i=0; i a[i][j+1]) mini = max(mini, a[i][j+1]);
    else continue;
    }
    if(i-1 >= 0){
    if(x > a[i-1][j]) mini = max(mini, a[i-1][j]);
    else continue;
    }
    if(j-1 >= 0){
    if(x > a[i][j-1]) mini = max(mini, a[i][j-1]);
    else continue;
    }
    a[i][j] = mini;
    }
    }
    for(auto i: a){
    for(auto j: i){
    coutstr;

    vi a(m);
    forn(i,0,m){
    cin>>a[i];
    a[i]--;
    }
    string c;
    cin>>c;

    sort(all(c));
    map mp;
    for(auto i: a) mp[i] = str[i];

    int ind = 0;
    for(auto &i: mp){
    i.second = c[ind++];
    }

    // for(auto i: mp){
    // cout

  • @AmanSinghRawat-ug6fr
    @AmanSinghRawat-ug6fr 2 месяца назад +1

    good explanations

    • @nicspyy
      @nicspyy  2 месяца назад +1

      thanks bro 😁

  • @AmanSinghRawat-ug6fr
    @AmanSinghRawat-ug6fr 2 месяца назад +1

    bro if you can explain in hindi please try because it makes easy to understand the solution and approach . your explanation is good but you explain slightly faster try to make you explanation speed little slow

    • @nicspyy
      @nicspyy  2 месяца назад +2

      there are lots of feedback, good to see that,
      Ya buddy don't worry will improve for sure ⭐👍

  • @premangraithatha8273
    @premangraithatha8273 Месяц назад +1

    bhai time stamp add kar de

  • @yummytoeat3433
    @yummytoeat3433 2 месяца назад +1

    I guess you should explain ur code properly. Then 100% ur channel will grow very fast

    • @nicspyy
      @nicspyy  2 месяца назад +1

      thanks for feedback, and in what questions you felt that i lack in explanation

    • @user-ik5bi1bc3n
      @user-ik5bi1bc3n 2 месяца назад +1

      @@nicspyy all and probably ur 2nd code is wrong

    • @nicspyy
      @nicspyy  2 месяца назад +1

      @@user-ik5bi1bc3n none is wrong, probably you haven't copied it correctly