mon0pole's blog

CodeAgon 2022 Discussion
By mon0pole, 3 years ago, In English

As I didn't find any blog for this round discussion so posting this blog

Problems:

P1
P2
P3
P4
P5
P6

I was able to solve P1,P4,P5.
Please share your approaches for other problems.

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

Comments Comments (36)
| Write comment?
»
3 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Anyone above 3 solvers gang :sadge:

Feeling dissapointed about bricking P3 D:

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

    I solved 4 problems: P1, P2, P4, P5. I faced some server issues while submitting P6 (not sure about the correctness). Has anyone faced the same?
    Error message: Not able to establish connection to InterviewBit Servers. Please check internet connectivity.

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

    I didn't participate in the round. For P1, do we have any solution other than using segment tree over euler tour ?

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

      There is probably a pbds set + small to large merging solution but in my opinion euler tour would be better here.

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

2nd problem is harder version of this cses problem

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

I was able to solve 1, 4, 5 and 6. But I should have better gone to problem 3 before 6th as it seems like an easier once once you know how to implement centroid decomposition. I hope so because I had set a problem with similar solution structure, you can find it here. Also find the tutorial for the same. Sed, couldn't debug it at the last minute :(.

Pls share approaches for problem 2.

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

How to optimise P6? I had a 3 ^ n dp solution which involved using subsets and updating the each subset using their submasks.

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

Is it me or N^2 passes for 1,2,3 and 3^N passed for 6. It only showed correct answer for me not TLE./

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

    what 3 ^ N passed? that shouldn't happen

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

      did you try to get partial using 3^N ? I did and for some reason it passed

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

        well nope I was too late like 2 hours in when I thought of that and it felt sub optimal so I didn't try coding it. I t was the first I attempted sadly.

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

    Actually, It was running only on trivial test cases. It is like pretests of CF. I solved the 5th problem without taking mod and I didn't get any WA and then I corrected it afterward So, I think there are some more test cases on which our solution will be judged after the contetst.

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

P5 Test Cases were wrong wasted one hour on that, later on they changed test cases.

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

How to solve P6.I was thinking like some sort of bitmask dp but couldn't go too much.

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

P6: Problem G of this.

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

    Did you solve all problems?

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

    Wow, its just a single leap of faith from $$$O(3^N)$$$ solution. All time, I was being conservative by using only submasks to account for all elements, and not missing out. But we can let go of some elements and collect them at the end, that's cool.

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

what are the prerequisites for each problem?

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

Short summary of my solutions for P1 to P6 :

P1
P2
P3
P4
P5
P6
→ Reply
»
3 years ago, # |
  Vote: I like it +43 Vote: I do not like it

Video Solutions of all problems

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

Is there a place where I can get updates on such upcoming contests?

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

    I have developed a Chrome Extension — CP Calendar which keeps the users updated about most of the rated contests on all famous CP platforms and a few hiring challenges too. (I can't guarantee that it lists all unrated contests)

    ADD TO CHROME

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

Did anybody get a chance to interview. If yes what was your score.

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

Did anyone receive mail regarding codeagon prizes.

→ Reply