CF802D.Another Round

普及/提高-

通过率：0%

时间限制：1.00s

内存限制：256MB

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

This is an interactive problem a contest with an unusual start time.

You are given a Codeforces account and $n = 6$ problems, authored and prepared by qwexd and jeroenodb.

In one operation, you may choose a problem $i$ ( $1 \le i \le n$ ) and submit a program intended to solve it.

The maximum scores are given below. Problem E is divided into two subtasks.

Problem

Maximum score

500

1250

1500

2500

2000 + 1500

3000

The points awarded for a correct submission may be lower, as determined by the Codeforces scoring rules.

Your task is to maximize your total score before the time limit expires.

这是一个交互式题目，比赛具有非常规的开始时间。

你将获得一个 Codeforces 账号以及 $n = 6$ 道题目，这些题目由 qwexd 和 jeroenodb 编写并准备。

在一次操作中，你可以选择一道题目 $i$ （ $1 \le i \le n$ ），并提交一份旨在解决该题的程序。

各题目的最高分如下所示。其中问题 E 分为两个子任务。

题目	A	B	C	D	E	F
最高分	500	1250	1500	2500	2000 + 1500	3000

正确提交所获得的分数可能低于最高分，具体由 Codeforces 计分规则决定。

你的任务是在时限结束前尽可能提高总得分。

输入格式

The input consists of the problemset of Codeforces Round 1121 (Div. 2). It became available on Sep/13/2026 20:05 (Moscow time).

The round is rated for participants with a rating below 2100. Participants with a rating of 2100 or higher are welcome to participate out of competition.

输入包含 Codeforces Round 1121 (Div. 2) 的题目集。该比赛于 2026 年 9 月 13 日 20:05（莫斯科时间）开始。

本场比赛对 Rating 低于 2100 的参赛者为 Rated；Rating 为 2100 或更高 的参赛者可自愿参加，但不参与 Rating 排名。

输出格式

For each problem you choose to solve, submit a correct program. You may solve the problems in any order.

Printing YES is not sufficient.

对于您选择解决的每道题目，请提交一个正确的程序。您可以按任意顺序解决这些题目。

仅输出“YES”是不够的。

说明/提示

It has been shown that every problem has a solution. The proofs are now available in the editorial.

The following participants were the first to construct correct solutions:

Problem

First to solve

Submission

We would like to thank:

Proof_by_QED for coordinating the round;
Um_nik for the preliminary review;
Alexdat2000 for translating the statements to Russian;
our testers: __baozii__, nifeshe, Noobish_Monk, fuad720, temporary1, turska, Rayo, shorya1835, cry, TAhmed33, Rvess, omsincoconut, flammifer, robert9524, ismailfateen, osvarp, samsoom, Nyemot, SpyrosAliv, Sacha, Argentum47, snowythecat, EduardoBrito, wakanda-forever, linearspace, chromate00, simplelife, Vespasian_1, nik_exists, Svivl, ALnQ417, and HobVIIb1 for testing the round and providing valuable feedback;
our testers who didn't test: _istil, Arpa, sammyuri, AksLolCoding, BLOBVISGOD, sorry12000, naneosmic, Euclid73, i-love-ayase-momo, and ArnedeB;
KAN and MikeMirzayanov for Codeforces and Polygon;
you, for participating in the round.

Thank you for participating!

已证明，每个问题均有解。相关证明现已发布于题解中。

以下参赛者是首批构造出正确解法的选手：

问题

首位解出者