CodeForces
文章平均质量分 81
CodeForces
小哈里
愿你被世界温柔以待
展开
-
Codeforces Round #784 (Div. 4) ,CF全新第一把div4体验&题解
文章目录A. DivisionB. TripleC. Odd/Even IncrementsD. Colorful StampE. 2-Letter StringsF. Eating CandiesG. Fall DownH. Maximal AND不愧是div4, 打完还有一个多小时()A. Divisionifelse判断就行#include<bits/stdc++.h>using namespace std;int main(){ int T; cin>&原创 2022-04-30 21:21:21 · 1727 阅读 · 0 评论 -
【代码源 Div1#104】no crossing,Codeforces 793D,2100分,区间dp
problemD. Presents in Bankopolistime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBankopolis is an incredible city in which all the n crossroads are located on a straight line and numbered from 1 t原创 2022-03-13 14:37:54 · 2231 阅读 · 0 评论 -
【代码源 Div1#103】子串的最大差 Codeforces - 817D,力扣2104,1900分
problem视频讲解链接:https://www.bilibili.com/video/BV1Du411X7Nksolution可以直接推导原答案ans = ∑i=1n∑j=in(max−min)=∑i=1n∑j=inmax−∑i=1n∑j=inmin\sum_{i=1}^n\sum_{j=i}^n(max-min) = \sum_{i=1}^n\sum_{j=i}^nmax-\sum_{i=1}^n\sum_{j=i}^nmin∑i=1n∑j=in(max−min)=∑i=1n∑j=原创 2022-03-12 21:50:28 · 1093 阅读 · 0 评论 -
Codeforces Round #757 (Div. 2)ABCD1
A题意:n个物品各有一个价格,不买小于l和大于r的,有k块钱,最多可以买几件?思路:去掉不买的从小到大排个序,买到不能买为止。#include<bits/stdc++.h>using namespace std;typedef long long LL;const int maxn = 1e5+10;int main(){ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0); int T; cin>>原创 2021-11-26 22:54:18 · 728 阅读 · 0 评论 -
TOYOTA SYSTEMS Programming Contest 2021(AtCoder Beginner Contest 228) ABCD
A题意:有一个开关,每天s点开,t点关(可能在第2天或第n天),判断x点时开着还是关着。思路:按照是否需要隔夜分个类。#include<bits/stdc++.h>using namespace std;int main(){ int s, t, x; cin>>s>>t>>x; if(s<t){ if(x>=s&&x<t)cout<<"Yes\n";原创 2021-11-22 22:00:11 · 1140 阅读 · 0 评论 -
Educational Codeforces Round 117 (Rated for Div. 2) ABCDE
A题意:给出A坐标(0,0)和B坐标,d表示两点横纵坐标绝对值之和。求是否存在C(x,y)满足d(A,C)=d(B,C)=d(A,B)/2,不存在就-1.思路:d(A,B)直接已知,如果是个奇数就-1。因为A是00,所以C坐标x+y直接已知,然后枚举C的x和y,代入计算d(B,C)是否满足条件即可#include<bits/stdc++.h>using namespace std;typedef long long LL;const int maxn = 1e5+10原创 2021-11-22 21:16:59 · 3900 阅读 · 0 评论 -
【CF gym 103260】40th Petrozavodsk Programming Camp, Day 5,2021.2.3 水题2题
M、Discrete Logarithm is a Joke题意:思路:不难想到an=g^{an+1},因为样例给了 a[1000000]的值,所以反着推就行了。记得开int128,longlong会爆,也不要用浮点数表示整数,double会爆,提交的时候选G++20,不然编译器会爆。#include<bits/stdc++.h>using namespace std;const int maxn = 1e6+10;typedef __int128 LL;inline原创 2021-10-17 00:24:40 · 2131 阅读 · 1 评论 -
CF #738(div2)C. Mocha and Hiking(构造)
problemC. Mocha and Hikingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe city where Mocha lives in is called Zhijiang. There are n+1 villages and 2n−1 directed roads in this city.There are tw原创 2021-08-16 20:48:12 · 705 阅读 · 0 评论 -
CF #738(div2)B. Mocha and Red and Blue(构造)
problemB. Mocha and Red and Bluetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs their story unravels, a timeless tale is told once again…Shirahime, a friend of Mocha’s, is keen on playing the m原创 2021-08-16 20:44:44 · 738 阅读 · 0 评论 -
CF #738(div2)A. Mocha and Math(贪心)
problemA. Mocha and Mathtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMocha is a young girl from high school. She has learned so much interesting knowledge from her teachers, especially her math原创 2021-08-16 20:40:39 · 757 阅读 · 0 评论 -
CF #737(div2)C. Moamen and XOR,位运算,结论题,推公式
problemC. Moamen and XORtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMoamen and Ezzat are playing a game. They create an array a of n non-negative integers where every element is less than 2k.原创 2021-08-10 23:20:13 · 736 阅读 · 0 评论 -
CF #737(div2)B. Moamen and k-subarrays,贪心,下标
problemB. Moamen and k-subarraystime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMoamen has an array of n distinct integers. He wants to sort that array in non-decreasing order by doing the followi原创 2021-08-10 23:06:17 · 762 阅读 · 0 评论 -
CF #737(div2)A. Ezzat and Two Subsequences,贪心
problemA. Ezzat and Two Subsequencestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputEzzat has an array of n integers (maybe negative). He wants to split it into two non-empty subsequences a and b,原创 2021-08-10 22:59:44 · 687 阅读 · 2 评论 -
CF #727(div2)A. Contest Start,找规律,数学
problemA. Contest Starttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n people participating in some contest, they start participating in x minutes intervals. That means the first partic原创 2021-06-24 15:54:40 · 760 阅读 · 0 评论 -
CF #727(div2)C. Stable Groups,贪心,排序
problemC. Stable Groupstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n students numerated from 1 to n. The level of the i-th student is ai. You need to split the students into stable gr原创 2021-06-24 15:52:20 · 678 阅读 · 0 评论 -
CF #727(div2)D. PriceFixed, 贪心,双指针
problemD. PriceFixedtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLena is the most economical girl in Moscow. So, when her dad asks her to buy some food for a trip to the country, she goes to the原创 2021-06-24 15:51:00 · 569 阅读 · 0 评论 -
CF #724(div2)C. Diluc and Kaeya,暴力,构造
problemC. Diluc and Kaeyatime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe tycoon of a winery empire in Mondstadt, unmatched in every possible way. A thinker in the Knights of Favonius with an e原创 2021-06-24 15:48:06 · 627 阅读 · 0 评论 -
CF #724(div2)A. Omkar and Bad Story,贪心,构造序列
problemA. Omkar and Bad Storytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOmkar has received a message from Anton saying “Your story for problem A is confusing. Just make a formal statement.” B原创 2021-06-24 15:46:21 · 663 阅读 · 0 评论 -
CF #723 (Div. 2)C1_C2. Potions (Hard Version)可反悔贪心
problemC2. Potions (Hard Version)time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThis is the hard version of the problem. The only difference is that in this version n≤200000. You can make hacks on原创 2021-05-30 18:08:40 · 742 阅读 · 0 评论 -
Codeforces Round #723 (Div. 2), A. Mean Inequality
problemA. Mean Inequalitytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array a of 2n distinct integers. You want to arrange the elements of the array in a circle such that no ele原创 2021-05-30 18:03:48 · 610 阅读 · 0 评论 -
Codeforces Round #722 (Div. 2)B. Sifid and Strange Subsequen
problemB. Sifid and Strange Subsequencestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA sequence (b1,b2,…,bk) is called strange, if the absolute difference between any pair of its elements is gre原创 2021-05-30 17:59:31 · 602 阅读 · 0 评论 -
Codeforces Round #722 (Div. 2) A. Eshag Loves Big Arrays
problemA. Eshag Loves Big Arraystime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputEshag has an array a consisting of n integers.Eshag can perform the following operation any number of times: choose原创 2021-05-30 17:58:14 · 641 阅读 · 0 评论 -
Codeforces Round #720 (Div. 2), B. Nastia and a Good Array
problemB. Nastia and a Good Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNastia has received an array of n positive integers as a gift.She calls such an array a good that for all i (2≤i≤n原创 2021-05-30 17:56:28 · 598 阅读 · 0 评论 -
Codeforces Round #720 (Div. 2) A. Nastia and Nearly Good Num
problemA. Nastia and Nearly Good Numberstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNastia has 2 positive integers A and B. She defines that:The integer is good if it is divisible by A⋅B;Othe原创 2021-05-30 17:55:11 · 585 阅读 · 0 评论 -
Codeforces Global Round 14, D. Phoenix and Socks
problemD. Phoenix and Sockstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTo satisfy his love of matching socks, Phoenix has brought his n socks (n is even) to the sock store. Each of his socks h原创 2021-05-29 19:39:21 · 651 阅读 · 0 评论 -
Codeforces Global Round 14, C. Phoenix and Towers
problemC. Phoenix and Towerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPhoenix has n blocks of height h1,h2,…,hn, and all hi don’t exceed some value x. He plans to stack all n blocks into m s原创 2021-05-29 19:38:12 · 652 阅读 · 0 评论 -
Codeforces Global Round 14, B. Phoenix and Puzzle
problemB. Phoenix and Puzzletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPhoenix is playing with a new puzzle, which consists of n identical puzzle pieces. Each puzzle piece is a right isoscele原创 2021-05-29 19:36:36 · 641 阅读 · 0 评论 -
Codeforces Global Round 14,A. Phoenix and Gold
problemA. Phoenix and Goldtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPhoenix has collected n pieces of gold, and he wants to weigh them together so he can feel rich. The i-th piece of gold ha原创 2021-05-29 18:56:13 · 612 阅读 · 0 评论 -
Codeforces Round #716 (Div. 2) A. Perfectly Imperfect Array
problemA. Perfectly Imperfect Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiven an array a of length n, tell us whether it has a non-empty subsequence such that the product of its elements原创 2021-05-29 18:51:12 · 555 阅读 · 0 评论 -
Codeforces Round #716 (Div. 2), B. AND 0, Sum Big, 快速幂结论题
problemB. AND 0, Sum Bigtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBaby Badawy’s first words were “AND 0 SUM BIG”, so he decided to solve the following problem. Given two integers n and k, co原创 2021-05-29 18:49:41 · 603 阅读 · 0 评论 -
Codeforces Round #716 (Div. 2) C. Product 1 Modulo N
problemC. Product 1 Modulo Ntime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNow you get Baby Ehab’s first words: “Given an integer n, find the longest subsequence of [1,2,…,n−1] whose product is 1原创 2021-05-29 18:47:29 · 583 阅读 · 0 评论 -
【Codeforces 1421 D】Hexagons,贪心,模拟
problemD. Hexagonstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLindsey Buckingham told Stevie Nicks “Go your own way”. Nicks is now sad and wants to go away as quickly as possible, but she live原创 2021-02-22 20:20:24 · 599 阅读 · 0 评论 -
【Codeforces 1462 F】The Treasure of The Segments,贪心,二分,排序
problemF. The Treasure of The Segmentstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp found n segments on the street. A segment with the index i is described by two integers li and ri — c原创 2021-02-22 19:56:07 · 648 阅读 · 0 评论 -
【Codeforces 1426 E】Rock, Paper, Scissors,贪心!算反面
problemE. Rock, Paper, Scissorstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice and Bob have decided to play the game “Rock, Paper, Scissors”.The game consists of several rounds, each round i原创 2021-02-22 19:29:52 · 770 阅读 · 0 评论 -
【Codeforces 1474 C】Array Destruction,枚举,multiset模拟
problemC. Array Destructiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou found a useless array a of 2n positive integers. You have realized that you actually don’t need this array, so you dec原创 2021-02-21 20:57:33 · 607 阅读 · 0 评论 -
【Codeforces 1472 E】Correct Placement,结构排序,二分搜索
problemE. Correct Placementtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp has invited n friends to celebrate the New Year. During the celebration, he decided to take a group photo of all原创 2021-02-21 18:00:26 · 662 阅读 · 1 评论 -
【Codeforces 1461 D】Divide and Summarize,二分,分治,贪心
problemD. Divide and Summarizetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike received an array a of length n as a birthday present and decided to test how pretty it is.An array would pass t原创 2021-02-21 15:31:16 · 663 阅读 · 0 评论 -
【Codeforces 1462 E2】Close Tuples (hard version),排序,二分,贪心,组合数
problemE2. Close Tuples (hard version)time limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThis is the hard version of this problem. The only difference between the easy and hard versions is the constr原创 2021-02-15 16:28:49 · 655 阅读 · 0 评论 -
【Codeforces 1462 E1】Close Tuples (easy version),排序,二分,贪心,组合数
problemE1. Close Tuples (easy version)time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThis is the easy version of this problem. The only difference between easy and hard versions is the constraint原创 2021-02-15 16:26:30 · 738 阅读 · 0 评论 -
【Codeforces 1461 C】Random Events,贪心,概率统计
problemC. Random Eventstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRon is a happy owner of a permutation a of length n.A permutation of length n is an array consisting of n distinct integers原创 2021-02-15 15:44:40 · 618 阅读 · 0 评论