jonathanirvings's blog

By jonathanirvings, history, 4 weeks ago, In English,

Hi,

We would like to invite you to participate in the live (with 30-minute delay) online mirror contest of The 2019 ICPC Asia Jakarta Regional Contest (our regional website, our regional in ICPC website, official contest portal) this weekend. The online mirror contest will start on Oct/27/2019 06:30 (Moscow time).

The contest consists of several problems and you can solve them in 5 hours.

See you on top of the leaderboard.

UPD1: Thanks for participating. The problems should be available for upsolving. The soft-copy of the problem analysis (the same as the one distributed to all contestants during the awarding ceremony) is available here.

 
 
 
 
  • Vote: I like it
  • +217
  • Vote: I do not like it

»
4 weeks ago, # |
Rev. 2   Vote: I like it +47 Vote: I do not like it

Too bad that it clashes with my FHC schedule. Anyway, I think Jakarta had the finest problems in East Asia ICPC last year. It would be a good practice opportunity.

»
4 weeks ago, # |
  Vote: I like it +45 Vote: I do not like it

The link to timeanddate.com redirects to 27th October of 2018. I guess someone is still living in 2018.

  • »
    »
    4 weeks ago, # ^ |
    Rev. 2   Vote: I like it +44 Vote: I do not like it

    Sometimes I am wondering why I can be a red coder when I still make this kind of careless mistakes. This is why we shouldn't copy-paste things (I copy-pasted the timeanddate URL from last year).

    Anyway, thanks for pointing it out. It is fixed now. Take my upvote!

»
4 weeks ago, # |
Rev. 2   Vote: I like it +13 Vote: I do not like it

Please change the link to https://codeforces.com/contests/1252 instead of https://codeforces.com/contest/1252 . Right now it shows "contest has not started".
People can directly register by visiting the first link.

»
4 weeks ago, # |
  Vote: I like it -9 Vote: I do not like it

Maybe I'm a new of Codeforces ... Could you tell me if I participate as a team member , will my personal rating change after the contest ... ?

»
4 weeks ago, # |
  Vote: I like it +16 Vote: I do not like it

Just curious if it is rated? if rated how would the rating mechanism work for a team against individual?

  • »
    »
    4 weeks ago, # ^ |
    Rev. 2   Vote: I like it +9 Vote: I do not like it

    I was just considering this question and wanted to know how rating will be calculated. Obviously it should be fairer if unrated. Thank you :-).

»
3 weeks ago, # |
  Vote: I like it -39 Vote: I do not like it

Is it rated?

»
3 weeks ago, # |
  Vote: I like it -43 Vote: I do not like it

I hope no DDOS attack would happen

»
3 weeks ago, # |
  Vote: I like it +26 Vote: I do not like it

I am getting this message please fix it "Can't read or parse problem descriptor"

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Good luck for all the contestants! :)

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can we see the resolver?

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

How to solve problem E? We attempted to solve it using system of difference constraints with SPFA and got TLE. Thanks in advance.

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

    Try to maintain feasible intervals backward and then get result forward based on the feasible intervals.

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

    Hi, could you help me find where I am going wrong in case of Question C (even Path). Here is my code: https://ideone.com/9w587e I have implemented with the same logic as in the editorial, i.e. pre-calculating the parity of the given array R and C, but I am getting TLE in test case 17 and gone through every bit of code but couldn't find where the problem is. The time complexity is also O(4N + Q) or just O(N+Q). Thanks in advance!

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

Can anyone explain the solution to J? I implemented a greedy idea only to get WA on testcase 20.

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

    The main complexity in J is how to place the type-3 blocks. I decided to iterate over number of type-3 blocks to place, and then for each possibility place the blocks so that we get the fewest number of odd segments of soil using a dp (because we can fill even segments with type-2s completely, they are strictly better than odd segments).

    After the type-3 blocks are placed you can place type-1 and type-2 greedily.

  • »
    »
    3 weeks ago, # ^ |
    Rev. 4   Vote: I like it +1 Vote: I do not like it

    We need at most O(number of rocks) type-1.

    It turns out the test cases are weak, lol.

    • »
      »
      »
      3 weeks ago, # ^ |
      Rev. 6   Vote: I like it 0 Vote: I do not like it

      may i look at your code? i couldn't see the other's code. it's for learning purpose since i keep stucking on test case 23 after debugging on test case 11,19 & 22

  • »
    »
    2 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Hi, could you help me find where I am going wrong in case of Question C (even Path). Here is my code: https://ideone.com/9w587e I have implemented with the same logic as in the editorial, i.e. pre-calculating the parity of the given array R and C, but I am getting TLE in test case 17 and gone through every bit of code but couldn't find where the problem is. The time complexity is also O(4N + Q) or just O(N+Q). Thanks in advance!

