2015年10月__pkm_

原创 Codeforces Round #327 (Div. 2) (C. Median Smoothing 找规律)

C. Median Smoothingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA schoolboy named Vasya loves reading books on programming

2015-10-28 09:27:02 660

原创 Codeforces Round #327 (Div. 2) (B. Rebranding 字符串的操作)

B. Rebrandingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe name of one small but proud corporation consists of n lowerca

2015-10-26 14:22:07 520

原创 Codeforces Round #327 (Div. 2) (A. Wizards' Duel 简单数学)

A. Wizards' Dueltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHarry Potter and He-Who-Must-Not-Be-Named engaged in a fight to

2015-10-26 14:12:12 465

原创 Codeforces 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest B题（排序贪心）

B. Layer Caketime limit per test6 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputDasha decided to bake a big and tasty layer cake. In order to d

2015-10-26 08:39:16 893

原创 Codeforces 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest D题（计算几何+判断线段相交）

D. Boulevardtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputWelcoming autumn evening is the best for walking along the boule

2015-10-25 10:43:30 789

原创 Codeforces 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest J题（BFS）

J. Cleaner Robottime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputMasha has recently bought a cleaner robot, it can clean a floo

2015-10-25 10:25:46 779

原创 Codeforces 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest I题（模拟）

I. Lotterytime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputToday Berland holds a lottery with a prize — a huge sum of money!

2015-10-25 10:22:06 661

原创 Codeforces 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest A题（String模拟）

A. Email Aliasestime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputPolycarp has quite recently learned about email alia

2015-10-21 08:49:06 840

原创 CF Cleaner Robot （BFS）

J. Cleaner Robottime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputMasha has recently bought a cleaner robot, it can clean a fl

2015-10-20 15:45:34 1114

原创 CF 585B Phillip and Trains（预处理+BFS）

题意：S表示人物的初始位置，每次人先向右边走一个单位，在选择向上，向下，或者不动，然后车会向左移动2个单位，现在问人时候能到最右边。思路：先预处理，每一个时刻，地图的状态，然后跑一遍BFS#include<bits/stdc++.h>using namespace std;const int maxn=103;const int inf=1<<28;#define LL long lon

2015-10-15 08:39:19 611

原创 CF584B Kolya and Tanya（数学计数，快速幂）

B. Kolya and Tanyatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputKolya loves putting gnomes at the circle table and giving t

2015-10-14 09:28:51 454

原创 ZOJ 3911 Prime Query（线段树区间操作）

题意：给你一个序列，有三种操作A v i操作：把数组下标是i的位置元素加上vR v,l,r操作：把区间[L,R]范围都变为vQ，L,R操作：查询区间[L,R]范围的素数个数思路:先用筛法把素数打表，然后线段树，区间操作，用延迟标记#include<cstdio>#include<algorithm>#include<set>using namespace std;#define

2015-10-12 09:34:51 787 3

原创 HDU2883 kebab(中等) [最大流]判断满流（数据离散化）

题意：有一个烧烤机，每次最多能烤 m 块肉，现在有 n 个人来买烤肉，每个人到达时间为 si，离开时间为 ei，点的烤肉数量为 ci，点的烤肉所需烘烤时间为 di，每个人要烤的肉可以分成若干份在同时烤，问是否存在一种方案可以满足所有顾客的需求。思路：建图很巧妙，参考网上思路，HDU3572 与本题有些相似之处，但是本题的变化在于，时间的区间跨度太大，不能够与区间的每一个时刻连边，但是注意到人的个

2015-10-02 10:59:07 408

qwesde