atcoder_official's blog

By atcoder_official, history, 2 months ago, In English

We will hold AtCoder Regular Contest-- 224.

We are looking forward to your participation!

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

»
2 months ago, hide # |
Rev. 2  
Vote: I like it -9 Vote: I do not like it

That's my third time in ARC!!!(my first time in arc--)

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

I'm so nervous,good luck!This is my first time in arc.

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

B and C are not very good problems. My first Arc--.

»
2 months ago, hide # |
 
Vote: I like it -48 Vote: I do not like it

Overall, ARC224 offers a well-balanced set with a gentle start and a steep climb toward the end. Problems A–C are relatively light and serve as warm‑ups, while D and E demand more thoughtful reasoning. Problem F is the clear highlight in terms of complexity, featuring a non‑trivial counting task. The contest is fair, with no major pitfalls, though C might feel easier than expected for its slot. Suitable for both beginners looking for easy points and experts seeking a solid challenge in the last problem.

»
2 months ago, hide # |
 
Vote: I like it +24 Vote: I do not like it

Problem E feels like a standard Div3 task rather than an ARC task.

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

I have a problem on task E.
Editorial 1
Editorial 2
How to mathematically prove that the algorithms in official editorials always yields a best solution?

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

I think this contest is closer to ABC without problem A rather than ARC--.

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

Can problem "c" be solved by BFS? I thought this problem would easily solved by BFS. But in the end I was wrong. Can anybody explain this.

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

    Nodes on some layer may be connected to multiple nodes from the previous one, so if you just set A_v=dist(1, v) there may be more than one node w satisfying A_w=A_v-1.

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

Omg. This contest is the only high-performance contest of this weekend (of my account). But I am unrated in this contest.