shishyando's blog

Codeforces Round #708 Editorial
By shishyando, history, 4 years ago, translation, In English

We are really sorry to make the round unrated. Anyway, we hope that you enjoyed the problems!

1497A - Meximization

Idea: shishyando

Tutorial
Implementation

1497B - M-arrays

Idea: Artyom123

Tutorial
Implementation

1497C1 - k-LCM (easy version)

Idea: shishyando

Tutorial
Implementation

1497C2 - k-LCM (hard version)

Idea: isaf27

Tutorial
Implementation

1497D - Genius

Idea: shishyando

Tutorial
Implementation

1497E1 - Square-Free Division (easy version)

Idea: Artyom123

Tutorial
Implementation

1497E2 - Square-Free Division (hard version)

Idea: isaf27

Tutorial
Implementation
  • Vote: I like it
  • +334
  • Vote: I do not like it

Comments Comments (78)
| Write comment?
»
4 years ago, # |
  Vote: I like it +29 Vote: I do not like it

SpeedForces

→ Reply
»
4 years ago, # |
← Rev. 2   Vote: I like it +7 Vote: I do not like it

Point distribution was weird imo but Questions were really good tho.

→ Reply
»
4 years ago, # |
  Vote: I like it +22 Vote: I do not like it

For C2 — legend+ary

→ Reply
»
4 years ago, # |
← Rev. 2   Vote: I like it +15 Vote: I do not like it

Problem A — Implementation based

Problem B — Implementation | Constructive (Great Problem)

Problem C1,C2 — Intuitive | Constructive (Make Cases and you are done with both problems)

Problem E1 — Simply Math | Implementation (Prime factorization)

A great Round shishyando and Artyom123 with great and interesting problems. Hope to see your next round soon !!

→ Reply
»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it

E2 and D are interesting problems overall.

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    I think so. I am not able solve the problems, but reading the resulotion helps me a lot in understanding usage of DP. Love this round so much!

    → Reply
»
4 years ago, # |
  Vote: I like it +2 Vote: I do not like it

Really liked the problems.

→ Reply
»
4 years ago, # |
  Vote: I like it +418 Vote: I do not like it

Though I'm a tester, I want to say that C1 is the very beautiful hint for C2! Without C1, C2 can be the hardest problem in the contest.

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it -9 Vote: I do not like it

    Agreed, I literally copied my code from C1, made minor changes, then submitted C2.

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone explain in detail math behind C1?

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it +11 Vote: I do not like it

    It was simple first if n is odd then just print 1 n/2 n/2

    if n is even then check for if n/2 is even then print n/2 n/4 n/4 if n/2 is odd then print (n/2)-1 (n/2)-1 2

    we can extend this same logic in C2 by simply printing 1 , (k-3) times then taking n=n-(k-3) in C1

    → Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    n can be of the form 4*k , 4*k+1 , 4*k+2 , 4*k+3 (for some k>=0) case 1: n = 4*k ans = k ,k, 2*k LCM = 2*k

    case 2: n = 4*k+1 ans = 1 ,2k ,2k LCM = 2k

    case 3: n= 4*k+2 ans = 2 , 2k , 2k LCM = 2k

    case 4: n = 4k+3 ans = 1 , 2k+1 , 2k+1 LCM = 2k+1

    → Reply
»
4 years ago, # |
  Vote: I like it +72 Vote: I do not like it

I went straight to C(hard) without looking at C(easy) since I didn't want to be misled by some simple solution that only worked for simple testcases but not hard ones... instead I fumbled around for an hour looking for a general solution without realizing the k=3 case is all you need. That really backfired on me.

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it +2 Vote: I do not like it

    The scoring distribution: 500 — 750 — (750 + 500) — 1750 — (1500 + 1500) It was pretty much clear, C1 was supposed to be harder

    → Reply
»
4 years ago, # |
← Rev. 4   Vote: I like it +22 Vote: I do not like it

At the risk of my submission soon being systested, I think E2 can be solved greedily.

Construct the greedy intervals from E1. Then, at most K times, consider all pairs of adjacent intervals. Compute the number of changes needed to merge all pairs of adjacent intervals in $$$O(n)$$$ and then just merge the best one, and update the array so that excess is put at impossible values.

It works because in the solution you will never remove a value completely from an interval. So taking suboptimal merger will never help since it isn't actually going to reduce a merging cost.

Since you always make at least one change, you repeat at most $$$k$$$ times so it is $$$O(nk)$$$. I think it can be optimised to $$$O(n)$$$.

UPD: I think it cannot be optimised to $$$O(n)$$$, sorry. I thought that maybe you could save computation by only calculating the effect of the merger rather than recalculating every cost, but that's still $$$O(n)$$$.

UPD2: WA47, I wonder if greedy is just wrong here or it's a problem with the code...

