贪心
文章平均质量分 87
Whowell
欢迎自荐或推荐实习/校招(字节)!
加油,加油,朝着自己的梦想!!!!!
展开
-
L2-003. 月饼
L2-003. 月饼仔细读题!!!!!贪心解决。。。#include<bits/stdc++.h>#include<cstdlib>#define ll long longusing namespace std;const int maxn = 1e5+7;typedef struct node{ double w; double yu;} ...原创 2018-03-23 20:52:55 · 143 阅读 · 0 评论 -
Codeforces 732 B. Cormen — The Best Friend Of a Man [ 贪心 ]
B. Cormen — The Best Friend Of a Mantime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently a dog was bought for Polycarp. The dog's name is Corme...原创 2018-04-29 00:07:37 · 146 阅读 · 0 评论 -
Codeforces DP 练习
Codeforces 466 C. Number of Ways【前缀】C. Number of Waystime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've got array a[1], a[2], ..., a[n], consi...原创 2018-04-29 13:01:28 · 635 阅读 · 0 评论 -
Scientific Conference URAL - 1203[贪心 || DP]
1203. Scientific ConferenceTime limit: 1.0 secondMemory limit: 64 MBFunctioning of a scientific conference is usually divided into several simultaneous sections. For example, there may be a section on...原创 2018-05-07 21:47:52 · 155 阅读 · 0 评论 -
Minimal Coverage URAL - 1303
1303. Minimal CoverageTime limit: 1.0 secondMemory limit: 64 MBGiven set of line segments [Li, Ri] with integer coordinates of their end points. Your task is to find the minimal subset of the given se...原创 2018-05-26 18:35:01 · 350 阅读 · 0 评论 -
Codeforces 985 C. Liebig's Barrels[贪心]
C. Liebig's Barrelstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have m = n·k wooden staves. The i-th stave has length ai. You have to assem...原创 2018-05-24 21:57:18 · 174 阅读 · 0 评论 -
Laddu
Laddu All submissions for this problem are available.Read problems statements in Mandarin Chinese, Russian and Vietnamese as well.You might have heard about our new goodie distribution program aka th...原创 2018-04-12 17:15:32 · 257 阅读 · 0 评论 -
Educational Codeforces Round 45 (Rated for Div. 2) 990B. Micro-World [ 贪心 ]
B. Micro-Worldtime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputYou have a Petri dish with bacteria and you are preparing to dive into the harsh...原创 2018-06-11 15:28:21 · 308 阅读 · 0 评论 -
Educational Codeforces Round 45 990 E. Post Lamps [ 思维 + 贪心 ]
E. Post Lampstime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputAdilbek's house is located on a street which can be represented as the OX axis. T...原创 2018-06-12 10:31:38 · 726 阅读 · 3 评论 -
Codeforces 550 A. Two Substrings
A. Two Substringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given string s. Your task is to determine if the given string s contains ...原创 2018-04-28 23:19:02 · 204 阅读 · 0 评论 -
Codeforces 489 C. Given Length and Sum of Digits...[ 贪心 ]
C. Given Length and Sum of Digits...time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a positive integer m and a non-negative integer s. You...原创 2018-04-28 16:51:15 · 195 阅读 · 2 评论 -
codeforces 962 E. Byteland, Berland and Disputed Cities
E. Byteland, Berland and Disputed Citiestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe cities of Byteland and Berland are located on the axis...原创 2018-04-28 10:14:15 · 287 阅读 · 0 评论 -
2017 EC-final Straight Master
8508 Straight Master题意:对于一副特殊的扑克牌,给定每种点数的牌数,问是否可以拆分成若干个长度为3-5的顺子。思路:长度大于5的顺子一定可以拆成若干个长度为3-5的顺子。将原序列差分(后一个减去前一个), 然后贪心扫描(从前往后扫描,正数跟最近的负数匹配,如果与最近的负数距离小于3,则无解,如果最后序列变为0则表示有解。代码:#include<bits/stdc++.h&...原创 2018-04-07 14:58:45 · 1210 阅读 · 0 评论 -
最少拦截系统_HDU 1257_(贪心)
最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 52496 Accepted Submission(s): 20548Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦...原创 2018-04-15 11:24:10 · 160 阅读 · 0 评论 -
第十六届埃森哲杯 A Wasserstein Distance
AWasserstein Distance题目描述 最近对抗生成网络(GAN)很火,其中有一种变体WGAN,引入了一种新的距离来提高生成图片的质量。这个距离就是Wasserstein距离,又名铲土距离。这个问题可以描述如下:有两堆泥土,每一堆有n个位置,标号从1~n。第一堆泥土的第i个位置有ai克泥土,第二堆泥土的第i个位置有bi克泥土。小埃可以在第一堆泥土中任意移挪动泥土,具体地从第i个位置移动...原创 2018-04-16 18:59:53 · 178 阅读 · 0 评论 -
CodeForces - 808C. Tea Party
C. Tea Partytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp invited all his friends to the tea party to celebrate the holiday. He has n cu...原创 2018-04-05 14:35:16 · 185 阅读 · 0 评论 -
Gym 101606A Alien Sunset [贪心+暴力]
题意:题目很简单,就是说现在想找一个最早的时间,所有星球都在晚上,现在已经知道各个星球的自转周期,并且知道他们各自日出日落时间。。。思路:一共100*1850天,那样我直接枚举,找到第一个n个都是夜晚的天就可以了。。代码:#include<bits/stdc++.h>#include<algorithm>#define ll long longusing names...原创 2018-04-30 17:43:34 · 625 阅读 · 0 评论 -
codeforces 964B Messages
B. Messagestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n incoming messages for Vasya. The i-th message is going to be received after ...原创 2018-04-20 18:00:43 · 421 阅读 · 0 评论 -
Codeforces Round #480 (Div. 2) C. Posterized
C. Posterizedtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputProfessor Ibrahim has prepared the final homework for his algorithm’s class. He asked ...原创 2018-05-11 13:00:34 · 134 阅读 · 0 评论 -
Wannafly挑战赛15 A 最小化价格[贪心+优先队列]
题目描述 现有n组人,m个地点,给出每组人的人数,每个地点可容纳的最大人数和选择的价格要求一种方式,使得每组人都到一个各不相同的地点,最小化选择的价格每个队伍的人都要在同一个地方每个地方只能有一个队伍输入描述:第一行n,m第二行n个数,表示每组的人数接下来m行,每行两个数,表示可容纳的最大人数和选择的价格输出描述:输出最小化选择的价格,无解输出-1示例1输入3 42 3 41 22 3...原创 2018-05-12 17:59:10 · 140 阅读 · 0 评论 -
Codeforces Round #487 (Div. 2) B. A Tide of Riverscape [贪心]
B. A Tide of Riverscapetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe records are expressed as a string ss of characters '0', '1' and '.', whe...原创 2018-06-12 20:08:53 · 168 阅读 · 0 评论