SlavicG's blog

By SlavicG, history, 8 days ago, In English

Thank you for participating!

1676A - Lucky?

Idea: mesanu and SlavicG

Tutorial
Solution

1676B - Equal Candies

Idea: Errichto

Tutorial
Solution

1676C - Most Similar Words

Idea: MikeMirzayanov

Tutorial
Solution

1676D - X-Sum

Idea: mesanu

Tutorial
Solution

1676E - Eating Queries

Idea: mesanu

Tutorial
Solution

1676F - Longest Strike

Idea: MikeMirzayanov

Tutorial
Solution

1676G - White-Black Balanced Subtrees

Idea: MikeMirzayanov

Tutorial
Solution

1676H1 - Maximum Crossings (Easy Version)

Idea: flamestorm

Tutorial
Solution

1676H2 - Maximum Crossings (Hard Version)

Idea: flamestorm

Tutorial
Solution
 
 
 
 
  • Vote: I like it
  • +103
  • Vote: I do not like it

»
8 days ago, # |
Rev. 2   Vote: I like it +25 Vote: I do not like it

It was honor to test this contest.Thanks for the Great round.Also great blog thanks for helping the community.

»
8 days ago, # |
  Vote: I like it +5 Vote: I do not like it

Thanks for the effort, much appreciated!

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

I had another solution for 1676G - White-Black Balanced Subtrees — I used DFS to recursively compute all vertices' values, saved them in an array and then just scanning the array for the vertices that have the equal number of white and black vertices in their subtrees. Maybe this is an easier explanation not containing DP clearly.

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    This approach is DP as well as you are finding and storing all the values for black and white vertices for each subtree and then later only just iterating over all vertices to check which have equal no. of white and black vertices in their subtree. Actually it is quite similar to what is being done in the editorial as well except the fact that they are just finding number of balanced subtrees while doing dfs only and you are just running a separate loop after the dfs.

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

I really threw on C and D cuz I'm bad at determining time complexity.

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    The same with D

    • »
      »
      »
      8 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      For C, I calculated the number of operations as (100 * 50 * 8)^2 instead of (50 * 8)^2 * 100. For D, I assumed that the intended solution was actually O(n^2)

»
8 days ago, # |
  Vote: I like it +2 Vote: I do not like it

my first unrated round and I have solved all of the problem in the contest time. happy coding :) problems were so interesting.

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    wow..i saw ur profile if ur rating was just 12 less, your rating would go like a slingshot , just a little back,,,and so much further.

    • »
      »
      »
      8 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Yes you are right.. but I enjoyed this round. :)

»
8 days ago, # |
Rev. 8   Vote: I like it -8 Vote: I do not like it

156676512 It was working fine and was accepted how can it be hacked I checked everything while submitting

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You have linearly searched for the query in your prefix sums array. While the approach is not wrong, under the given constraints of sum of $$$N$$$ and $$$Q$$$ over all cases to go up to $$$1.5 * 1e5 = 150000$$$, which can cause Time Limit Exceeded (TLE) on higher values, close to the constraint limits.

»
8 days ago, # |
  Vote: I like it -16 Vote: I do not like it

The Time complexity of Problem D O(qlogn+n). But If we calculate for the worst-case according to given constraints then it should be -: 10^7 * 10^3 + 10^7. Also you are not considering the loop for test cases, so according to me its T.C should be. O(T*N*qlogN) However this T.C also not fast. So I am getting this doubt. Please correct me if I am wrong.

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Maybe you have gone through Problem E instead of Problem D, or could have mentioned it otherwise?

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I guess you are talking about problem E but not D.

    It is guaranteed $$$\sum n$$$ and $$$\sum q$$$ over all test cases don't exceed $$$1.5\times10^5$$$, so there's no need to multiply $$$T$$$ when calculating the time complexity.

    On this condition, the time complexity is $$$O(q\log n)\approx 1.5\times 10^5\times 17 = 2.6\times 10^6$$$, it's able to pass easily under the 3.5 seconds time limit.

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

This is the best div 4 contest, for beginners. All problems are completely balanced in terms of difficulty. Expecting more similar div 4 contests in future.

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Got lazy on the last question and didn't do it (especially sinced I had work). Oooo well

»
8 days ago, # |
  Vote: I like it +1 Vote: I do not like it

Great Round, I am really excited to see my new cyan color.

»
8 days ago, # |
  Vote: I like it +4 Vote: I do not like it

E, F and H2 are really good problems.

Nice Div. 4!

»
8 days ago, # |
  Vote: I like it +3 Vote: I do not like it