UPD3: Assuming that you are merging intervals, the solution is optimal. However, it is also possible to split up an interval, so it does not work.

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +11 Vote: I do not like it

    Can you explain a bit more in detail about splitting intervals? I had the same reasoning and (theoretical) solution as you as well as WA47 and would like to know what the logical error is.

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +15 Vote: I do not like it

      Say there are just three intervals originally. The greedy solution wants to subsume the middle interval into either the left or the right interval. However, it is also possible to subsume the left part of the middle interval into the left interval and the right part of the middle interval into the right interval. It is possible that this is less costly.

      → Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    what do you mean by best one? does it mean that bigger the interval, the better it is? or anything else? btw approach is nice. Thank you !!

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Thank you for the problems!

→ Reply
»
4 years ago, # |
  Vote: I like it +20 Vote: I do not like it

even despite unrated, this was the best round ive taken in a while. clean and concise problem statements. thank you so much for the round. :D

→ Reply
»
4 years ago, # |
  Vote: I like it +7 Vote: I do not like it

Checkout this problem for a variant on problem A.

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I recalled the problem while giving the round today, lovely coincidence.

    → Reply
»
4 years ago, # |
  Vote: I like it +1 Vote: I do not like it

What are "constructive" problems? can anyone tell. how to become good at these?

→ Reply
»
4 years ago, # |
  Vote: I like it +23 Vote: I do not like it

"...it is easy to see that..."

Writing that sentence is like begging for downvotes. Remember, editorials are written for those not able to solve the problem. Telling them how easy it is is no good idea.

→ Reply
»
4 years ago, # |
  Vote: I like it +11 Vote: I do not like it

From problem D: "Then in binary form weight has its k-th bit set true if and only if j < k < i" Shouldn't it be j <= k < i ? Because we have for example 10000 — 00100 = 01100

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Thanks for the round, although I couldn't participate.

Problem D is beautiful.

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is it ok that i got TL in E2 with O(nk log n + max(a_i)) complexity ?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Is your max(a_i) per test case, or in total? If it's per test case, then it would be O(nklogn+max(a_i)t) which is too much

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      it's in total, I need it to precalculate prime numbers which are less than 1e7, I passed E1 that way.

      → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Help needed 110230087 for problem 1497B - M-arrays

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Your Solution is failing for testcase:

    1
4 7
3 4 3 4 
Your Output: 0
Correct : 1

    Corrected 110257624,
    Just changed m/2 to (m+1)/2 in FOR loop

    → Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You also have one more mistake.

    If i=0 => m-i=m, but m can not be a reminder by mod m. So you have to check v[i] and v[(m-i)%m].

    → Reply
»
4 years ago, # |
  Vote: I like it +5 Vote: I do not like it

For me C2 strikes so fast even I hadn't thought of it...it just dropped from the sky :)

Simply, considering 1 1 1 1 ... upto k-3 and the C2 becomes C1

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    I think if there was no C1 then people may have a hard time coming to this solution for C2.

    → Reply
»
4 years ago, # |
  Vote: I like it +1 Vote: I do not like it

The dp of E2 can be solved in O(nk). https://codeforces.me/contest/1497/submission/110252728

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

What is the reason for the unusual memory limit in Problem D?

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    I'm assuming the reason was to prevent the more obvious solution with a dp[n][n] table, which would need to store up to 25,000,000 ints = 100 megabytes.

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Why it is necessary to use map instead of unordered_map in 1497B - M-arrays? I submitted both versions but only map got AC but unordered_map one got WA on test 3. map version-> 110262091 unordered_map version-> 110262159

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    Using cnt[i] may create a new element (cnt[i]=0) in map. And it may cause rehashing of unordered_map, iterators are invalidated (see "Iterator invalidation" here), and for-loop continues working with invalid iterators, which causes undefined behaviour. In usual map creating new element does not invalidate iterators, so UB won't happen. But u still got lucky that these extra zeroes in your map don't change result of your program.

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I really like how C1 is a hint for C2.

→ Reply
»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it

C1 750pts

C2 500pts

→ Reply
»
4 years ago, # |
  Vote: I like it +54 Vote: I do not like it

Problem E is similar to this problem.

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

If Only I submitted C1 after My C2 was accepted!

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

i am curious while doing C1,C2 problem how people were able to come up with the idea of for n%2 == 0 ans is n/2,n/2,2 and for n%4 == 0 ans is n/2-1,n/2-1,2 and so on.During the contest I made a pattern for 1 to 11 but i was unable to intutively guess this solution .Can anyone recommend the problems that i can do for increasing my intution for doing this type of problems thanks

→ Reply
  • »
    »
    3 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    sorry for late response.I made a patter up to 23 before getting the right answer. My cases was if n is a multiple of 3 we done (n / 3, n / 3, n / 3), and it was difficult after that. I sais to myself it the limit is n / 2 i will try to be near to n / 2. and for each number i put n / 2 and see what can be done. I think the best is to go up to a limit (say 50) and if you don't see a pattern maybe it's not the right solution.

    → Reply
»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it

There is an $$$O(nk)$$$ dp solution in Problme E2.

