困难
文章平均质量分 76
ccyy-
这个作者很懒,什么都没留下…
展开
-
POJ2411: Mondriaan's Dream(1*2铺地砖,DP)
Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use his toilet paper to draw on, for all of h原创 2015-04-11 18:41:07 · 1080 阅读 · 0 评论 -
zoj 2836 Number Puzzle(容斥,求1到m有多少个数能被数组里任意一个整除)
Given a list of integers (A1, A2, ..., An), and a positive integer M, please find the number of positive integers that are not greater than M and dividable by any integer from the given list.Input原创 2015-04-23 12:55:32 · 542 阅读 · 0 评论 -
zoj 2852 Deck of Cards扑克牌(三维dp)
21-point is a small game played with cards. Its aim is to accumulate the points on the cards so as to get 21 points. This game also appears on some cell phones.To simplify the problem, let's have原创 2015-04-19 21:27:22 · 725 阅读 · 0 评论 -
zoj 3647 Gao the Grid (求三角形的个数,困难)
A n * m grid as follow:Count the number of triangles, three of whose vertice must be grid-points.Note that the three vertice of the triangle must not be in a line(the right picture is not a原创 2015-04-15 16:04:25 · 755 阅读 · 0 评论 -
zoj 3868 GCD Expectation(容斥原理)
Edward has a set of n integers {a1, a2,...,an}. He randomly picks a nonempty subset {x1, x2,…,xm} (each nonempty subset has equal probability to be picked), and would like to know the expectation of原创 2015-04-15 17:09:24 · 508 阅读 · 0 评论 -
zoj 3862 Intersection (技巧题)
Edward has 2n points on the plane conveniently labeled with 1,2,…,2n. Each point is connected exactly with another point by a segment.Edward finds that some segments intersecting with some others.原创 2015-04-15 23:39:44 · 525 阅读 · 0 评论 -
hznu 1652 能量项链(dp,难)
在Mars星球上,每个Mars人都随身佩带着一串能量项链。在项链上有 N颗能量珠。能量珠是一颗有头标记与尾标记的珠子,这些标记对应着某个正整数。并且,对于相邻的两颗珠子,前一颗珠子的尾标记一定等于后一颗珠子的头标 记。因为只有这样,通过吸盘(吸盘是Mars人吸收能量的一种器官)的作用,这两颗珠子才能聚合成一颗珠子,同时释放出可以被吸盘吸收的能量。如果前一颗 能量珠的头标记为m,尾标记为r,后一颗能原创 2015-04-16 22:46:04 · 477 阅读 · 0 评论 -
zoj 3785 What day is that day?(找规律,KMP)
It's Saturday today, what day is it after 11 + 22 + 33 + ... + NN days?InputThere are multiple test cases. The first line of input contains an integer T indicating the number of test cases. Fo原创 2015-04-16 19:44:25 · 518 阅读 · 0 评论 -
zoj 3329 One Person Game(概率(期望)+dp)经典
There is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2 and Die3. Die1 has K1 faces.Die2 has K2 faces. Die3 has K3 faces. All the dice are fair dice, so the probab原创 2015-04-05 14:05:02 · 531 阅读 · 0 评论 -
【codechef】 Count Substrings (大数技巧题)(二分+计数,易超时)
You are given a string S of length N consisting only of 0s and 1s. You are also given an integer K.You have to answer Q queries. In the ith query, two integers Li and Ri are given. Then you should原创 2015-04-09 18:22:06 · 588 阅读 · 0 评论 -
【编程之美2015资格赛】基站选址(数学题)
需要在一个N × M的网格中建立一个通讯基站,通讯基站仅必须建立在格点上。网格中有A个用户,每个用户的通讯代价是用户到基站欧几里得距离的平方。网格中还有B个通讯公司,维护基站的代价是基站到最近的一个通讯公司的路程(路程定义为曼哈顿距离)。在网格中建立基站的总代价是用户通讯代价的总和加上维护基站的代价,最小总代价。输入第一行为一个整数T,表示数据组数。每组数据第一行为四个原创 2015-04-21 08:47:05 · 733 阅读 · 0 评论 -
zoj 3780 Paint the Grid Again(拓扑排序)
Leo has a grid with N × N cells. He wants to paint each cell with a specific color (either black or white).Leo has a magical brush which can paint any row with black color, or any column with whit原创 2015-04-16 23:03:45 · 450 阅读 · 0 评论 -
zoj 2967 Colorful Rainbows求不被覆盖的直线数(贪心)
Evelyn likes drawing very much. Today, she draws lots of rainbows on white paper of infinite size, each using a different color. Since there're too many rainbows now, she wonders, how many of them can原创 2015-04-21 18:19:25 · 719 阅读 · 0 评论 -
zoj 3870 Team Formation(位运算,超时)
For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from Nstudents of his university.Edward knows the skill level of each student. He has fo原创 2015-04-29 18:27:16 · 417 阅读 · 0 评论 -
hihocoder 1165 : 益智游戏(素数的处理模板)
幽香今天心情不错,正在和花田里的虫子玩一个益智游戏。这个游戏是这样的,对于一个数组A,幽香从A中选择一个数a,虫子从A中选择一个数b。a和b可以相同。她们的分数是a*b的因子的个数。幽香和虫子当然想要获得尽可能的高的分数,你能告诉她们应该选择哪两个数吗。由于幽香是个非常随意的人,数组A中的元素都是她随机选择的。输入一行一个数n,表示A中整数的数量。接下来一行n个数,分别原创 2015-05-09 00:44:17 · 666 阅读 · 0 评论 -
【codechef】Magical Transformation(dp,技巧题)
Irfan and his brother Yusuf were looking at photographs of their vacation to Hawaii. Irfan noticed something interesting. He noticed that if their aunt Mansi had a big beard and a moustache she would原创 2015-05-09 15:19:06 · 460 阅读 · 0 评论 -
hdu 4734 F(x)(数位dp,记忆化深搜,灵活题)
For a decimal number x with n digits (AnAn-1An-2 ... A2A1), we define its weight as F(x) = An * 2n-1 + An-1 * 2n-2 + ... + A2 * 2 + A1 * 1. Now you are given two numbers A and B, please calculate ho原创 2015-05-09 21:49:41 · 533 阅读 · 0 评论 -
编程之美初赛第二场 扑克牌(四维dp,难)
一副不含王的扑克牌由52张牌组成,由红桃、黑桃、梅花、方块4组牌组成,每组13张不同的面值。现在给定52张牌中的若干张,请计算将它们排成一列,相邻的牌面值不同的方案数。牌的表示方法为XY,其中X为面值,为2、3、4、5、6、7、8、9、T、J、Q、K、A中的一个。Y为花色,为S、H、D、C中的一个。如2S、2H、TD等。输入第一行为一个整数T,为数据组数。之后每组数据占一行。这原创 2015-05-01 10:45:04 · 1054 阅读 · 0 评论 -
【codechef】Chef and Prime Divisors(判断A能否被B的所有素因子整除)
#include #include #include #include #include #include #include #include #include #include#define ll long long #define mod 1000000007using namespace std;ll gcd(ll a,ll b){原创 2015-05-13 23:24:18 · 545 阅读 · 0 评论 -
hdu 5229 ZCC loves strings(博弈)
ZCC有N个字符串,他正在和Miss G.用这N个字符串玩一个小游戏。ZCC会从这N个串中等概率随机选两个字符串(不可以是同一个)。然后,ZCC和Miss G.轮流操作。Miss G.总是先操作的。在每轮中,操作者可以选择操作A或操作B。操作A:在两个串中选择一个当前非空的串,然后在这个串的末尾删去一个字符。操作B: 若当前两个串完全相同且非空,则可以使用这个操作。此时两个串都被清空。原创 2015-05-16 20:23:05 · 487 阅读 · 0 评论 -
编程之美初赛第二场 攻城略地(贪心,图论)
题意:A、B两国间发生战争。已知A国共有n个城市(编号1, 2, …, n),城市间有一些道路相连。每座城市的防御力为w,直接攻下该城的代价是w。若该城市的相邻城市(有道路连接)中有一个已被占领,则攻下该城市的代价为0。除了占领城市,B国还要摧毁A国的交通系统,因而他们需要破坏至少k条道路。由于道路损毁,攻下所有城市的代价相应会增加。假设B国可以任意选择要摧毁的道路,那么攻下所有城市的最小代价是多原创 2015-05-07 09:49:03 · 653 阅读 · 0 评论 -
hdu 3622 Bomb Game(2-SAT,二分)
Robbie is playing an interesting computer game. The game field is an unbounded 2-dimensional region. There are N rounds in the game. At each round, the computer will give Robbie two places, and Robbie原创 2015-05-07 22:06:13 · 534 阅读 · 0 评论 -
zoj 3784 String of Infinity(难题,方法妙)
Given a set of banned words S, please find out whether it is possible to construct a string str1..∞ with infinite length that fulfills the following constrains:It consists of only the first M type原创 2015-04-16 20:31:31 · 869 阅读 · 0 评论 -
【codechef】Steady tables(dp)
Input:31 12 22 3Output:225273ExplanationTest case 1 : There are only 2 such grids possible 0 and 1.http://www.codechef.com/JUNE15/problems/STDYTAB这题没考虑到DP是我的错。。一直以为是推规律。。原创 2015-06-16 23:07:38 · 443 阅读 · 0 评论 -
【codechef】 Historical Junctions(开放想方法,分类)
Input:24 41 22 33 44 14 61 22 33 44 11 32 4Output:4 41 52 63 74 80 0http://www.codechef.com/SNCK151A/problems/HISTJUNK当n虽然4的这种情况也是,不过简单起见我们也可以选择加边(1-3是因为“不能新建超过n*(n-原创 2015-05-28 13:59:55 · 439 阅读 · 0 评论 -
【百度之星资格赛】 下棋(构图)
N∗M的棋盘上有一个受伤的国王与一个要去救援国王的骑士,他们每个单位时间必须同时移动一次寻找对方。如下图所示,黑色的图例表示国王(右)或骑士(左)当前所在的位置,那么灰色的位置表示在一次移动中他们可能到达的位置。国王伤势严重,因此他必须在K个单位时间内得到骑士的救援,否则会挂掉。问国王是否可以在K个单位时间内获得救援,如果可以,最短需要花多少个单位时间。Input第原创 2015-05-28 19:48:44 · 483 阅读 · 0 评论 -
spoj 694 求一个字符串中不同子串的个数
SPOJ Problem Set (classical)694. Distinct SubstringsProblem code: DISUBSTRGiven a string, we need to find the total number of its distinct substrings.InputT- number of test转载 2015-06-17 23:42:11 · 940 阅读 · 0 评论 -
【codechef】Special Shortest Walk(STL妙用,优先队列)
1 ≤ Sum of N over all test cases ≤ 100000 1 ≤ Sum of M over all test cases ≤ 500000 3 ≤ N ≤ 100000 2 ≤ M ≤ 500000 1 ≤ T ≤ 2000 1 ≤ Z ≤ 100000000 1 ≤ X,Y ≤ N X != Y source != sink and t原创 2015-05-18 14:16:07 · 563 阅读 · 0 评论 -
【百度之星初赛】序列变换(二分,贪心)
给定序列A={A1,A2,...,An}, 要求改变序列A中的某些元素,形成一个严格单调的序列B(严格单调的定义为:BiBi+1,1≤iN)。我们定义从序列A到序列B变换的代价为cost(A,B)=max(|Ai−Bi|)(1≤i≤N)。请求出满足条件的最小代价。注意,每个元素在变换前后都是整数。 Input第一行为测试的组数T(1≤T≤10原创 2015-05-31 10:38:52 · 680 阅读 · 0 评论 -
hdu 5261 蜀道难(deque 双端队列)
度度熊最近去四川游玩了一趟,在西南边,它发现了一个神奇的地方,那里有数不清的山,山脚的路组成了一个完美的圆,而山均匀的坐落在这个圆上。“此乃造物者之无尽藏也”,它大发诗情的感慨道。山高皆不一,度度熊现在很想知道,距离最远的两座山顶是哪两座山。由于山顶不能直接到达,从一座山顶到另一座山顶的唯一方法是,先下山,沿着山脚的圆走到另一个山脚,再上山。当然,在山脚可以选择任意方向行走。原创 2015-06-20 13:42:22 · 677 阅读 · 0 评论 -
【codechef】括号匹配,求子串最大值(灵活题)
Input34()()-1 -2 3 44(()]-1 -2 3 44[{]{1 2 3 4Sample Output710ExplanationFor first test case take last 2 elements: 3 + 4 = 7. For second test case take the middle 2 element原创 2015-06-20 20:40:44 · 458 阅读 · 0 评论 -
【百度之星初赛2】序列变换(最长上升子序列)
我们有一个数列A1,A2...An,你现在要求修改数量最少的元素,使得这个数列严格递增。其中无论是修改前还是修改后,每个元素都必须是整数。请输出最少需要修改多少个元素。 Input第一行输入一个T(1≤T≤10),表示有多少组数据每一组数据:第一行输入一个N(1≤N≤105),表示数列的长度第二行输入N个数A1,A2,...,An。每原创 2015-05-31 22:45:24 · 1168 阅读 · 0 评论 -
zoj 1002 Fire Net(不能位于同行或同列,问最多放几个)
Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.A blockhouse is a small castle原创 2015-06-03 23:03:00 · 654 阅读 · 0 评论 -
hdu 4282 A very hard mathematic problem(二分)
Haoren is very good at solving mathematic problems. Today he is working a problem like this: Find three positive integers X, Y and Z (X 1) that holds X^Z + Y^Z + XYZ = K where K is another转载 2015-05-19 23:13:55 · 413 阅读 · 0 评论 -
HDU 4445 Crazy Tank (物理题,枚举角度)
Crazy Tank was a famous game about ten years ago. Every child liked it. Time flies, children grow up, but the memory of happy childhood will never go.Now you’re controlling the tank Laotu on a原创 2015-05-19 23:21:31 · 483 阅读 · 0 评论 -
zoj 1097 Code the Tree(记忆化深搜构造树)
中文题意:http://www.bnuoj.com/bnuoj/problem_show.php?pid=1009#include #include #include #include #include #include #include #include #include #include #define ll long long using na原创 2015-05-09 18:27:17 · 1372 阅读 · 0 评论 -
【百度之星初赛2】魔法因子|乘某个数首末位互换(数学,灵活题)
有人说:人类是自己一步步进化的,而数学是上帝亲手创造的。度度熊最近也正沉醉于数学之美中,它发现了一种神奇的数字,取名曰:魔法因子。将因子记为X,如果有一些整数与这些因子做乘法后,结果仍然是整数,同时,结果数字的首位和末位会换交换位置,而其他位置上的数字恰好不变!这时X被认为是一个魔法因子。需要注意的是,用来相乘的这些整数不会含有前导0,但是如果交换的结果有前导0,又恰好是乘法的结果,这时仍原创 2015-05-31 23:04:46 · 918 阅读 · 0 评论 -
ZOJ 2091 Mean of Subsequence(博弈,反证法,结论巧妙)
Given N numbers in a line, we can determine a continuous subsequence by giving its start position and its length.PMH and Roy played a game the other day. Roy gives the start position first, then PMH原创 2015-05-27 19:48:55 · 575 阅读 · 0 评论 -
CF 549H. Degenerate Matrix(二分,退化矩阵灵活题)
The determinant of a matrix 2 × 2 is defined as follows:A matrix is called degenerate if its determinant is equal to zero.The norm ||A|| of a matrix A is defined as a maximum of absolute v原创 2015-06-09 13:16:55 · 1576 阅读 · 0 评论 -
CF 549D. Haar Features(神奇,不知道怎么推出来的)
The first algorithm for detecting a face on the image working in realtime was developed by Paul Viola and Michael Jones in 2001. A part of the algorithm is a procedure that computes Haar features. A原创 2015-06-09 18:55:25 · 900 阅读 · 0 评论