We will hold Luogu Round 198 on Luogu. This is a Div. 3 round and English statement will be provided officially.
- Contest URL: https://www.luogu.com.cn/contest/157920
- Start Time: https://www.timeanddate.com/worldclock/fixedtime.html?msg=LGR-198&iso=20240907T1400&p1=237
- Duration: 240 minutes
- System: IOI
- Difficulty: CSP-J(see this blog), easier than Codeforces Div. 3 (but still harder than Div. 4)
- Writers & Testers: QuotientMartingale, gza, the___, jason_sun, zxh923, _istil, zhuweiqi_OMG, liujiameng, lyl2021, steven_yummy, E.Space
- The contest is made possible with our cutest mascot YuZeAn's help!
- Rated range: <=1600 rating on Luogu
- The points value: 100-100-100-100
We are looking forward to your participation! English statement will be provided officially. We are working on establishing an English platform, but it takes time. We plan to complete this task by the end of 2024 or early 2025.
Wow
I think using Chinese on CodeForces is not appropriate.
Why? I thought codeforces is a platform for everyone.
Because of the community rules.
Which one? I read the rules but I didn't find "DO NOT USE CHINESE".
Maybe you're right, there's nothing in the community rules about what language you have to use. But I have been warned for using Chinese. I think it is not allowed.
Why this comment has got so many downvotes? I think I didn't do anything wrong.
cute
As a tester,I like this round very much.
As a writer, give me contribution.
Hope luogu become better!
As a member in the team , the problems are very good especially A(it has a funny background). Is it allowed?
What is unknown error? Had to submit 5-6 times to judge one submission
"You must submit your code at the Chinese version of the statement"It would help if you changed the statements to Chinese and then submit them. I got the same error when trying to submit solutions in English statementscan someone give link for upsolving? I can't find problems
For Problem D, My Construction was,
1. check if the graph is tree or disconnected.
2. find bridges in the graph.
3. color all the bridge nodes in the graph as black.
4. if there are remaining uncolored node, then color them as white.
5. else, if all the nodes are colored black, then there should a node which has degree 1. color that vertex as white and move up, until there is a node (u) having degree > 1. at last, color the node u as white.
this construction gives wrong answer.
can someone find a testcase on which this construction fails.
Thanks in Advance!