Это видео недоступно.
Сожалеем об этом.
Codeforces Round 956 Solution Discussion | ABCDEF
HTML-код
- Опубликовано: 17 авг 2024
- Codeforces Round 956 Solution Discussion | ABCDEF
My submissions - codeforces.com...
Community discord server - / discord
LinkedIn - / yt403
Twitter - / aryanc403
Chapters -
00:00:00 - Testing
00:07:45 - A. Array Divisibility
00:16:00 - B. Corner Twist
00:36:00 - Problem C statement
00:37:30 - Lag
00:40:25 - C. Have Your Cake and Eat It Too
00:54:00 - D. Swap Dilemma
01:08:00 - E. I Love Balls
01:16:10 - Lag
01:19:40 - E solution continued
01:36:00 - F. array-value
01:56:00 - Chat QnA
Tags -
#icpc #ioi #codeforces #codeforcessolution #codeforcessolutions #codechef #codechefsolution #codechefsolutiontoday #atcoder #geekforgeeks #topcoder#hackerearth #hackerrank #hackerranksolution #hackerranksolutions #leetcode #leetcodesolutions #leetcodesolution #leetcodecontest
Problem similar to D: codeforces.com/problemset/problem/986/B
great logic for all problems, all intuitive. though the video has sound issue and also the drawing board issue where you are writing.
In problem E, I don't quite understand why you take the average. I mean, I don't understand why you use the average. Could you explain to me?
As usual, very good explanation😘😘
Great Explanation bro 🔥❤️
bro in ques 3 what if we find all the intervals of all the arrays which give the req values (using dynamic sliding window)then from those found intervals we find the non overlapping intervals
No of such intervals can be O(N^2).
Consider a testcase where ai=bi=ci=1. N=100000
Thank you sir
I did not understand how finding minimum xor in a contiguous range L to R, is done by taking (arr[i] & ~msks[j]) ? I watched the video you referred, but unable to extend it here. There we were taking xor of continuous elements. Could you explain the inner for loop in more detail, what each line achieves?
Good question. If you have watched the video, you know that we have some masks, and we want XOR to be subset of those masks.
The idea is XOR(A,B) is submaks of some MSK, if for all the bits that are 0 in MSK, are same for both A,B.
A = A|(~MSK)
B = B|(~MSK)
This keeps only bits not present in MSK.
The symbol used is NOT aka Unary complement (bit inversion) operator.
@@aryanc403 When I tried using binary search with l=0 h=1
Constant factors can be different. My code takes 3/4s time.
super explanation❤🔥❤🔥🔥🔥🔥
A - 5:40
bro do you have any list of question for a beginner to practice that will be very helpful especially for dp
atcoder.jp/contests/dp/tasks
cses.fi/problemset/
@@aryanc403 thanks bro
Aryan can you please help me with this problem :
Find the number of triplets of substrings of string s, such that :
1.the 3 substrings must be non overlapping
2. the 3 substrings must be palindrome individually.
You can use DP for this, where dp[i][k] will be the number of ways you can divide the string up to index i into k non overlapping substrings which are palindrome individually. Now the TC for this would be O(3*n^2). If your constraints satisfy this TC then it's well and good otherwise we might have to think of a better approach.
Poor explanation
Lund explanation