chokudai's blog

AtCoder Beginner Contest 220 Announcement
By chokudai, history, 3 years ago, In English

We will hold AtCoder Beginner Contest 220.

The point values will be 100-200-300-400-500-500-600-600.

We are looking forward to your participation!

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

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

Wtf is F, did you guys run out of problems?

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

I was $$$3^{rd}$$$ at the 10-15 minute mark in the leaderboard cuz of F lol. Used the exact same code for Tree Distances II CSES just changing " " to "\n"...

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

F is the reason that you should read all the problems

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

How can I say, I solved F but didn't solve E before the end of the contest...

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

why is this DP solution wrong for problem D?

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

    When you are incrementing dp[i][j], you have to add dp[i-1][last] twice in case both the conditions are satisfied.

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

Well, at least F has a different output format. https://cses.fi/problemset/task/1133

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

    ok fine change ' ' to '\n'

    PS: It works on CSES with '\n' as the separator anyway so you can submit the Atcoder submission exactly to CSES and it'll AC.

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

Did anyone else also just look at F and open CSES on the next click?

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

the bonus task of F: 791D - Bear and Tree Jumps

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

can anyone share his recursive approach for problem d.

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

    at any state ,we are possible two move,we should go both move and calculate the total value. here my submission, if you are any query ask me ..https://atcoder.jp/contests/abc220/submissions/26150901

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

      thanks . i got your soln but how can we do it in one pass.

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

        it's dp.when one valid move are finished ,you must hit to the base case. you remember that ,you will be hit in the base case many more times ,also hit to the same state more times. so you must memorize to the state value.

        → Reply