【ACM-图论】
qq_36424540
这个作者很懒,什么都没留下…
展开
-
201809-4 再卖菜
问题描述 在一条街上有n个卖菜的商店,按1至n的顺序排成一排,这些商店都卖一种蔬菜。 第一天,每个商店都自己定了一个正整数的价格。店主们希望自己的菜价和其他商店的一致,第二天,每一家商店都会根据他自己和相邻商店的价格调整自己的价格。具体的,每家商店都会将第二天的菜价设置为自己和相邻商店第一天菜价的平均值(用去尾法取整)。 注意,编号为1的商店只有一个相邻的商店2,编号为n的商店只有一...原创 2019-03-15 12:26:34 · 275 阅读 · 0 评论 -
SPFA以及其优化
SPFA(Shortest Path Faster Algorithm)是Bellman-Ford算法的一种队列实现,减少了不必要的冗余计算。SPFA,要从Bellman-ford的优化说起。在n个点m条边的图中,Bellman-ford的复杂度是n*m,依次对每条边进行松弛操作,重复这个操作n-1次后则一定得到最短路,如果还能继续松弛,则有负环。这是因为最长的没有环路的路,也只不转载 2017-08-06 23:53:31 · 217 阅读 · 0 评论 -
HDU - 1535 Invitation Cards
In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They原创 2017-08-06 09:57:35 · 256 阅读 · 0 评论 -
HDU - 5137
"Guanxi" is a very important word in Chinese. It kind of means "relationship" or "contact". Guanxi can be based on friendship, but also can be built on money. So Chinese often say "I don't have one ma原创 2017-08-06 09:52:57 · 337 阅读 · 0 评论 -
CodeForces - 449B Jzzhu and Cities
Jzzhu is the president of country A. There are n cities numbered from1 to n in his country. City1 is the capital of A. Also there are m roads connecting the cities. One can go from city ui to原创 2017-08-06 09:45:02 · 282 阅读 · 0 评论 -
HDU - 3499 Flight
Recently, Shua Shua had a big quarrel with his GF. He is so upset that he decides to take a trip to some other city to avoid meeting her. He will travel only by air and he can go to any city if there原创 2017-08-06 09:37:04 · 212 阅读 · 0 评论 -
编程中无穷大的设定
很多人可能设为0x7fffffff,这个数的确是32-bit int的最大值,符号位为0,其他的都是1但在很多情况下,0x7fffffff会出现错误,比如溢出,这样两个无穷大数相加会变成负数,还有如在做dijkstra求最短路时,当做松弛操作,判断if (d[u]+w[u][v]1.为了尽量避免以上的错误,我们可以改变无穷大的设定,可以将0x3f3f3f3f设为无穷大,0x3f3f转载 2017-08-05 21:40:41 · 2387 阅读 · 0 评论 -
Count The Pairs
With the 60th anniversary celebration of Nanjing University of Science and Technology coming soon, the university sets n tourist spots to welcome guests. Of course, Redwood forests in our university a原创 2017-08-05 11:21:57 · 349 阅读 · 0 评论 -
Bad Cowtractors
Bessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already done some surveying, and found M (1 <= M <= 20原创 2017-08-05 10:52:28 · 413 阅读 · 0 评论 -
Arctic Network
A certain local trucking company would like to transport some goods on a cargo truck from one place to another. It is desirable to transport as much goods as possible each trip. Unfortunately, one can原创 2017-08-05 10:42:35 · 242 阅读 · 0 评论 -
51Nod - 1459 迷宫游戏
你来到一个迷宫前。该迷宫由若干个房间组成,每个房间都有一个得分,第一次进入这个房间,你就可以得到这个分数。还有若干双向道路连结这些房间,你沿着这些道路从一个房间走到另外一个房间需要一些时间。游戏规定了你的起点和终点房间,你首要目标是从起点尽快到达终点,在满足首要目标的前提下,使得你的得分总和尽可能大。现在问题来了,给定房间、道路、分数、起点和终点等全部信息,你能计算在尽快离开迷宫的前提下,你的最大得原创 2017-08-07 16:21:15 · 269 阅读 · 0 评论 -
算法提高 道路和航路
问题描述农夫约翰正在针对一个新区域的牛奶配送合同进行研究。他打算分发牛奶到T个城镇(标号为1..T),这些城镇通过R条标号为(1..R)的道路和P条标号为(1..P)的航路相连。每一条公路i或者航路i表示成连接城镇Ai(1<=A_i<=T)和Bi(1<=Bi<=T)代价为Ci。每一条公路,Ci的范围为0<=Ci<=10,000;由于奇怪的运营策略,每一条航路的C...原创 2018-05-19 14:28:35 · 301 阅读 · 0 评论 -
1003 Emergency (25 分)
As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the l...原创 2018-11-09 20:14:40 · 145 阅读 · 0 评论 -
poj 3207 Ikki's Story IV - Panda's Trick
Descriptionliympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tired of such easy games and wants to play another game...原创 2018-10-09 20:32:39 · 122 阅读 · 0 评论 -
Vertex Cover CodeChef - VRTXCOVR
You are given an undirected graph G = (V, E) containing N nodes and M edges. The nodes are numbered from 1 to N. A subset C of V is a vertex cover if for every edge (u, v) ∈ E, at least one of u and v...原创 2018-10-11 09:37:21 · 237 阅读 · 0 评论 -
Smallest Minimum Cut hdu-6214
Problem DescriptionConsider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes set V into two parts such that s and t belong to different parts. The cut set is the subset...转载 2018-09-13 11:25:11 · 188 阅读 · 0 评论 -
Matrix Decompressing UVA - 11082 (SAP模板)
#include<cstdio>#include<algorithm>#include<iostream>#include<algorithm>#include<map>#include<vector>#include<cstring>#include<queue>u转载 2018-06-10 21:01:45 · 164 阅读 · 0 评论 -
Sewage Treatment HihoCoder - 1389 (二分+网络流+剪枝) SAP
After years of suffering, people could not tolerate the pollution in the city any more, and started a long-lasting protest. Eventually, the municipal government made up its mind to deal with the sewag...原创 2018-09-11 18:59:17 · 163 阅读 · 0 评论 -
定向
链接:https://www.nowcoder.com/acm/contest/158/E来源:牛客网 题目描述给一张无向图,你需要将边定向,使得定向后的有向图强连通。输入描述:第一行两个数n,m,表示点数和边数。接下来m行,每个两个数x,y,表示x和y之间有条边。输出描述:如果不存在可行方案输出一行"impossible" ;否则,输出一个长度为m的01串,...原创 2018-08-25 10:37:58 · 204 阅读 · 0 评论 -
Sparse Graph hdu-5876(求补图的最短路)
Problem DescriptionIn graph theory, the complement of a graph G is a graph H on the same vertices such that two distinct vertices of H are adjacent if and only if they are not adjacent in G. Now you a...原创 2018-05-08 14:57:37 · 213 阅读 · 0 评论 -
算法提高 找素数
问题描述 给定区间[L, R] , 请计算区间中素数的个数。输入格式 两个数L和R。输出格式 一行,区间中素数的个数。样例输入2 11样例输出5数据规模和约定 2 <= L <= R <= 2147483647 R-L <= 1000000#include <iostream>#include<cstdio>#include<alg...原创 2018-05-19 15:13:50 · 1102 阅读 · 0 评论 -
Idiomatic Phrases Game
Tom is playing a game called Idiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain meaning. This game will give Tom two idioms. He should build a list of idioms and原创 2017-08-05 10:35:31 · 285 阅读 · 0 评论 -
一个人的旅行
虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^),很多事,还能丰富自己的阅历,还可以看美丽的风景……草儿想去很多地方,她想要去东京铁塔看夜景,去威尼斯看电影,去阳明山上看海芋,去纽约纯粹看雪景,去巴黎喝咖啡写信,去北京探望孟姜女……眼看寒假就快到了,这么一大段时间,可不能浪费啊,一定要给自己好好的放个假原创 2017-08-05 10:27:18 · 320 阅读 · 0 评论 -
Building a Space Station
You are a member of the space station engineering team, and are assigned a task in the construction process of the station. You are expected to write a computer program to complete the task.The sp原创 2017-08-02 08:50:02 · 280 阅读 · 0 评论 -
hdu1754 IHateIt (线段树点更新,区间查询)
很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。 这让很多学生很反感。 不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input 本题目包含多组测试,请处理到文件结束。 在每个测试的第一行,有两个正整数 N 和 M ( 0学生ID编号分别从1编到N。 第二原创 2017-08-08 09:50:16 · 197 阅读 · 0 评论 -
Networking
You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of po原创 2017-08-01 09:46:43 · 190 阅读 · 0 评论 -
Jungle Roads
The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so原创 2017-08-01 09:45:38 · 169 阅读 · 0 评论 -
深度理解链式前向星
转载自:http://blog.csdn.net/acdreamers/article/details/16902023版权声明:本文为博主原创文章,未经博主允许不得转载。我们首先来看一下什么是前向星.前向星是一种特殊的边集数组,我们把边集数组中的每一条边按照起点从小到大排序,如果起点相同就按照终点从小到大排序,并记录下以某个点为起点的所有边在数组中的起始位置和存储长度,那么前向星就构造好了.用le转载 2017-07-31 21:38:15 · 183 阅读 · 0 评论 -
HDU - 1839 Delay Constrained Maximum Capacity Path
Consider an undirected graph with N vertices, numbered from 1 to N, and M edges. The vertex numbered with 1 corresponds to a mine from where some precious minerals are extracted. The vertex numbered w原创 2017-08-07 16:25:43 · 254 阅读 · 0 评论 -
HDU - 1869 六度分离
1967年,美国著名的社会学家斯坦利·米尔格兰姆提出了一个名为“小世界现象(small world phenomenon)”的著名假说,大意是说,任何2个素不相识的人中间最多只隔着6个人,即只用6个人就可以将他们联系在一起,因此他的理论也被称为“六度分离”理论(six degrees of separation)。虽然米尔格兰姆的理论屡屡应验,一直也有很多社会学家对其兴趣浓厚,但是在30多年的时间里原创 2017-08-07 16:23:00 · 189 阅读 · 0 评论 -
POJ - 3723 Conscription
Windy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his soldiers. To collect a soldier without any privilege,原创 2017-08-07 16:17:44 · 198 阅读 · 0 评论 -
POJ - 1789 Truck History
Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each type of a tr原创 2017-08-07 16:12:39 · 228 阅读 · 0 评论 -
Just a Hook (区间更新,lazy标记)
In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.原创 2017-08-09 09:39:29 · 205 阅读 · 0 评论 -
MPI Maelstrom
BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's research advi原创 2017-08-02 08:46:39 · 247 阅读 · 0 评论 -
最短路径问题
给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。Input 输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为0时输入结束。(1Output 输出 一行有两个数,原创 2017-08-05 10:24:00 · 288 阅读 · 0 评论 -
Silver Cow Party
One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way r原创 2017-08-05 10:13:00 · 170 阅读 · 0 评论 -
Alien Security(dfs+spfa)
You are in charge of security at a top-secret government research facility. Recently your government has captured a live extra-terrestrial (ET) life form, and is hosting an open day for fellow researc原创 2017-08-04 09:56:21 · 369 阅读 · 0 评论 -
昂贵的聘礼
年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。"探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币来换,或者替他弄来其他的东西,原创 2017-08-04 09:36:00 · 172 阅读 · 0 评论 -
Skiing
Bessie and the rest of Farmer John's cows are taking a trip this winter to go skiing. One day Bessie finds herself at the top left corner of an R (1 <= R <= 100) by C (1 <= C <= 100) grid of elevation原创 2017-08-03 09:37:00 · 169 阅读 · 0 评论 -
Til the Cows Come Home
Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get ba原创 2017-08-01 09:43:12 · 236 阅读 · 0 评论