problem h2 : Has anyone used ordered_set (multiset using pair) (pbds) ??

»
8 days ago, # |
Rev. 2   Vote: I like it +3 Vote: I do not like it

Can someone please help me to understand the ordered_set solution to problem H2? I understand that "order_of_key(k)" returns the number of elements strictly less than k. However, I have seen many solutions that use an ordered_set with a pair to find the number of elements i<j && a[i] >= a[j], like this one:

ordered_set<ll>st;
    for(i = n;i>0;i--)
    {
        ans+=(st.order_of_key({a[i], inf}));
        st.insert({a[i],i});
    }
    cout<<ans<<"\n";

Why does order_of_key(a[i]) not work(to me, it seems that the index is irrelevant), and what is the functionality of pairs in an ordered_set? Any help would be appreciated.

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    To what I can understand, people use pairs so that they do not have to worry about equal values. Since we need to find inversion that might be equal, it is a good idea to use pair<int,int> where every value had its unique index and we can get out answers simply by using order_of_key function call. You can also do this without using pairs, just use greater_equal<int> in your ordered_set typedef and use a map to store equal values.

    • »
      »
      »
      8 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Thanks for the explanation. Your clever usage of maps along with order_of_key() helped me understand what was going on.

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    u can replace less with less_equal for using ordered_multiset

    Here is my submission : https://codeforces.com/contest/1676/submission/156780422

»
8 days ago, # |
  Vote: I like it +6 Vote: I do not like it

I loved the round! The problems all had short and clean implementations, and I had a good take taking the contest.

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

In E the binary search part why did you use l = 1 instead of 0 and r = n instead of n-1 ? I have a problem with boundaries of binary search that costed me 40 minutes :(

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I was in the same situation as you, I was stuck on the dichotomous boundary condition for at least 30 minutes until I remembered a function called lower_bound() ....

    • »
      »
      »
      8 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Yes, I remember it now but still I need to learn how to use my own binary search.

»
8 days ago, # |
  Vote: I like it +3 Vote: I do not like it

thanks a lot for the round. It was great. hope to have many more Div4 rounds like this.

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

The problems of this contest are very good, it is very suitable for people of my level XD

»
8 days ago, # |
  Vote: I like it +91 Vote: I do not like it

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone please explain how the BIT approach works for H2? Or maybe redirect me to some article which explains it well. Thanks.

»
8 days ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Editorial solution for F in python TLE's

»
8 days ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Hi, can someone explain why my nlogn solution failed for problem F. It got accepted during the contest and even after the hacking phase finished it was accepted. But now when I checked (14 hours) after the contest it suddenly got TLE on 18th test case.

  • »
    »
    8 days ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    It's because after the hacking phase is over all the solution are again tested with the test case used in hacks and so is yours, the main reason the worst time complexity is not nlogn it n^2, because the c++ unordered map uses linear data structure in case of collision to search for the elements , ideally it should be nlogn if instead of linear data structure, AVL tree is used which is the case with Java

    • »
      »
      »
      8 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Thank you for the explanation. So is it not suggested to use unordered_map? I usually avoid using ordered map for better time complexity, but if unordered_map is not consistent, should I just stick with ordered map or any other alternative?

      • »
        »
        »
        »
        8 days ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Try to avoid them as much as you can but use ordered map always if Time complexity allows

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone please tell me why its giving tle its very similar to whats given in tutorial here is my submission https://codeforces.com/contest/1676/submission/156791528

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You are getting TLE because rather than iterating over the n values in the array your loop is iterating over all values in mini to maxi which can be very large of the range 10^9 as it is given in the constraints that 1 <= a[i] <= 10^9

»
8 days ago, # |
  Vote: I like it +10 Vote: I do not like it

If you use python and get TLE in problem F, I suggest you read this blog.

https://codeforces.com/blog/entry/101817

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone explain F? I got confused during the contest.

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    you have to output a range L, R

    such that every element between L, R has count greater than equal to k, if there is no element in array its count is considered zero

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Why does solution for F have linear time complexity? Insertion of the new key into map works is logarithmic time, so in the worst case (n different values in the array) it will take O(n log n) time to insert all the keys into map

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

orz

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Can somebody help me with my Solution for question F. It got accepted last night during the contest but it was rejected in the system checking stating that it is giving TLE for Test case 18. My Solution for F

I am basically doing exactly what is mentioned in the editorial but mine is getting TLE.

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

I have experienced some shocking results in F problem where if I use unordered_map it gives me TLE but on using map its working fine! Am I missing something?

  • »
    »
    8 days ago, # ^ |
    Rev. 2   Vote: I like it +3 Vote: I do not like it

    When the value of n is large (usually larger than 10^5) then because there can be high number of collisions so hashmaps gives its worst case time complexity for insertion operations that is O(n) and not O(1) which is why the overall time complexity becomes O(n^2).

    The solution is to use a map as there we don't have a problem of collisions and the time complexity is logn per operation.

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Took me a while because I tried optimising problem D. Didn't realize n*m*(n or m) fits the time limit. Can anyone explain me how do i calculate what constraints take what time for a given big O.

  • »
    »
    8 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Hey, honestly with some experience you start to get a feel for when you can just do pure bruteforce. It's funny, in university, bruteforce is not really liked as it typically denotes a poor solution. I used to do a lot of Leetcode, and rarely is bruteforce the solution needed or would be acceptable (aside from the fact they don't really have that many bruteforce-based questions). So when I got into CP, it was a shift in perspective on when I can or can't do bruteforce based on the constraints.

    You can do some quick math, at worst 200*200 board, so n*m alone will be 4*10^4. Then you will do at most n or m iterations depending on your location, so let's say worst case n and m are 200 again. You have two go over the diagonal twice

    2*200*(4*10^4) = 16*10^6 = 16,000,000 operations at worst. Even then, this is way over since pretty much the middle will be the only one where you iterate the full n or m. Meaning as we are left, right, up, or down from the middle, we have less than 2*200 iterations over diagonal at every other location.

    Now I didn't go through this in my head or used this in my reasoning. Like I said, you do these problems enough and you "know" if bruteforce is fast enough.

