We will hold Toyota Programming Contest 2023#5（AtCoder Beginner Contest 320）.

- Contest URL: https://atcoder.jp/contests/abc320
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20230916T2100&p1=248
- Duration: 100 minutes
- Writer: kyopro_friends, cn449
- Tester: PCTprobability, math957963
- Rated range: ~ 1999
- The point values: 100-200-300-400-475-550-600

We are looking forward to your participation!

Why downvotes are in the announcement? don't be a kid!

why downvote ;(((

Hope to solve A, B, C.

Hope to solve A, B, C, D.

Hope to solve A, B, C, D, E.

Hope to Solve A, B, C, D.

GOD BLESSING ME!!!Hope to solve A,B,C.

HOPE to solve A....This is my first atcoder contest ;}

This is my ninth contest:(

Hope to solve A to D.

Why can't I pass problem D!!! The contest will be finished in 18 min!

You are wasting time typing these words.

Bruh, C was so annoying. Solved D in like ~10 minutes, but wasted so much time thinking for C :<

Agreed!

what is mistake in my code for D

https://atcoder.jp/contests/abc320/submissions/45643786

Consider a case: node is already visited but there are some unused edges connected to it.

ywah okay

i solved the problem but i don't understand why there could be unused edges.

can you pls give counterexample case

if you visited a node doesn't that mean it would go through all edges so how can it have unused edges?

Whats the mistake in my code for Question E? https://atcoder.jp/contests/abc320/submissions/45637747

`1e11`

($$$10^{11}$$$) is not large enough for infinity. The answer can be up to $$$2\times10^{14}$$$.ohh i chnage it to 1e18

Well, I spend 30 min to understand what C was saying!

Task G it seems flow without any optimization passed.

can anybody please tell me a counter test case for C problem according to my code. or where my logic is wrong?

CodeHave you consider when a certain digits are located in the same position?

I guess, I didn't comprehend problem fully.

If possible, tell me a counter case please

Nice C. I did not thought of direct simulation. I thought to fix one string, find i th char in other two strings. Equal index in all 3 ,in one of 2 strings and not euqual indexes, all those cases just made my implementation harder.

Equal Numbers,alphabets,indexes,maximms,minimums are the tools to make question harder and sometimes even annoying if you handle it in wrong way

Me wasting 40 minutes on C not realizing there were only 3 slot machines. :(

Same :sob:

Problem C, remains me I am still not good at logical thinking

I think it has 2 solutions.one with observation and another solution which need a bit of implmentation. This reminds us that we both are good for nothing.

Note I did not solve C even after pactising year. I know c++ since 2016.For $$$C$$$, You can just make 3 consecutive copies of each string ($$$S_i =S_i + S_i + S_i$$$).

Try every digit[0:9] and if you found 3 different indices have the same digit, minimize the maximum index with the answer . Code : 45651190

can somebody tell me why i am stuck in problem D

https://atcoder.jp/contests/abc320/submissions/45651936

use 64-bit integer instead of 32-bit

Thank you, it worked.

in the editorial of F: in the fourth case we need to iterate right? so how the complexity will stay O(n^3) ? https://atcoder.jp/contests/abc320/editorial/7169

This will happen only when $$$k=H$$$, which is $$$O(H)$$$ for every $$$dp_{i,j}$$$.

Sub AtCoder it locked my account without any email or notice.

fu!

fu!

The data of question C is suggested to be strengthened

this is the hack input

answer:

Output the wrong answer '6' but accepted code. https://atcoder.jp/contests/abc320/submissions/45625948

This hack can block some greedy algorithms, including me.

Whats the mistake in my code for Question E? https://atcoder.jp/contests/abc320/submissions/45637747

I can't understand the C problem. Why the answer of testcase:

20 01234567890123456789 01234567890123456789 01234567890123456789

is 20? can't we just stop at 0 seconds so all reels show 0?

Edit: nvm, I got it, he can press only one button at any given second.

For problem G: (1) (2)

The (1) code shows about 7 times slower than (2) for test 5, and it gets TLE. (2) is AC, and the difference between (1) and (2) is the way of adding the element to the b array: for (1), i use (line 135 to 141)

for (2) (line 134 to 137):

Why is (1) so slow? Very thanks!