首页 > 其他分享 >Codeforces Round 886 (Div. 4) 全题题解

Codeforces Round 886 (Div. 4) 全题题解

时间:2023-07-23 20:22:20浏览次数:54  
标签:全题 01 886 color 题解 00 textbf 00CC00

我关注的人中正式参与比赛排名公示

# Who = Penalty * A B C D E F G H
1 (980) China Chen_Jinhui 7 381 \(\color{#00CC00}{\textbf{+}}\) 00:05 \(\color{#00CC00}{\textbf{+1}}\) 00:17 \(\color{#00CC00}{\textbf{+}}\) 00:19 \(\color{#00CC00}{\textbf{+}}\) 01:08 \(\color{#00CC00}{\textbf{+}}\) 00:55 \(\color{#00CC00}{\textbf{+}}\) 01:35 \(\color{#00CC00}{\textbf{+}}\) 01:52
2 (4685) China LQ1120241921 5 160 \(\color{#00CC00}{\textbf{+}}\) 00:04 \(\color{#00CC00}{\textbf{+}}\) 00:10 \(\color{#00CC00}{\textbf{+}}\) 00:18 \(\color{#00CC00}{\textbf{+}}\) 01:13 \(\color{#140c34}-2\) \(\color{#00CC00}{\textbf{+}}\) 00:55
3 (5657) China zdrj2025 5 199 \(\color{#00CC00}{\textbf{+}}\) 00:05 \(\color{#00CC00}{\textbf{+}}\) 00:14 \(\color{#00CC00}{\textbf{+}}\) 00:32 \(\color{#00CC00}{\textbf{+}}\) 00:53 \(\color{#00CC00}{\textbf{+1}}\) 01:25
4 (6367) China linzibolzb 5 253 \(\color{#00CC00}{\textbf{+}}\) 00:06 \(\color{#00CC00}{\textbf{+}}\) 00:16 \(\color{#00CC00}{\textbf{+}}\) 00:26 \(\color{#00CC00}{\textbf{+2}}\) 01:00 \(\color{#00CC00}{\textbf{+2}}\) 01:45 \(\color{#140c34}-1\) \(\color{#140c34}-1\)
5 (7679) wy2025 4 62 \(\color{#00CC00}{\textbf{+}}\) 00:06 \(\color{#00CC00}{\textbf{+}}\) 00:11 \(\color{#00CC00}{\textbf{+}}\) 00:18 \(\color{#00CC00}{\textbf{+}}\) 00:27
6 (9024) s_zeratu 4 92 \(\color{#00CC00}{\textbf{+}}\) 00:05 \(\color{#00CC00}{\textbf{+}}\) 00:18 \(\color{#00CC00}{\textbf{+}}\) 00:23 \(\color{#00CC00}{\textbf{+}}\) 00:46
7 (9186) China DCZISSB 4 96 \(\color{#00CC00}{\textbf{+}}\) 00:04 \(\color{#00CC00}{\textbf{+}}\) 00:11 \(\color{#00CC00}{\textbf{+}}\) 00:20 \(\color{#00CC00}{\textbf{+1}}\) 00:51 \(\color{#140c34}-2\)
8 (9484) China c20251917 4 103 \(\color{#00CC00}{\textbf{+}}\) 00:05 \(\color{#00CC00}{\textbf{+}}\) 00:21 \(\color{#00CC00}{\textbf{+}}\) 00:23 \(\color{#00CC00}{\textbf{+}}\) 00:54
9 (9529) China Ariasaka 4 104 \(\color{#00CC00}{\textbf{+}}\) 00:02 \(\color{#00CC00}{\textbf{+}}\) 00:08 \(\color{#00CC00}{\textbf{+}}\) 00:16 \(\color{#00CC00}{\textbf{+}}\) 01:18 \(\color{#140c34}-7\)
10 (11019) China Li_Feiy-i7i 4 141 \(\small\color{gray}{-2}\) \(\color{#00CC00}{\textbf{+}}\) 00:08 \(\color{#00CC00}{\textbf{+}}\) 00:25 \(\color{#00CC00}{\textbf{+}}\) 00:28 \(\color{#00CC00}{\textbf{+1}}\) 01:10 \(\color{#140c34}-2\)
11 (11710) China cyh1105 4 163 \(\color{#00CC00}{\textbf{+}}\) 00:04 \(\color{#00CC00}{\textbf{+}}\) 00:15 \(\color{#00CC00}{\textbf{+}}\) 01:01 \(\color{#00CC00}{\textbf{+}}\) 01:23
12 (11952) China dhaomin 4 172 \(\color{#00CC00}{\textbf{+}}\) 00:03 \(\color{#00CC00}{\textbf{+}}\) 00:36 \(\color{#00CC00}{\textbf{+}}\) 00:35 \(\color{#00CC00}{\textbf{+3}}\) 01:08
13 (14718) czyawa 3 57 \(\color{#00CC00}{\textbf{+}}\) 00:07 \(\color{#00CC00}{\textbf{+}}\) 00:21 \(\color{#00CC00}{\textbf{+}}\) 00:29
14 (18562) z_m_x 3 210 \(\color{#00CC00}{\textbf{+}}\) 01:45 \(\color{#00CC00}{\textbf{+}}\) 01:08 \(\color{#00CC00}{\textbf{+}}\) 00:37
15 (21815) iamchenzh 1 16 \(\color{#00CC00}{\textbf{+}}\) 00:16 \(\color{#140c34}-6\)
16 (21948) China 0930_songzhiyu 1 20 \(\color{#00CC00}{\textbf{+}}\) 00:20 \(\color{#140c34}-3\)
Accepted Tried \(\color{#00CC00}{\text 23198}\) 23269 \(\color{#00CC00}{\text 20370}\) 21272 \(\color{#00CC00}{\text 19959}\) 19987 \(\color{#00CC00}{\text 13233}\) 14229 \(\color{#00CC00}{\text 6535}\) 7658 \(\color{#00CC00}{\text 3335}\) 6428 \(\color{#00CC00}{\text 1330}\) 2226 \(\color{#00CC00}{\text 386}\) 876

题解部分

A - To My Critics

AI 会做的题你不会做?可以退役了。

直接贴代码,不予解释。

//the code is from chenjh
#include<cstdio>
void solve(){
	int a,b,c;scanf("%d%d%d",&a,&b,&c);
	puts(a+b>=10||a+c>=10||b+c>=10?"YES":"NO"); 
}
int main(){
	int T;scanf("%d",&T);
	while(T--) solve(); 
	return 0;
}

B - Ten Words of Wisdom

详细请见 题解 CF1850B Ten Words of Wisdom

C - Word on the Paper

详细请见 题解 CF1850C Word on the Paper

D - Balanced Round

详细请见 题解 CF1850D Balanced Round

E - Cardboard for Pictures

详细请见 题解 CF1850E Cardboard for Pictures

F - We Were Both Children

详细请见 题解 CF1850F We Were Both Children

G - The Morning Star

详细请见 题解 CF1850G The Morning Star

H - The Third Letter

详细请见 Tutorial (en)

标签:全题,01,886,color,题解,00,textbf,00CC00
From: https://www.cnblogs.com/Chen-Jinhui/p/solution-at-codeforces-round-886-div-4.html

相关文章

  • 题解 P9474 [yLOI2022] 长安幻世绘
    看到极差,不难想到双指针。显然,如果\([l,r]\)的位置都被覆盖,那么其中最多可以选\(\lceil\frac{r-l+1}{2}\rceil\)个数。我们先将所有数离散化,排序,双指针卡取值范围。set里面存pair类型变量,表示覆盖的区间。每次将值为\(r\)的数的位置加入,在set中二分到与它相邻的区......
  • 题解链接
    积跬步,至千里tag:二分洛谷P1314聪明的质检员洛谷P1024一元三次方程求解tag:分块CF785EAntonandPermutationtag:贪心UVA1335/洛谷P4409皇帝的烦恼题解tag:倍增+贪心P4155、P6902——一类区间覆盖问题tag:二进制洛谷P7617KOMPIĆI的一个小tricktag:排列组合+......
  • 题解:【ICPC WF 2021 H】 Prehistoric Programs
    题目链接#include<bits/stdc++.h>#defineldlongdouble#defineuiunsignedint#defineullunsignedlonglong#defineintlonglong#defineebemplace_back#definepbpop_back#defineinsinsert#definempmake_pair#definepiipair<int,int>#def......
  • Codeforces Round 886 (Div. 4)记录
    A-ToMyCritics代码:#include<cstdio>#include<algorithm>#include<cmath>#include<vector>#include<string.h>#include<set>#include<string>#include<map>#include<iostream>#include<queue>#in......
  • cf 题解
    MihaiandSlavicwerelookingatagroupof$n$frogs,numberedfrom$1$to$n$,allinitiallylocatedatpoint$0$.Frog$i$hasahoplengthof$a_i$.Eachsecond,frog$i$hops$a_i$unitsforward.Beforeanyfrogsstarthopping,SlavicandMihaicanp......
  • P7074 [CSP-J2020] 方格取数 题解
    题目:题目描述设有n*m 的方格图,每个方格中都有一个整数。现有一只小熊,想从图的左上角走到右下角,每一步只能向上、向下或向右走一格,并且不能重复经过已经走过的方格,也不能走出边界。小熊会取走所有经过的方格中的整数,求它能取到的整数之和的最大值。输入格式第一行有两个整......
  • AtCoder Beginner Contest 311 A-E题解
    A-FirstABC题意给一个长度为N的仅由ABC三个字符组成的字符串S,问S中ABC三个字符第一次出现的位置的最大值。题解使用map<char,bool>判重,记录当前不同的字符串的个数cnt,当cnt等于3时,输出此时的下标+1作为答案。Code#include<bits/stdc++.h>usingnamespacestd;usingll......
  • 第二次比赛部分题解
    P7060[NWRRC2014]AlarmClock  #include<bits/stdc++.h>usingnamespacestd;intmain(){intn;cin>>n;intarr[10]={6,2,5,5,4,5,6,3,7,6};boolcheck=false;//对于时间ab:cdfor(inta=0;a<=2;a++){//a最多可以到2(因为最大为23......
  • 2023“钉耙编程”中国大学生算法设计超级联赛(2)部分题解
    2023“钉耙编程”中国大学生算法设计超级联赛(2)部分题解7.201002 BinaryNumber可以发现,每个位置最多修改两次,再多了没有意义。当k为0时,无法修改直接输出。当n为1时,看k的奇偶性,若为奇数则将其翻转输出,否则直接输出。当n不为1时:如果给定的次数k小于序列中连续0串的个数,那一定......
  • P1833 樱花 题解
    二进制拆分做法:把每一个物品根据2的多少次方拆分,因为任何数都可以转化为二进制数核心思想:把每一个物品拆成很多个,分别计算价值和所需时间,再转化为01背包求解最后一点:完全背包可以把他的空间记为999999,不要太大,一般百万就足够了还有一点:cin和scanf不可以混用代码#include<bit......