»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

The solution to eating queries would be O(NlogN + QlogN). They did not consider the sorting as part of the runtime, only the read in of the numbers.

»
7 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Nice div. 4! I love the problems solutions!

»
7 days ago, # |
  Vote: I like it 0 Vote: I do not like it

I really couldnt understand the 1676C problem. Can someone care to explain the algorithm?

»
7 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Please can you tell me what my submission giving TLE ?

Submission

»
7 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Hi mesanu, for D. X-Sum my python code got TLE. I looked up the editorial, it looked similar to mine. Is it a language problem (like I have to use C++ rather than python) or I am missing something in my code?

My submission Id: 156738601

Thanks!

  • »
    »
    7 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You don't have to use c++. Try submitting in pypy 3, it is way faster.

»
7 days ago, # |
  Vote: I like it +1 Vote: I do not like it

The time complexity of F is not O(n) as mentioned in the solution, its O(n * log(n)) since we need to sort the array.

»
7 days ago, # |
  Vote: I like it 0 Vote: I do not like it

This was my first contest. I am very happy and confident after solving the problems. Thanks !

»
7 days ago, # |
  Vote: I like it 0 Vote: I do not like it

The g question why java is used in the tle code as follows https://codeforces.com/contest/1676/submission/156893634

»
7 days ago, # |
  Vote: I like it 0 Vote: I do not like it

For problem H1, The answer to the first test case should be 7, right? See the explanation image: https://ibb.co/vhHypG6

7 4 1 4 6 7 7 5

Why it is showing 6 over there?

»
7 days ago, # |
  Vote: I like it 0 Vote: I do not like it

I would like to know in H2 why many people's programs output 0 or RE for this set of data (it's answer should be 2, right?) 1 3 4 1 3

»
6 days ago, # |
  Vote: I like it 0 Vote: I do not like it

H2 is really a good problem to solve :)

»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

In solution do why is doing now-=a[i][j]*3

»
4 days ago, # |
Rev. 3   Vote: I like it 0 Vote: I do not like it

I'm getting WA on test 2 for Longest Strike, can someone help: The code is:-

{
        long long l = 0 ; long long r=0; long long maxD = -1; 
        long long maxL = 0; long long maxR = 0; long long counter = 0; 

        for(it ; it != m1.end() ; it++){  
            if(it->second >= k && l==0) {
                l = r = it->first;
            }
            if(it->second >= k && it->first == r+1) {
                r = it->first;
            }
            else if(k > it->second){
                long long diff = r-l; 
                if(diff>maxD){
                    maxL = l; maxR = r;
                    maxD = diff;
                } 
                l = 0; r = 0;
                counter++;
            }   }
        if(counter == m1.size()) cout<<"-1"<<endl;
        else if((maxR-maxL)<=(r-l) && r>maxR) cout<<l<<" "<<r<<endl;
        else if((maxR-maxL)>=(r-l)) cout<<maxL<<" "<<maxR<<endl; }