atcoder_official's blog

AtCoder Beginner Contest 472 Announcement
By atcoder_official, history, 5 weeks ago, In English

We will hold AtCoder Beginner Contest 472.

We are looking forward to your participation!

  • Vote: I like it
  • -57
  • Vote: I do not like it

»
5 weeks ago, hide # |
 
Vote: I like it -8 Vote: I do not like it

It will be a nice round.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

ready sir

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I’m in my hometown. f*** Wi-Fi.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I hope I can solve Problem E.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

What's the difficulty level of ABC on Codeforces? Which division is it from?

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Hope I can solve F this time QwQ

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I hope that I can solve problem A-F.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I hope I can answer A, B, C, D, E

→ Reply
»
5 weeks ago, hide # |
← Rev. 3  
Vote: I like it 0 Vote: I do not like it

D to G as T1 to T4 is usually the standard CSP-S difficulty.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

My first contest on atcoder, hope I solve A, B and C.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I nearly forgot to sign up：）

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Hope I can solve A to F.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I hope I can solve A, B, C, D and E.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I hope I can solve Problem F.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I hope to complete A, B, C, D, E

Chinese Can fly.(cross out)

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I hope I can solve Problem A to D.

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

Currently about 15 cheaters in top 20. What happened?

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

excited

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +6 Vote: I do not like it

cheaters are everywhere,problems is getting easier,problem E is even a classic problem

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

All problems are classic in AtCheater Beginner Contest.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

What a trash contest AtCoder put out this time. The first five problems were all ultra-low-difficulty. Doesn't this mean the ranking just comes down to who can code a little faster?

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +28 Vote: I do not like it

I think question F is a bad question because it only tests whether you know this formula.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +11 Vote: I do not like it

I just want to know why every ABC is trash.In the past dozen or so ABC contests, there hasn't been a single Problem E or F that required any real thinking,they've all been things you could come up with without even needing to think.Actually,people seem couldn't learn anything in ABC.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +9 Vote: I do not like it

I find it quite comical how the easiest solution of E is a taste of its own medicine...

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +10 Vote: I do not like it

Trash round.E is a classic problem.F is totally a geometry problem.G is a flow template.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

ABCDE is too easy,but F,G is fucking,Ionly solved abcde.speed typing contest

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

    how did you solve E one?? anybody can tell??

    → Reply
    • »
      »
      »
      5 weeks ago, hide # ^ |
       
      Vote: I like it +1 Vote: I do not like it

      bro odd cycle can be detected with bi-coloring dfs, if you record the traversal order while doing dfs once it detected odd cycle you can just take the recorded path, trim it a bit, done that's odd cycle

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

        got it

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

          I mean if you color node 1 to be red(0), traverse to node adjacent to it color it blue(1), and so on... when you now reach a node e.g. let says node 7 with color blue(1) then node 7 can traverse to e.g. node 8 which already visited and it's color is already blue(1) but but our algorithm is to color the next node we can traverse to with different color... if this happen (7 and 8 literally got colored into same color) this means the graph is not bi-partite and thus there exist odd cycle

          you can refer to it from cp-algorithm it comes up quite often in reading material that everybody seen, like cp-handbook, usaco guid, basic about graph etc. 👍

          → Reply
»
5 weeks ago, hide # |
← Rev. 2  
Vote: I like it -8 Vote: I do not like it

E ~ G are all trash. $$$O(h \cdot 3^{\frac{w}{2}})$$$ approach to G only takes 77 ms.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +27 Vote: I do not like it

Problem F is definitely a bad problem.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

trash round ?

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Why there is a problem that aspects to mathematics? It's not a competition for mathematics.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Terrible contest! I got stuck on problem F, a nasty computational geometry problem, for 50 minutes and received five penalty minutes due to precision issues, which made me miss debugging problem G by just one minute!

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I don't want heavy computational geometry!!!
I want AT's fresh counting!!! F shit!!! Chinese Can't be Fed shit

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

How should I describe it?? This is too boring:(

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Arbitrary Broken Contest

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

No way, man… I thought I couldn't participate in this contest when I had some other important things to do. But when I got home, there was still like 20 minutes left and I decided to join it. That was the first time for me to join a contest like this… And since I'm really a beginner in OI, I only passed A and B…

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

bruh

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

The quality of the problems is horrible. Trash contest.

→ Reply
»
5 weeks ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

I just missed the contest (I thought it's same time as Codeforces : ( ) but I did VP and A-D all are just implementation no thinking..

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it -9 Vote: I do not like it

I don't know if I'm playing ABC or taking a math exam.

→ Reply
»
4 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

The first six problems (or even all seven) were purely template-based. For those who had been struggling to gain rating in recent contests, this was a blessing—if you were familiar with the templates, you could get a high rank and quickly climb rating. But for those looking to practice their thinking skills, it was a barrier—there was no real need to think.

→ Reply