codeforces
文章平均质量分 84
wJs9528-1
这个作者很懒,什么都没留下…
展开
-
C. Watto and Mechanism
time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWatto, the owner of a spare parts store, has recently got an order for the原创 2015-07-25 21:15:30 · 731 阅读 · 0 评论 -
codeforces 719 C. Efim and Strange Grade(模拟)
题意:给一个小数,要求在t步内对小数点后进行四舍五入,变成尽量大的数,每次操作可以选择某一位四舍五入分析:模拟四舍五入的过程,从前往后找到第一个大于5的地方,向前推进,需要注意一下小数点前的数字的处理#include<cstring>#include<string>#include<iostream>#include<queue>#include<cstdio>#include<algor原创 2016-09-25 12:38:24 · 622 阅读 · 0 评论 -
codeforces 713 A. Sonya and Queries
题意: 有一个整数多重集合,对这个集合有三种操作: 1.+ a 在集合里面添加一个元素a 2.- a 在集合里面减少一个元素a 3.? x 询问集合里面满足条件a的元素有多少个 其中x仅由0,1组成1代表这个位置上一定为奇数,0代表为偶数,长度不相等补0分析: 仔细想想其实询问与数字是多少没有关系,而是和位置上的奇偶有关,那么假设奇数为1,偶数为0,那么每个数字就映射成了一个二进制数,接原创 2016-09-16 23:12:34 · 147 阅读 · 0 评论 -
codeforces 466C C. Number of Ways
题意:给出一个序列,求出这个序列切成三段相同值的方案数首先sum值一定整除3,否则方案数为0,接着预处理出sum/3和sum/3*2的下标,再扫一遍就能得到答案#include<cstring>#include<string>#include<iostream>#include<queue>#include<cstdio>#include<algorithm>#include<map>原创 2016-09-14 19:14:33 · 537 阅读 · 0 评论 -
CodeForces 208E Blood Cousins(树剖求lca + dfs序)
题意: 给出若干棵树,q次询问,每次询问某结点n向上k步的父节点的子树中有多少个和n是兄弟结点(深度相同) ps:这里的题意是将问题简化过后的 假设现在只有一棵树,首先考虑结点的子树如何确定,dfs序可以解决,再考虑向上k步的lca如何解决,倍增法求lca(弱不会),由于只会树剖向上爬,外加上树剖可以直接处理dfs序,所以就写树剖了…对于子树内符合条件的结点,只需要开10510^5个深度的ve原创 2016-09-02 10:31:21 · 531 阅读 · 0 评论 -
Codeforces 388B Fox and Minimal path(构造)
题意: 给出一个数字k,要求你构造一张无向图使得点1到点2的最短路径恰好有k条首先将k二进制化,然后看图就明白怎么构造了: 首先构造出最大的2的指数级部分,然后接下来在此链上继续并联一些点#include<cstring>#include<cstdio>#include<algorithm>#include<iostream>#include<map>using namespace原创 2016-08-31 16:45:39 · 446 阅读 · 0 评论 -
CodeForces 659E New Reform (图的遍历判环)
DescriptionBerland has n cities connected by m bidirectional roads. No road connects a city to itself, and each pair of cities is connected by no more than one road. It isnot guaranteed that y原创 2016-04-22 18:27:53 · 1506 阅读 · 0 评论 -
CodeForces 664B Rebus (调整策略)
DescriptionYou are given a rebus of form ? + ? - ? + ? = n, consisting of only question marks, separated by arithmetic operation '+' and '-', equality and positive integer n. The goal is to repl原创 2016-04-22 17:25:41 · 727 阅读 · 0 评论 -
CodeForces 632C The Smallest String Concatenation
You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.Given the list of strin原创 2016-04-22 16:18:28 · 594 阅读 · 0 评论 -
CodeForces 660C Hard Process (队列)
DescriptionYou are given an array a with n elements. Each element of a is either0 or 1.Let's denote the length of the longest subsegment of consecutive elements in a, consisting of only nu原创 2016-04-22 16:10:43 · 571 阅读 · 0 评论 -
Codeforces 652 B. z-sort
B. z-sortA student of z-school found a kind of sorting calledz-sort. The array a withn elements are z-sorted if two conditions hold:ai ≥ ai - 1 for all eveni, ai ≤ ai - 1 for all o原创 2016-03-26 11:03:30 · 573 阅读 · 0 评论 -
codeforces 652 A. Gabriel and Caterpillar
A. Gabriel and CaterpillarThe 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the heighth1 cm from the原创 2016-03-26 10:36:55 · 643 阅读 · 0 评论 -
CodeForces 589D Boulevard (一维区间判断相交 非线段交做法)
BoulevardTime Limit:2000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64uDescriptionWelcoming autumn evening is the best for walking along the boulevard and n people decid原创 2016-04-11 23:24:11 · 626 阅读 · 0 评论 -
CodeForces 622E Ants in Leaves (贪心策略 递推公式)
Ants in LeavesTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionTree is a connected graph without cycles. A leaf of a tree is any vertex connected w原创 2016-04-07 19:13:46 · 885 阅读 · 0 评论 -
codeforces 143 C.To Add or Not to Add (YY 二分 处理一下前缀和)
首先答案一定在已有数列中,那么将数列排序,从小到大找每个数在它之前能满足条件囊括的所有数,前缀和预处理一下中间差值即可,时间复杂度n*log(n)。#include#include#include#include#include#include#include#include#include#include//#pragma comment(linker, "/ST原创 2016-04-04 11:54:10 · 637 阅读 · 0 评论 -
codeforces 716 B. Anatoly and Cockroaches(greedy)
题意:给一些在一排的蟑螂涂色或者两两交换位置,使最终的颜色交替出现,输出最小步数枚举两种r和b在开头位置的情况,取最小,推一下计算公式就出来了#include<cstring>#include<string>#include<iostream>#include<queue>#include<cstdio>#include<algorithm>#include<map>#include<原创 2016-09-25 12:04:49 · 374 阅读 · 0 评论