acm_欧拉回路

Colored Sticks--POJ 2513

2、注意事项：字典树的插入；并查集与DFS的结合；欧拉回路的判断。
·2015-11-02 16:59

HDOJ1878（欧拉回路）

欧拉回路 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java
·2015-11-02 15:31

欧拉回路

stack> using namespace std; int g[111][111]; int cnt[111]; stack<int> st; int n,m; //搜索求欧拉回路或欧拉通路
·2015-11-02 13:37

欧拉回路

【思路分析】 欧拉回路问题。 总结，求解欧拉回路方法: 构造邻接表，从顶点1开始，以点深搜，搜到不能再搜，搜到天荒地老，最后输出点既是欧拉回路。（
·2015-11-02 12:44

Fleury（弗罗莱）算法求欧拉回路

转自http://www.cnblogs.com/Lyush/archive/2013/04/22/3036659.html 上面是摘自图论书上的定义。 算法在运行过程中删除了所有已走的路径，也就是说途中残留了所有没有行走的边。根据割边的定义，如果在搜索过程中遇到割边意味着当前的搜索路径需要改进，即提前输出某一个联通子集的访问序列，这样就能够保证访问完其中联通子图中后再通过割边访问后一个联
·2015-11-02 11:43

poj2513

（2）当G是无奇度结点的连通图时，G必有欧拉回路。 2.一个有向图D具有欧拉通路，当且仅当D是连通的，且除了两
·2015-11-02 10:23

欧拉回路 ZQUOJ21349&&POJ2337 Catenyms

Description A catenym is a pair of words separated by a period such that the last letter of the first word is the same as the first letter of the second. For example, the following are catenyms:
·2015-11-02 09:51

UVa 10735 (混合图的欧拉回路) Euler Circuit

试找出一条欧拉回路。 分析： 按照往常的思维，遇到混合图，我们一般会把无向边拆成两条方向相反的有向边。
·2015-11-01 14:19

UVA 10054 The Necklace（欧拉回路，打印路径）

题目链接： http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=995   Problem D: The Necklace  My little sister had a beautiful n
·2015-11-01 12:34

Codeforces 527E Data Center Drama(欧拉回路)

题意： 　　给定一个无向图连通图，把这个的无向边变成有向边，并添加最少的有向边使这个图每个结点的出度为偶数。   Solution：     题目很长，并且很多条件说的不太直接，确实不太好懂。     首先先看得到的无向图，是不是可以不加边就满足题目要求。     可以想到对于一个无向图，当所有点的度数为偶数时，图中
·2015-11-01 12:11

UVa 10054 (打印欧拉回路) The Necklace

将每个颜色看成一个顶点，对于每个珠子在两个颜色之间连一条无向边，然后求欧拉回路。
·2015-11-01 10:54

[ACM_模拟] UVA 12504 Updating a Dictionary [字符串处理 字典增加、减少、改变问题]

      Updating a Dictionary  In this problem, a dictionary is collection of key-value pairs, where keys are lower-case letters, and values are non-negative integers. Given
·2015-11-01 10:30

[ACM_水题] UVA 12502 Three Families [2人干3人的活后分钱，水]

      Three Families  Three families share a garden. They usually clean the garden together at the end of each week, but last week, family C was on holiday, so family A sp
·2015-11-01 10:29

[ACM_模拟] UVA 12503 Robot Instructions [指令控制坐标轴上机器人移动 水]

      Robot Instructions  You have a robot standing on the origin of x axis. The robot will be given some instructions. Your task is to predict its position after executin
·2015-11-01 10:29

Data Center Drama 欧拉回路

Codeforces Round #296 (Div. 1)C. Data Center Drama Time Limit: 2 Sec  Memory Limit: 256 MB Submit: xxx  Solved: 2xx 题目连接 http://codeforces.com/contest/528/problem/C Description &nbs
·2015-11-01 09:20

今天学了一下欧拉路

欧拉路径是指能从一个点出发能够“一笔画”完整张图的路径；(每条边只经过一次而不是点) 在无向图中：如果每个点的度都为偶数 那么这个图是欧拉回路；如果最多有2个奇数点，那么出发点和到达点必定为该2点，那么这个路径就为欧拉路
·2015-10-31 19:43

欧拉图

欧拉图的判定 欧拉通路和欧拉回路——必须是存在欧拉回路的图才能称为欧拉图，仅仅是存在欧拉通路不称为欧拉图   无向图的欧拉通路 1.图连通 可以用dfs去判断图连通或者用高效一点的并查集
·2015-10-31 19:02

hrbeu 哈工程 Eular Graph

欧拉回路裸题，给定n个点和m条有向边，判断该图是否为欧拉回路 有向图欧拉回路判断条件有：图连通，所有点的度为偶数   代码一，用并查集来判断图是否连通，然后逐一扫描所有点的度是否为偶数
·2015-10-31 19:51

