ACM
文章平均质量分 79
Rachel-Zhang
yiyan程序员 https://weibo.com/u/2607574543
展开
-
hdu 1754 线段树
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3375 Accepted Submission(s): 1123Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某原创 2010-02-10 15:36:00 · 3097 阅读 · 0 评论 -
hdu 1023 Train Problem II 高精训练
Train Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1106 Accepted Submission(s): 654Problem DescriptionAs we all know the T原创 2010-02-12 01:04:00 · 5451 阅读 · 3 评论 -
hdu 1018
很久没A题。。。原来学过的都忘了……很久以前的一个题,试着再A一遍也难了,物是人非啊……复习一下吧! Big NumberTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6291 Accepted Sub原创 2010-02-09 14:17:00 · 8395 阅读 · 2 评论 -
hdu 1828 picture 线段树
Picture Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 249 Accepted Submission(s): 144Problem DescriptionA number of rectangular poste原创 2010-02-12 23:58:00 · 3850 阅读 · 2 评论 -
hdu 1025
悲剧了……看了好久才明白这是求最长递增子序列!留个底儿以后也许有用…… #include #define maxn 500002 using namespace std; int dp[maxn]; int n,t; int p[maxn]; void Solve() { int i,low,up,mid,len=1;原创 2010-02-14 13:20:00 · 5421 阅读 · 2 评论 -
Game Prediction
Game PredictionTime Limit:1000MS Memory Limit:65536KTotal Submit:1 Accepted:1 Description Suppose there are M people, including you, playing a special card game. At the beginning, each player r原创 2010-03-22 17:02:00 · 5330 阅读 · 4 评论 -
Radar Installation
Radar InstallationTime Limit:1000MS Memory Limit:10000KTotal Submit:55 Accepted:18 Description Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the othe原创 2010-03-25 09:03:00 · 3267 阅读 · 1 评论 -
Labeling Balls
Problem D:Labeling BallsTime Limit:1000MS Memory Limit:65536KTotal Submit:12 Accepted:5 Description Windy has N balls of distinct weights from 1 unit to N units. Now he tries to label them with原创 2010-03-23 19:37:00 · 3004 阅读 · 0 评论 -
Equipment Box(计算几何)
设计到角度的问题,轻松!Equipment BoxTime Limit:1000MS Memory Limit:65536KTotal Submit:69 Accepted:14 Description There is a large room in the Pyramid called Room-of-No-Return. Its floor is covered by re原创 2010-03-25 12:04:00 · 2489 阅读 · 1 评论 -
pku 2593
http://acm.pku.edu.cn/JudgeOnline/problem?id=2593 类似2479,一串最大连续和分割成两部分。 #include using namespace std;int a[100001],l[100001],r[100002];int main(){ int n,sum,max; while(1)原创 2010-03-26 19:42:00 · 1799 阅读 · 0 评论 -
Gone Fishing (经典贪心)
Gone FishingTime Limit:1000MS Memory Limit:65536KTotal Submit:59 Accepted:21 Description John is going on a fishing trip. He has h hours available (1 = 0 ), is known. Each 5 minutes of fishing原创 2010-04-11 18:32:00 · 2189 阅读 · 0 评论 -
恶魔城 acm
恶魔城时间限制(普通/Java):1000MS/3000MS 运行内存限制:65536KByte总提交:137 测试通过:37描述上帝需要创造一位战士去消灭撒旦,这位战士必须要穿过恶魔城才能与撒旦决斗。恶魔城内有M条连接N个路口(从1到N编号)的街道,每一条街道都是单向的(也就是说你不能逆着该街道指定的方向走),并且在城内无论怎么走都不可原创 2010-04-12 17:10:00 · 2331 阅读 · 0 评论 -
Attack of Panda Virus
rules: The virus can only spread along the network from the already infected computers to the clean ones. If a computer has already been infected by one virus variation, it will never be infec原创 2010-04-13 13:40:00 · 2691 阅读 · 0 评论 -
Murder in Restaurant
Murder in RestaurantTime Limit: 1 Second Memory Limit: 32768 KB Murder in closet happened again in a small restaurant and Conan went there to collect evidence with Kogoro. After they reac原创 2010-04-11 09:22:00 · 1881 阅读 · 0 评论 -
Sudoku
Sudoku Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 3Font: <span onclick="function onclick(){ProFont原创 2010-04-12 08:01:00 · 1825 阅读 · 0 评论 -
A Stack or A Queue?
Do you know stack and queue? Theyre both important data structures. A stack is a "first in last out" (FILO) data structure and a queue is a "first in first out" (FIFO) one. Here comes the problem:原创 2010-04-02 12:35:00 · 2501 阅读 · 0 评论 -
80ers' Memory
I guess most of us are so called 80ers, which means that we were born in the 1980s. This group of people shared a lot of common memories. For example, the Saint Seiya, the YoYo ball, the Super Mario,原创 2010-04-02 13:14:00 · 2113 阅读 · 0 评论 -
Second-price Auction
Do you know second-price auction? Its very simple but famous. In a second-price auction, each potential buyer privately submits, perhaps in a sealed envelope or over a secure connection, his (or h原创 2010-04-02 14:30:00 · 2554 阅读 · 0 评论 -
Beautiful Meadow
The 4th Zhejiang Provincial Collegiate Programming Contest - 1002Beautiful Meadow Time Limit: 1 Second Memory Limit: 32768 KB <!-- Problem text file for ZheJiang University Online Jud原创 2010-04-15 20:47:00 · 2762 阅读 · 1 评论 -
Light Bulb(浙江省省赛6th)
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=3366 zju3366 Compared to wildleopards wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one原创 2010-04-02 19:36:00 · 4422 阅读 · 0 评论 -
Connect them
You have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is connecting computers i and j is the same as connec原创 2010-04-03 10:15:00 · 1839 阅读 · 0 评论 -
K-Nice
This is a super simple problem. The description is simple, the solution is simple. If you believe so, just read it on. Or if you dont, just pretend that you cant see this one. We say an element is原创 2010-04-02 18:34:00 · 2564 阅读 · 0 评论 -
Musical Chairs(约瑟夫问题高效算法)
In the traditional game of Musical Chairs, N + 1 children run around N chairs (placed in a circle) as long as music is playing. The moment the music stops, children run and try to sit on an available原创 2010-04-05 20:33:00 · 3204 阅读 · 0 评论 -
San Guo Sha
Problem DescriptionSan Guo Sha is a popular Board Game. There are four kinds of cards: identity, role, life and magic card. Today we just regard the identity cards. There are four kinds of identity:原创 2010-04-04 19:07:00 · 3254 阅读 · 11 评论 -
Connect the Cities
Problem DescriptionIn 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The government原创 2010-04-04 19:14:00 · 2038 阅读 · 0 评论 -
Anniversary party
Problem B Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 5 Accepted Submission(s) : 2Font: <span onclick="function onclick(){ProFont(原创 2010-04-05 20:36:00 · 1608 阅读 · 0 评论 -
Reversi
Problem DescriptionReversi, also called Othello, is a two-sided game.Each of the two sides corresponds to one player; they are referred to here as light and dark after the sides of Othello pieces, b原创 2010-04-03 18:43:00 · 1955 阅读 · 0 评论 -
Seinfeld
SeinfeldTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 284 Accepted Submission(s): 173Problem DescriptionI’m out of stories. For years原创 2010-04-07 17:33:00 · 1464 阅读 · 0 评论 -
Parencodings
ParencodingsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 134 Accepted Submission(s): 89Problem DescriptionLet S = s1 s2 … s2n be a w原创 2010-04-07 19:56:00 · 2469 阅读 · 0 评论 -
统计一个整数的二进制中1的个数(位运算技巧)
int CountNumberOfOne(int number){ int counter = 0; while (number) { counter++; number &= number - 1 ; } return counter;}原创 2010-04-08 17:01:00 · 2857 阅读 · 1 评论 -
ACM 模板列表
1:数学1.1:数论1.1.1:中国剩余定理 1.1.2:欧拉函数 1.1.3:欧几里得定理 1.1.3.1:欧几里得定理 1.1.3.2:扩展欧几里得 1.1.4:大数分解与素数判定1.1.5:佩尔方程 1.2:组合数学1.2.1:排列组合1.2.2:容斥原理1.2.3:递推关系原创 2010-04-09 19:08:00 · 2721 阅读 · 3 评论 -
CAPTCHA zju 校赛 acm
CAPTCHATime Limit: 1 Second Memory Limit: 32768 KB A CAPTCHA (Completely Automated Public Turing Test to Tell Computers and Humans Apart) is a program that generates and grades tests that原创 2010-04-10 20:59:00 · 4682 阅读 · 0 评论 -
Get Sauce
acm zju 3305 Get SauceTime Limit: 5 Seconds Memory Limit: 32768 KB In order to celebrate the 8th anniversary of ZOJ, LCLL goes to a sauce factory to "Get Sauce". The factory has N kin原创 2010-04-08 15:24:00 · 3080 阅读 · 0 评论 -
机器人搬重物 acm
ROBOT机器人搬重物Time Limit:1000MS Memory Limit:65536KTotal Submit:7 Accepted:4 Description 机器人移动学会(RMI)现在正尝试用机器人搬运物品。 机器人的形状是一个直径1.6米的球。在试验阶段,机器人被用于在一个储藏室中搬运货物。 储藏室是一个N*M的网格,有些格子为不可移动的障碍。 机器人的中心总是在格原创 2010-04-26 14:49:00 · 4935 阅读 · 2 评论 -
算法艺术——网络最大流
USACO 4.2.1 Ditch 网络最大流问题算法小结通过 USACO 4.2.1 Ditch 学习一下最大流算法 。可惜它给的测试数据几乎没有任何杀伤力,后面测试时我们采用 DD_engi 写的程序生成的加强版数据。总体上来说,最大流算法分为两大类:增广路 (Augmenting Path) 和预流推进重标号 (Push Relabel) 。也有算法同时借鉴了两者的长处,如原创 2010-05-04 16:32:00 · 15656 阅读 · 5 评论 -
字典树 模板
http://acm.hdu.edu.cn/showproblem.php?pid=1251建立字典树,求以……为前缀的单词个数 统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 3656 Accepted S原创 2010-05-07 11:01:00 · 3738 阅读 · 2 评论 -
最短路径 记忆路径
现在只写了Floyd方法,改天有空再打Dijkstra的~先贴一下代码,还有事要做... #include #include using namespace std;#define N 200int path[N][N]; //记录路径 int s[N][N]; //记录两点间的最短距离 int n,table[N][N];void原创 2010-05-16 17:49:00 · 2493 阅读 · 0 评论 -
Fire Net 搜索 贪心
Fire Net<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 1453 Accepted Submission(s): 811<br /><br />Problem DescriptionSuppose that we have a square city with straight streets. A map of原创 2010-07-11 09:34:00 · 2617 阅读 · 0 评论 -
ACM Commands
<br />Commands<br />Time Limit:1000MS Memory Limit:65536K<br />Total Submit:51 Accepted:14 <br />Description<br />You are standing on some arbitrary point in the infinite plane. <br />You are given some string commands that contains the commands you have原创 2010-07-14 12:37:00 · 1940 阅读 · 0 评论 -
Catch That Cow
<br />Catch That Cow<br />Time Limit:2000MS Memory Limit:65536K<br />Total Submit:118 Accepted:30 <br />Description<br />Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 10原创 2010-07-16 18:12:00 · 4231 阅读 · 0 评论