»
3 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

How to solve problem K?

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

    For a subsequence $$$[l,r]$$$, you can count how many $$$A$$$ and $$$B$$$ in first element and second element of $$$f(l,r,A,B)$$$. Let them be $$$x_1,y_1$$$ and $$$x_2,y_2$$$. For example, with substring $$$ABA$$$, $$$x_1=2,y_1=3,x_2=1,y_2=2$$$.

    For query type $$$2$$$, use segment tree to calculate $$$x_i$$$ and $$$y_i$$$ of subsequence $$$[l,r]$$$. To build the tree, we need to combine $$$x_i$$$ and $$$y_i$$$ of two segment, which could be figured out by draft.

    For query type $$$1$$$, use lazy update on segment tree. When we flip a segment odd number of times, simply $$$swap(x_1, y_2)$$$ and $$$swap(x_2, y_1)$$$.

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

      Can I see your code ? Thank you very much!

      • »
        »
        »
        »
        3 weeks ago, # ^ |
          Vote: I like it +4 Vote: I do not like it
        Yes
        • »
          »
          »
          »
          »
          3 weeks ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Can you explain the x1 y1 x2 y2 in detail? Thanks in advance!

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

            Look at the function in the statement. The return value is $$$(A,B)$$$. $$$x_1,y_1$$$ are number of original $$$A$$$ and $$$B$$$ in $$$A$$$ returned, $$$x_2,y_2$$$ are number of original $$$A$$$ and $$$B$$$ in $$$B$$$ returned.

            • »
              »
              »
              »
              »
              »
              »
              3 weeks ago, # ^ |
              Rev. 2   Vote: I like it 0 Vote: I do not like it

              Thank you !The x1 y1 x2 y2 is like a 2 x 2 matrix . I try to use the segment tree to maintain the multiplication of the matrix,but I don't know how to change the matrix when the we flip a segment odd number of times. Now , I know it. If we flip a segment odd number of times , actually it's the transpose of this matrix. Thank you.

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

              ok but i can't understand the transition or combinations of nodes in Segment Tree.ej why ( a.x1 = (b.x1 * c.x1 + b.y1 * c.x2) % MOD; )

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

                For a segment $$$[l,r]$$$, $$$f(l,r,A,B)=(x_1\times A+y1\times b, x_2\times A + y_2\times B)=(A',B')$$$

                When combine segment $$$[l_2,r_2]$$$ next to $$$[l_1,r_1]$$$ and , $$$A'$$$ and $$$B'$$$ of the first segment become $$$A$$$ and $$$B$$$ of input of $$$f(l_2,r_2,A,B)$$$. You can make some drafts to figure out the equations.

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

    use sqrt decomposition!

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

      Hi I try to use sqrt decomposition to Solve this problem,but I have some problems about 1 L R operation. if a full segment toggled,I try to change the coefficient of A B but if we don't change the full segment,we will fail on later query. For example:a3 a4 a5 as a full toggled segment,but if we meet a query a4 a5 a6 a7 a8 we will get WA because we don't update a4 a5 By the way i try to use naive method but WA on Test2,can you help me?,thanks in advance.

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

    Hi, could you help me find where I am going wrong in case of Question C (even Path). Here is my code: https://ideone.com/9w587e I have implemented with the same logic as in the editorial, i.e. pre-calculating the parity of the given array R and C, but I am getting TLE in test case 17 and gone through every bit of code but couldn't find where the problem is. The time complexity is also O(4N + Q) or just O(N+Q). Thanks in advance!

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

