ACM!荣耀之路!

【已退役】

排序:
默认
按更新时间
按访问量

BAPC2014 J&&HUNNU11590:Jury Jeopardy

题意: 一个迷宫,人一开始处在出口位置,要求遍历一次迷宫之后,回到初始位置,现在给出行走的方案,要出画出迷宫 人一开始面向右边 F:往前走一步 R:右转并往前走一步 L:左转并往前走一步 B:后转并往前走一步 思路: 直接模拟即可 #include #inclu...

2015-08-13 00:07:51

阅读数:2709

评论数:0

BAPC2014 G&&HUNNU11587:Growling Gears

题意: 给出N个开口向下的抛物线的a,b,c,要求输出顶点最高的抛物线是哪一条 思路: 直接抛物线公式算得 #include #include #include #include #include #include #include #include #in...

2015-08-13 00:04:04

阅读数:1577

评论数:0

BAPC2014 K&&HUNNU11591:Key to Knowledge(中途相遇法)

题意: 有N个学生,有M题目 然后对应N行分别有一个二进制和一个整数 二进制代表该同学给出的每道题的答案,整数代表该同学的答案与标准答案相符的个数 要求判断标准答案有几个,如果标准答案只有一种,则输出标准答案 思路: 很容易想到状态压缩,但是很明显1变成1 也就是说,对于一个...

2015-08-12 23:59:08

阅读数:1378

评论数:0

BAPC2014 I&&HUNNU11589:Interesting Integers

题意: 对于我们已知的斐波那契数列,现在给出一个n,要我们求出一个新的斐波那契数列起始项,使得n能在新的斐波那契数列中,要求起始项y最小 思路: 我们知道 a3 = a1+a2 a4 = a1+2*a2 a5 = 2*a1+3*a2 a6 = 3*a1+5*a2 可以得到 an = fib[n...

2015-08-12 23:44:37

阅读数:1099

评论数:0

BAPC2014 E&&HUNNU11585:Excellent Engineers(线段树)

题意: 有n个程序员,每个程序员有三个能力值,当一个程序员三个能力值都小于另外一个程序员的时候,那么就可以淘汰那个程序员,问经过淘汰之后,还剩下几个程序员。 思路: 我们首先按照x排序,那么我们就只需要考虑y,z的情况了,这个时候可以用线段树,我们以y作为区间,以z作为值,每次查询只需要看1~...

2015-08-12 23:37:21

阅读数:1278

评论数:0

BAPC2014 C&&HUNNU11583:Citadel Construction(几何)

题意: 给出一系列的点,要求寻找最多4个点,使得组成一个面积最大的多边形 思路: 很显然只有两种情况,要么是三角形,要么是四边形 首先不难想到的是,先要把最外面的点都找出来,其实就是找凸包 但是并没有做过凸包,那么怎么办? 我们知道,ab与ac向量相乘得到ab*ac>=0的情况下,可以知...

2015-08-12 23:32:05

阅读数:974

评论数:0

BAPC2014 B&&HUNNU11582:Button Bashing(BFS)

题意: 给出n,m,代表微波炉有n个按钮,要求达到总时间为m 然后给出n个数,代表n个按钮能增加的时间,问最少几步,能够使得按出的总时间大于等于要求的时间,并且相差最小 输出最小的步数与相差的最小值 要求,当总时间小于0时,时间为0,大于3600时,时间为3600 思路: 直接暴力BFS,用V...

2015-08-12 23:17:05

阅读数:1087

评论数:0

HNU13383:The Big Painting

Problem description Samuel W. E. R. Craft is an artist with a growing reputation. Unfortunately, the paintings he sells do not provide him eno...

2015-08-10 19:57:00

阅读数:1176

评论数:0

HNU13377:Book Club(DFS)

Problem description Porto’s book club is buzzing with excitement for the annual book exchange event! Every year, members bring their favorite ...

2015-08-10 19:50:42

阅读数:1368

评论数:1

HNU11376:Golf Bot

Problem description Input The first line has one integer: N, the number of different distances the Golf Bot can shoot. Each o...

2015-08-10 19:47:31

阅读数:1014

评论数:0

HNU11374:GREAT+SWERC=PORTO(DFS)

Problem description We want to have a great SWERC at Porto this year and we approached this challenge in several ways. We even framed it as a ...

2015-08-10 19:41:48

阅读数:1347

评论数:1

hunnu11562:The Triangle Division of the Convex Polygon(第n个卡特兰数取模)

Problem description   A convex polygon with n edges can be divided into several triangles by some non-intersect diagonals. We denote d(n) is the...

2015-08-08 21:03:46

阅读数:1352

评论数:0

HDU5363:Key Set

Problem Description soda has a set S with n integers {1,2,…,n}. A set is called key set if the sum of integers in the set is an even number. He ...

2015-08-07 11:36:43

阅读数:1451

评论数:1

HDU5353:Average(贪心)

Problem Description There are n soda sitting around a round table. soda are numbered from 1 to n and i-th soda is adjacent to (i+1)-th soda,...

2015-08-07 11:30:58

阅读数:1831

评论数:0

HDU4647:Another Graph Game(贪心)

Problem Description Alice and Bob are playing a game on an undirected graph with n (n is even) nodes and m edges. Every node i has its own weight ...

2015-07-17 16:34:11

阅读数:1203

评论数:0

HDU4649:Professor Tian(概率)

Problem Description Timer took the Probability and Mathematical Statistics course in the 2012, But his bad attendance angered Professor Tian who i...

2015-07-17 16:30:27

阅读数:1034

评论数:0

HDU4634:Swipe Bo(BFS+状压)

Problem Description “Swipe Bo” is a puzzle game that requires foresight and skill.  The main character of this game is a square blue tofu called ...

2015-07-14 12:19:30

阅读数:1079

评论数:0

HDU4638:Group(线段树离线处理)

Problem Description There are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are fr...

2015-07-14 12:14:15

阅读数:1314

评论数:0

HDU4642:Fliping game

Problem Description Alice and Bob are playing a kind of special game on an N*M board (N rows, M columns). At the beginning, there are N*M coins in...

2015-07-14 12:12:13

阅读数:1265

评论数:0

HDU4639:Hehe

Problem Description As we all know, Fat Brother likes MeiZi every much, he always find some topic to talk with her. But as Fat Brother is so low p...

2015-07-14 12:04:15

阅读数:1284

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