atcoder_official's blog

AtCoder Regular Contest 195 (Div. 2) Announcement
By atcoder_official, history, 13 months ago, In English

We will hold AtCoder Regular Contest 195 (Div. 2).

The point values will be 400-500-600-700-900.

We are looking forward to your participation!

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

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

What's the point of problem C??? Nothing but useless coding and debuging...

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

Can anyone tell me how to solve prob D?

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

Hate the constraints in problem B,O(n*n log(n)) keeps getting TLE,no thinking only optimization.

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

Why I got WA on D with greedy?

Submission

Thanks a lot if anybody can give me an small hack. QwQ

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

In the official editorial of problem C,

さらに、 $$$R=0$$$ の場合、 $$$(r_i+c_i)$$$ と $$$(r_{i+1}+c_{i+1})$$$ を $$$4$$$ で割った余りが異なることから、以下の必要条件が得られます。

$$$R=0$$$ ならば、 $$$B$$$ は偶数

This conclusion is wrong. Actually it should be " $$$r_i$$$ has different parity with $$$r_{i+1}$$$ "

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

    Thank you. I've informed the writer, so I think it will be corrected.

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

Can we have the gcc version updated to 14.2.0?

https://atcoder.jp/contests/arc195/submissions/64147881

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

A test case for D:

1
9
2 6 2 1 6 1 6 1 6

should be 7.

→ Reply