uva 10596 Morning Walk

 其实题意不是很明白，看了别人的解题报告然后按照思路来实现，最后AC了，但是对于题意还是很有问题 判断是否有欧拉回路，图要连通（用并查集来处理），然后所有顶点的度数为偶数 在这个博客中 
·2015-10-31 19:50

pku 1386 ，hdu 1116 Play on Words

并查集+欧拉回路。 先看成是一个无向图，判断连通性。 之后记录每一个字母的入度和出度。
·2015-10-31 15:43

pku 2513 Colored Sticks Trie树+并查集+欧拉回路(半欧拉回路)

先用Trie树把颜色改为点，并记录每一种颜色出现的次数，再用并查集判断是否连通，，之后用欧拉回路判断能否构成直线。。 这里存在两种情况：
·2015-10-31 15:41

hdu3472 混合图的欧拉回路

HS BDC 题意很简单，就是串单词，如果一个单词的尾字母和另一个单词的首字母相同，则可以连接起来，给你N个单词，问：能否串成一条链？ 关键在于如何建图，这题稍有不同，就是有些单词是可以翻转的，但也只能用一次而已。把二十六个字母'a'到'z'作为点，把每个单词作为边，如果某个单词首尾字母分别为a和b，则可以建一条有向边<a, b>，当然，如果此单词可以翻转，则建成无向边(a, b)
·2015-10-31 15:18

混合图的欧拉回路

具有欧拉回路的图称为欧拉图（简称E图）。 定理： 一个无向图是欧拉图，当且仅当该图所有顶点度数都是偶数。 一个有向图是欧拉图，当且仅当该图所有顶点度数都是0。
·2015-10-31 15:17

[ACM_数据结构] POJ2352 [树状数组稍微变形]

  Description Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars tha
·2015-10-31 11:37

[ACM_图论] ZOJ 3708 [Density of Power Network 线路密度，a->b=b->a去重]

    The vast power system is the most complicated man-made system and the greatest engineering innovation in the 20th century. The following diagram shows a typical 14 bus power system. In
·2015-10-31 11:36

[ACM_水题] ZOJ 3712 [Hard to Play 300 100 50 最大最小]

  MightyHorse is playing a music game called osu!.   After playing for several months, MightyHorse discovered the way of calculating score in osu!: 1. While p
·2015-10-31 11:36