how and where to submit the solutions if we want to upsolve???

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

Could someone give me advice on how to solve problem G ?

EDIT: Solved using segment tree

  • »
    »
    3 weeks ago, # ^ |
    Rev. 7   Vote: I like it 0 Vote: I do not like it

    i keep getting WA on test case 2. could you please help me to find my mistake? i couldn't find my bug.

    EDIT: Solved, i did a silly mistake, i thought that Ai would be in decreasing order, i didn't read the problem carefully

»
3 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

Could someone provide insights on problem H? I got stuck on test case 5 with my solution: https://ideone.com/at2GS0 .

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

    I think it is the accuracy problem of floating point numbers.

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

      can you review this.. Stuck on test case 5 Code

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

        I think you made the same mistake as I: relying on a floating point value instead of sticking with integers, which led to some rounding error. This is a diff of my AC code and a previous version of it which also got WA on test case 5: https://www.diffchecker.com/sckBvjUO .

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

    you need long double

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

      Can you tell why we needed to use long double instead of double?

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

        this test data: 1 999999999 999999999 if you use double,your answer will lose 0.5

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

can anyone give me one small test case for k? I use square root decomposition .

here my solution

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

Sorry if I misunderstood something. But this contest was not in gym, right? So why I could not see another team 's code?

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone share the code for problem J The Prade ... Thanks in advance

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone explain me question no B...

»
3 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

where can I find the solution

»
3 weeks ago, # |
  Vote: I like it +23 Vote: I do not like it

Will the submissions be visible?

»
3 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

pls someone write editorial blog, it will help in upsolve the problem..

»
3 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

How to solve problem I?

  • »
    »
    3 weeks ago, # ^ |
    Rev. 3   Vote: I like it +5 Vote: I do not like it

    The annoying problem, no innovative idea. The obvious thing we notice is just find the way to reach the border. Other thing I can see is that to go through two touching circles we need to follow their tangent. So we can draw lines between each pairs of circle then get some intersections,...

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

      You can draw something like voronoi diagram (but not really) by defining a half-plane using a separator between two circles (for example, a line that's exactly between two circles). By using this you can find some point from this graph you can get to and then traverse it until you can get to the end point.

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

explain me solve problem H?? please

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by jonathanirvings (previous revision, new revision, compare).

»
3 weeks ago, # |
  Vote: I like it +7 Vote: I do not like it

Please make the test cases visible.

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Please make testcases and other's solutions available

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can you please make all sources visible?

»
3 weeks ago, # |
  Vote: I like it -10 Vote: I do not like it

please anyone provide the code for problem C.. Thanks in advance.

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I try a different DP way to solve problem B but it cant pass the test 5. Can anyone make the test cases visible QAQ.

»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I need help on problem H, got WA on test 40. Here is my code. I have tried on my own test case with 8000 numbers of N, but did not spot any mistake. what do i miss?!!

  • »
    »
    2 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Line 64, why do you compare with only the last one?

    • »
      »
      »
      2 weeks ago, # ^ |
      Rev. 3   Vote: I like it 0 Vote: I do not like it

      line 64 is the only one left out from "solve" function, the other have been compared in line 32.

      Never mind about my question. Anyway, finally got it solved. Thanks for your attention. :)

»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

For Problem L,Can someone explain the solution in Tutorial?

Alternatively, the easier method is to run the maximum cardinality bipartite matching on set B first,before running it on set A.

Graph:(https://i.postimg.cc/RhMqgbmj/graph.png)

Initially, we have 3 m1 and 3 m2,If at matching on Set B we use at least 2 m2,then we can't use the left m1 and m2 to match on Set A.Is it right?

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

Why are the test cases and solutions still not visible!?

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

why TLE? problem K

is that because of using vectors in representing the matrices or what?

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

Test cases for problem F cannot be more broken. You don't need to consider subtrees isomorphism in any way. Basically, if you're a tree centroid, then you're okay. Just maximize with its number of children, and you'll pass.

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

What's wrong with this code. It fails on test-5 of Even Path. https://codeforces.com/contest/1252/submission/64762718