At first, we can let $$$a[i]=mask(a[i])$$$. Assume $$$dp[i][j]$$$ denotes we consider the first $$$i$$$ positions, after making $$$j$$$ changes, the minimum answer we can get and the maximum position where the begining of the last segment at. So we can just maintain $$$last[i]$$$ which denotes the maximum position $$$j$$$ where $$$a_j=a_i$$$ (expecially, if $$$a_i=0,last[i]=i-1$$$) and make transfers.

The key observation in the solution is that if we change the number $$$a_i=x$$$, and for the first $$$j>i,a_j=x$$$, we should let $$$last[j]=last[i]$$$. But actually, there is no need to do that, we can still get the right answer.

See the code for details.

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Stuck in E1. In sample test case 1, should't answer be 2 ? Isn't it valid -> (18, 6, 4), (2, 1) ?

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      We can't change the order of the sequence while dividing.

      → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone tell me how to reach to the solution for $$$C2$$$. I am asking this because $$$C1$$$ made a path for $$$C2$$$. So, can someone give some mathematical proof or logical way to approach such problem

→ Reply
  • »
    »
    3 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Achieving lcm of n / 2 lead intuitively (to me) to take n / 2 everywhere. now we can see that we can put n / 2 at most 2 time and i will remain a 1 case left.(that leads to k = 3 case). you can also think i put the same number some number of time and i put 1 everywhere since 1 does not increase the lcm. But i think it's very difficult to figure out alone without a hint.

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

for the tutorial for c2,

(1+1+...+1)+(a+b+c)=(k−3)+(n−k−3)=n.

shouldn't it be (k-3) + n-(k-3) or (k-3) + n — k + 3?

→ Reply
»
4 years ago, # |
← Rev. 2   Vote: I like it +13 Vote: I do not like it

Here is another $$$\mathcal{O}(nk)$$$ solution to 1497E2 - Square-Free Division (hard version).

For the first part, after normalization, instead of left[i][j] which is a bit bothering, we only need to find pre[i], which is the rightmost index to the left of the current index that shares the same value as the current index. This is very simple.

Then for the second part, for each change number j, we store best[j] denoting the minimal pair (segs,-last_start), and second_best[j] denoting the second minimal pair (segs,-last_start). Here last_start is the start index of the last open segment, and segs is the number of segments.

During the DP, if the last open segment can contain the new element, everything remains the same. Otherwise, we choose either to start a new segment (so that j does not change), or to change the current element (so that j becomes j+1).

Note that there would be cases that second_best becomes better than best, in which they should be swapped.

Code: 110279809

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Can we solve it using binary search + greedy?

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I do not know whether it is possible, but I think that would be hard.

      → Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You may solve our problem here using your observation.

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

For C1 wasn't there suppose to be a case when n % 3 == 0.The answear would be then n / 3 , n / 3, n / 3?

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    You could analyze that, but that is not needed. The solution explained in the editorial says if n is odd you do A and if n is even you do B, no need to add more cases. This is a typical bad practice from beginners.

    If n is a multiple of 13 you could answer 6*n/13, 6*n/13, n/13. But it would be silly to add such a case

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Now let's relax dp values. When we consider an edge {i,j},tagi≠tagj we try to solve problem i after solving dpj problems ending with j, and problem i after solving dpi problems ending with i. It means that dpi=max(dpi,dpj+p), dpj=max(dpj,dpi+p) at the same time, where p=|si−sj|.

Can anyone explain this part of the editorial of problem D?

→ Reply
»
4 years ago, # |
  Vote: I like it -7 Vote: I do not like it

Guys I'm really sorry I know posting your code and asking why it's giving me an error is a sure-fire way to get downvoted but I really have no choice, I have commented neatly and explained the code for problem D, but I keep getting a run-time error on TC-2, can anyone please help me out

Here is the code : Python 3

Thank you in advance :)

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    it's because in your code first of all you didn't memoized all the states and 2ndly recursion tree for your code does not form a DAG(because yours is cyclic) which is necessary condition for any dp/recursion problem. In simpler words you end up calling a state which initially made you call these states.

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

For a case where n = 3z ,z being an odd natural number, isn't the answear (z, z ,z), not (1, n / 2, n/ 2) as it is specified in the editorial ?

→ Reply
»
4 years ago, # |
  Vote: I like it -8 Vote: I do not like it

Guys is there an algorithm involved in B problem. Or is it an only math based problem? What should be said ?

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Hello Everyone, Can some one tell me, where I am getting wrong in problem E2? I am getting WA on 8th testcase.
My solution.
Thank you in advance !!

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone provide better explanation for D and E2?

→ Reply
»
4 years ago, # |
  Vote: I like it -15 Vote: I do not like it

C1, C2 sucks :((

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Omg. I was amazed when I read the tutorial for Problem C2. I accepted C1. After that, I tried to think and find solution for C2 for 1 hour before I gave up. That's amazing. That's unbelievable. That's incredible.

→ Reply
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone please help me understand why this solution for E2 works on all tests except 47?

→ Reply