We will hold UNICORNProgramming Contest2026(AtCoder Beginner Contest 477).
- Contest URL: https://atcoder.jp/contests/abc477
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20260926T2100&p1=248
- Duration: 100 minutes
- Writer: Nyaan, harurun4635, vwxyz0
- Tester: cn449, physics0523
- Rated range: ~ 1999
- The point values: 100-200-300-400-450-525-625
We are looking forward to your participation!
Hopefully I solve A-D this time, goodluck everyone
me toooo
No convolution problems plz
No trash round plz.
its clear now
Why are all scores "???" on Atcoder
Why are all the scores for this contest's problems '???'?
++
66, DMY Student?
？
There are no '???'s now.
That's a good question. '???' means that the score is not yet determined.
really want to solve E!!!!
I hope to answer questions ABCDE 5.
Good morning
wtf it's 11 pm here
I can solve D but can't solve C?
1
Is the difficulty of this ABC test really the same as last time? I think it's much harder than the last one.
I don't think so.
Rating this contest is the worst choice I've ever made.
I didn't read C carefully so I try to use KMP to solve the problem.
D struck me 40min and I have no time to write F(a simple Nested Segment Tree).
Hope I can get any ratings.
Can you explain your idea for F?
By using a Nested Segment Tree(2D Segment Tree).
And then the problem turned to be a model problem.
what is even 2D segment tree I mean could you please explain on how it work in this setting of problem F I'm interest in the idea you share brother, by the way I did solve 3 in this contest by sorting queries in some order that including F I did make a query function then pre-cal these query function by sorting them in certain order I would like to work with, then the pre-calculation will be done by lazy propagation on 1D segment tree I think it was those idea people call it sweep line maybe.
by what is even 2D segment tree please just give me short explanation, what I wonder was like how was it represent in such a big N*M grid ? or was it some form of not fully manifest 2D N*M memory but like pointer implementation or something? the one that you work with.
i took way too long for C :sob:
in D, what happens to the color of the square when a tile is placed on it. I mean what is the final color ? couldn't solve it.
Nothing will happen.
I solved it in a trash lazy-tag segment tree.
Is it normal to be able to do D but can't do C?
Easy E,Hard F,Confusing D
Can you please briefly explain your approach for E ? I was stuck :(
sort queries forces.
由中国的吗？
有的有的
我直接轻松绷住，E题思路比D题思路简单，轻松绷住（ac）ABCE题
Codeforces is a international platform, so speak English.
You can speak Chinese at Luogu or Qoj.
First NEGATIVE delta
Can someone explain how to solve D?
how to solve F?