[ACM_暴力][ACM_几何] ZOJ 1426 Counting Rectangles (水平竖直线段组成的矩形个数，暴力）

Description We are given a figure consisting of only horizontal and vertical line segments. Our goal is to count the number of all different rectangles formed by these segments. As an example, the n
·2015-10-31 11:36

[ACM_动态规划] UVA 12511 Virus [最长公共递增子序列 LCIS 动态规划]

      Virus  We have a log file, which is a sequence of recorded events. Naturally, the timestamps are strictly increasing. However, it is infected by a virus, so random
·2015-10-31 11:36

[ACM_动态规划] hdu 1176 免费馅饼 [变形数塔问题]

    Problem Description 都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人，所以他只能在小径上接。由于gameboy平时老
·2015-10-31 11:36

[ACM_模拟] ACM - Draw Something Cheat [n个长12的大写字母串，找出交集，按字母序输出]

  Description Have you played Draw Something? It's currently one of the hottest social drawing games on Apple iOS and Android Devices! In this game, you and your friend play in turn. You
·2015-10-31 11:36

[ACM_数学] LA 3708 Graveyard [墓地雕塑 圈上新加点 找规律]

  Description   Programming contests became so popular in the year 2397 that the governor of New Earck -- the largest human-inhabited planet of the galaxy -- opened a special Alley of
·2015-10-31 11:36

[ACM_水题] UVA 11292 Dragon of Loowater [勇士斗恶龙 双数组排序 贪心]

    Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem. The shores of Rellau Creek in central Loowater had always been a prime breeding ground for g
·2015-10-31 11:36

[ACM_模拟][ACM_数学] LA 2995 Image Is Everything [由6个视图计算立方体最大体积]

  Description   Your new company is building a robot that can hold small lightweight objects. The robot will have the intelligence to determine if an object is light enough to hold. It
·2015-10-31 11:36

[ACM_图论] The Perfect Stall 完美的牛栏（匈牙利算法、最大二分匹配）

描述 农夫约翰上个星期刚刚建好了他的新牛棚，他使用了最新的挤奶技术。不幸的是，由于工程问题，每个牛栏都不一样。第一个星期，农夫约翰随便地让奶牛们进入牛栏，但是问题很快地显露出来：每头奶牛都只愿意在她们喜欢的那些牛栏中产奶。上个星期，农夫约翰刚刚收集到了奶牛们的爱好的信息（每头奶牛喜欢在哪些牛栏产奶）。一个牛栏只能容纳一头奶牛，当然，一头奶牛只能在一个牛栏中产奶。 给出奶牛们的爱好的信息，计算最
·2015-10-31 11:35

[ACM_搜索] ZOJ 1103 || POJ 2415 Hike on a Graph (带条件移动3盘子到同一位置的最少步数 广搜）

Description "Hike on a Graph" is a game that is played on a board on which an undirected graph is drawn. The graph is complete and has all loops, i.e. for any two locations there is exactly
·2015-10-31 11:35

[ACM_图论] Fire Net （ZOJ 1002 带障碍棋盘布炮，互不攻击最大数量）

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 cas
·2015-10-31 11:35

[ACM_图论] Sorting Slides(挑选幻灯片，二分匹配，中等）

Description Professor Clumsey is going to give an important talk this afternoon. Unfortunately, he is not a very tidy person and has put all his transparencies on one big heap. Before giving the talk
·2015-10-31 11:35

[ACM_搜索] Triangles(POJ1471,简单搜索，注意细节)

Description It is always very nice to have little brothers or sisters. You can tease them, lock them in the bathroom or put red hot chili in their sandwiches. But there is also a time when all meanne
·2015-10-31 11:35

[ACM_动态规划] ZOJ 1425 Crossed Matchings(交叉最大匹配 动态规划）

Description There are two rows of positive integer numbers. We can draw one line segment between any two equal numbers, with values r, if one of them is located in the first row and the other one is
·2015-10-31 11:35

[ACM_搜索] POJ 1096 Space Station Shielding （搜索 + 洪泛算法Flood_Fill）

Description Roger Wilco is in charge of the design of a low orbiting space station for the planet Mars. To simplify construction, the station is made up of a series of Airtight Cubical Modules (ACM's
·2015-10-31 11:35

[ACM_几何] Transmitters (zoj 1041 ,可旋转半圆内的最多点)

Description In a wireless network with multiple transmitters sending on the same frequencies, it is often a requirement that signals don't overlap, or at least that they don't conflict. One way of a
·2015-10-31 11:35

[ACM_模拟] The Willy Memorial Program （poj 1073 ,联通水管注水模拟）

Description Willy the spider used to live in the chemistry laboratory of Dr. Petro. He used to wander about the lab pipes and sometimes inside empty ones. One night while he was in a pipe, he fell as
·2015-10-31 11:35

[ACM_其他] Square Ice (poj1099 规律）

Description Square Ice is a two-dimensional arrangement of water molecules H2O, with oxygen at the vertices of a square lattice and one hydrogen atom between each pair of adjacent oxygen atoms. The
·2015-10-31 11:35

[ACM_图论] Highways （变形说法的最小生成树）

 http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28972#problem/C  题目给出T种情况，每种情况有n个城镇，接下来每一行是第i个城镇到所有城镇的距离（其实就是个可达矩阵）。  求建设一条公路联通所有城镇并且要求最长的一段最小（其实就是最小生成树）！代码如下： #include<
·2015-10-31 11:34

[ACM_数学] Counting Solutions to an Integral Equation （x+2y+2z=n 组合种类）

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27938#problem/E 题目大意：Given, n, count the number of solutions to the equation x+2y+2z=n, where x,y,z,n are non negative inte
·2015-10-31 11:34

[ACM_几何] The Deadly Olympic Returns!!! （空间相对运动之最短距离）

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28235#problem/B 题目大意： 有两个同时再空间中匀速运动的导弹，告诉一个时间以及各自的初始坐标和该时间时的坐标，求运动过程中的最短距离 解题思路：  求出相对初位置、相对速度，则答案就是原点到射线型轨迹的距离，注意是射线！！！  
·2015-10-31 11:34

[ACM_几何] F. 3D Triangles （三维三角行相交）

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28235#problem/A 题目大意：给出三维空间两个三角形三个顶点，判断二者是否有公共点，三角形顶点、边、内部算三角形的一部分。 解题思路：见模板   //**********************************************
·2015-10-31 11:34

[ACM_动态规划] 轮廓线动态规划——铺放骨牌(状态压缩1)

Description 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
·2015-10-31 11:34

[ACM_图论] 棋盘问题 （棋盘上放棋子的方案数）

不能同行同列，给定形状和大小的棋盘，求摆放k个棋子的可行方案 Input 2表示是2X2的棋盘，1表示k，#表示可放，点不可放（-1 -1 结束） Output 输出摆放的方案数目C Sample Input 2 1 #. .# 4 4 ...# ..#. .#.. #... -1 -1 Sample Output 2 1
·2015-10-31 11:34

[ACM_其他] 总和不小于S的连续子序列的长度的最小值——尺缩法

Description: 给定长度为n的整数数列，A[0],A[1],A[2]….A[n-1]以及整数S，求出总和不小于S的连续子序列的长度的最小值。如果解不存在，则输出0。   Input: 输入数据有多组，每组数据第一行输入n,S, （10<n<10^5,S<10^8）第二行输入A[0],A[1],A[2]….A[n-1] ( 0<A[i]≤10000)
·2015-10-31 11:34
上一页 14 15 16 17 18 19 20 21 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他