chokudai's blog

ユニークビジョンプログラミングコンテスト2023 春 (AtCoder Beginner Contest 300) Announcement
By chokudai, history, 20 months ago, In English

We will hold ユニークビジョンプログラミングコンテスト2023 春 (AtCoder Beginner Contest 300).

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

For more information on ABC300 support, please click here. https://atcoder.jp/posts/1028

A pdf of the problem statement will be distributed here. https://img.atcoder.jp/abc300/tasks.pdf

We are looking forward to your participation!

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

Comments Comments (19)
| Write comment?
»
20 months ago, # |
← Rev. 2   Vote: I like it +24 Vote: I do not like it

I am looking forward to AtCoder server stability.

UPD: yeah finally an ABC without site-down. Sincerely thanks to the AtCoder team!

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

Please no more ddos!

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

it's a milestone , 300th contest , keep going my favourite OJ

→ Reply
»
20 months ago, # |
← Rev. 2   Vote: I like it +20 Vote: I do not like it

Hope there will be no more DDoS on Atcoder, Codeforces and all the websites.

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

Problem statement of C gave me a headache.

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

    Why so many IELTS reading tests on competitive programming platforms. I think we should keep them simple.

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

Hooray! The round ends in successful! Happy centennial!

→ Reply
»
20 months ago, # |
← Rev. 2   Vote: I like it +9 Vote: I do not like it

In Problem E, 1 and 6 (**inclusive**) made my contest bad :(
Never noticed about it before :(

  • 1 and 6 (inclusive) ---> (1, 6]
  • 1 and 6 (both inclusive) ---> [1, 6].

I assumed the second one and could not solve E and moved to F :(

PS: Solved A-D and F, feels good after solving F just before contest ended.

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

    But here's the thing. It really is the second one. You just need to solve a dumb equation instead.

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

      can you elaborate?

      I Aced with the first one.

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

        Consider that $$$f(n)$$$ equals to the prob of $$$n$$$.

        then $$$f(n)=\dfrac{f(n)+f(2\times n)+\ldots+f(6*n)}{6}$$$. find the rest first, then multiply by $$$\dfrac{5}{6}$$$. We r done:)

        AC submission

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

Problem G is the same as subgroup number 6 of problem I of the long tour of the Moscow Open Olympiad. Constraints there are $$$n \leq 10^{18}$$$ and $$$p \leq 500$$$, which probably requires a lot more local optimizations.

→ Reply
»
20 months ago, # |
← Rev. 3   Vote: I like it +24 Vote: I do not like it

Thank the contest!
I reached 4kyu in this contest!!!
Hello, Atcoder Grand Contest!

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

Congratulations for the 300th ABC! And without loser ddosers around!

→ Reply
»
16 months ago, # |
  Vote: I like it 0 Vote: I do not like it

In Problem C, is the 3rd condition At least one of C[a+n+1][b+n+1],C[a+n+1][b−n−1],C[a−n−1][b+n+1], and C[a−n−1][b−n−1] is .. redundant? I can't make sense of it.

For instance in sample 1, for the cross of size 2 centered at cell (3,7), n is 2, the 4 cells, at least one of which should be '.' are (in 1 based indexing) : (6,10), (6,4), (0,10) and (0,4) all of which lie outside the grid. How is this condition satisfied then?

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

    The 3rd condition is there to avoid overcounting. Imagine you have a cross of dimension 2. Without the 3rd condition, one would count there are 2 crosses. One with dimension 1. The other with dimension 2. After adding this 3rd condition, we know only the cross with dimension 2 should be counted.

    → Reply