GKHack-CSDN博客

原创 Codeforces Round #313 (Div. 2) 560D Equivalent Strings(dos)

D. Equivalent Stringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday on a lecture about strings Gera

2015-12-18 17:08:25 1528

原创 Codeforces Round #313 (Div. 2) 560C Gerald's Hexagon(脑洞)

C. Gerald's Hexagontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGerald got a very curious hexagon for h

2015-12-17 22:42:00 1120

原创数据结构实验4(排序算法的实现及性能分析)

实现了选择排序, 插入排序, 冒泡排序, 快速排序, 改进后的快速排序, 以及两路合并排序.通过随机函数随机生成100个数, 进行各种排序, 记录排序开始时间以及结束时间, 计算消耗的时间来比较算法的优略.实现代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"#include

2015-12-16 21:22:56 6681 1

原创拓扑排序的实现_TopoSort

拓扑排序是求一个AOV网(顶点代表活动, 各条边表示活动之间的领先关系的有向图)中各活动的一个拓扑序列的运算, 可用于测试AOV网络的可行性.整个算法包括三步:1.计算每个顶点的入度, 存入InDegree数组中.2.检查InDegree数组中顶点的入度, 将入度为零的顶点进栈.3.不断从栈中弹出入度为0的顶点并输出, 并将该顶点为尾的所有邻接点的入度减1, 若此时某个邻接点的

2015-12-14 23:55:07 2717

原创数据结构实验3(飞机最少环城次数问题)

使用图算法解决应用问题: 设有n个城市, 编号为0 ~ n - 1, m条航线的起点和终点由用户输入提供. 寻找一条换乘次数最少的线路方案.使用有向图表示城市间的航线, 只要两城市之间有航班, 则图中这两点间存在一条权为1的边. 用Dijkstra算法实现求最少换乘次数.在MGraph类中增加Choose函数以及Dijkstra函数即可.实现代码:#include "iostrea

2015-12-13 18:14:17 3845

原创数据结构实验3(图的DFS和BFS实现)

实现邻接矩阵和邻接表两种不同存储结构上实现图的基本运算, 在MGraph类中扩充增加DFS()和BFS()函数.包含的运算: 插入一条边, 删除一条边, 查询边是否存在, 图的深度优先搜索和广度优先搜索.广度优先搜索利用队列作为辅助的数据结构, 元素类型是树的结点. 实现代码:#include "iostream"#include "cstdio"#include "cstri

2015-12-13 17:51:09 3497

原创数据结构实验2(二叉链表实现二叉树的基本运算)

包含的二叉树运算: 删除一个二叉树, 求一颗二叉树的高度, 求一颗二叉树中叶子结点数, 复制一颗二叉树, 交换一颗二叉树的左右子树,自上到下, 自左到右层次遍历一颗二叉树.增加相关功能完善即可, 层次遍历利用队列作为辅助的数据结构, 元素类型是指向二叉树中结点的指针类型.实现代码:#include "iostream"#include "cstdio"#include "cst

2015-12-13 17:36:01 4376

原创 Codeforces Round #335 (Div. 2) 606C Sorting Railway Cars(hash)

C. Sorting Railway Carstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn infinitely long railway has a tr

2015-12-11 17:05:01 1169

原创 Codeforces Round #335 (Div. 2) 606B Testing Robots(模拟)

B. Testing Robotstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Cybernetics Failures (CF) organisatio

2015-12-11 16:58:10 1163

原创 HDOJ1796 How many integers can you find(dfs+容斥)

How many integers can you findTime Limit: 12000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6048 Accepted Submission(s): 1735Problem Descripti

2015-12-08 20:37:31 1049

原创 CSU1256 天朝的单行道(spfa)

1256: 天朝的单行道Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 281 Solved: 92[Submit][Status][Web Board]Description 在另一个平行宇宙中，有一个神奇的国度名叫天朝。天朝一共有N个城市（标号分别为1, 2, …, N），M条道路，为了方便交通管制，天朝的M

2015-12-08 20:27:27 800

原创 Codeforces Round #105 (Div. 2) 148C Terse princess(脑洞)

C. Terse princesstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output«Next please», — the princess called and c

2015-12-08 20:20:27 1064

原创 POJ3249 Test for Job(拓扑排序+dp)

Test for JobTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 10137 Accepted: 2348DescriptionMr.Dog was fired by his company. In order to support his

2015-12-08 20:09:10 1650

原创 FZU2171 防守阵地 II(线段树)

Problem 2171 防守阵地 IIAccept: 298 Submit: 1119Time Limit: 3000 mSec Memory Limit : 32768 KB Problem Description部队中总共有N个士兵，每个士兵有各自的能力指数Xi，在一次演练中，指挥部确定了M个需要防守的地点，指挥部将选择M个士兵依次进入指定地点进行

2015-12-08 16:42:34 1085

原创 FZU1920 Left Mouse Button(dfs)

Problem 1920 Left Mouse ButtonAccept: 385 Submit: 719Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionMine sweeper is a very popular small game in Windows operating

2015-12-08 16:34:06 1316

原创 BestCoder Round #65 HDOJ5592 ZYB's Premutation(树状数组+二分)

ZYB's PremutationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 638 Accepted Submission(s): 302Problem DescriptionZYB has

2015-12-08 16:24:05 1285

原创图的邻接表实现_LGraph

邻接表是图的另一种有效的存储表示方法. 每个顶点u建立一个单链表, 链表中每个结点代表一条边, 为边结点. 每个单链表相当于邻接矩阵的一行.adjVex域指示u的一个邻接点v, nxtArc指向u的下一个边结点. 如果是网, 增加一个w域存储边上的权值.构造函数完成对一维指针数组a的动态空间存储分配, 并对其每个元素赋初值NULL. 析构函数首先释放邻接表中所有结点, 最后释放一维

2015-12-08 09:48:31 4449

原创图的邻接矩阵实现_MGraph

邻接矩阵有两种, 不带权图和网的邻接矩阵. 不带权图的邻接矩阵元素为0或1, 网的邻接矩阵中包含0, INF, 和边上的权值, 权值类型T可为整型, 实型. 三元组(u, v, w)代表一条边, u, v是边的两个定点, w表示u v的关系: a[u][u] = 0, 两种邻接矩阵的主对角元素都是0. a[u][v] = w, 若在E中, 则w = 1(不带权图)或w = w(i, j)

2015-12-08 09:11:28 5124

原创 BestCoder Round #64 (div.2) HDOJ5587 Array(dfs)

ArrayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 490 Accepted Submission(s): 235Problem DescriptionVicky is a magician

2015-12-04 00:00:23 1008

原创 BestCoder Round #64 (div.2) HDOJ5586 Sum(脑洞)

SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 671 Accepted Submission(s): 355Problem DescriptionThere is a number sequen

2015-12-03 23:43:25 930

原创 BestCoder Round #64 (div.2) HDOJ5585 Numbers(模拟)

NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 449 Accepted Submission(s): 280Problem DescriptionThere is a number N.

2015-12-03 23:31:30 840

原创散列表ADT_HashTable

M为除留余数法的模数, ht是指向动态生成的一维数组指针, empty是标志数组的指针.成员函数Find()在散列表中搜索与x关键字相同的元素. 若表中存在与x关键字值相同的元素, 则将其复制给x, pos指示该位置, 函数返回Success. 若表已满, 函数返回Overflow. 若表未满, 函数返回NotPresent, pos指示首次遇到的空值位置.实现代码:#includ

2015-12-01 01:03:54 3541

原创 Codeforces Round #332 (Div. 2) 599D Spongebob and Squares(数学)

D. Spongebob and Squarestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSpongebob is already tired trying

2015-11-23 16:17:10 1217

原创 Codeforces Round #332 (Div. 2) 599C Day at the Beach(脑洞)

C. Day at the Beachtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Squidward, Spongebob and Patric

2015-11-23 11:02:07 1358

原创 Codeforces Round #332 (Div. 2) 599B Spongebob and Joke(STL)

B. Spongebob and Joketime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile Patrick was gone shopping, Spon

2015-11-23 10:38:52 1062

原创 Codeforces Round #332 (Div. 2) 599A Patrick and Shopping(模拟)

A. Patrick and Shoppingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday Patrick waits for a visit from

2015-11-23 10:28:48 923

原创 BestCoder Round #63 (div.2) HDOJ5570 balls(数学期望)

ballsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 90 Accepted Submission(s): 59Problem DescriptionThere are n balls with

2015-11-23 00:10:00 923

原创 BestCoder Round #63 (div.2) HDOJ5569 matrix(dp)

matrixTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 304 Accepted Submission(s): 187Problem DescriptionGiven a matrix with n

2015-11-22 23:19:49 1067

原创 BestCoder Round #63 (div.2) HDOJ5568 sequence2(dp + 大数)

sequence2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 231 Accepted Submission(s): 95Problem DescriptionGiven an integer ar

2015-11-22 21:15:29 955

原创 BestCoder Round #63 (div.2) HDOJ5567 sequence1(暴力)

sequence1Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 132 Accepted Submission(s): 103Problem DescriptionGiven an array a w

2015-11-22 11:11:49 699

原创二叉搜索树ADT_BSTree

二叉搜索树或是一颗空二叉树, 或是具有以下性质的二叉树:1.若左子树不为空, 则左子树上所有结点的关键字值均小于根结点的关键字值.2.若右子树不为空, 则右子树上所有结点的关键字值均大于根结点的关键字值.3.左右子树也分别是二叉搜索树.性质: 若以中序遍历一颗二叉搜索树, 将得到一个以关键字值递增排列的有序序列.1.搜索实现: 若二叉树为空, 则搜索失败. 否则

2015-11-18 17:47:48 5789

原创逆向过程

瞬移=007647E0push ecx=00764D2900764790 - 76 34 - jna 007647c600764792 - 8b 8d e0 fc ff ff - mov ecx,[ebp-00000320]00764798 - 81 c1 a0 05 00 00 - add ecx,0000

2015-11-18 15:26:02 3295

原创 BestCoder Round #62 (div.2) HDOJ5564 Clarke and digits(dp + 快速幂)

Clarke and digitsTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 88 Accepted Submission(s): 44Problem DescriptionClarke is a

2015-11-18 10:55:40 1353

原创 BestCoder Round #62 (div.2) HDOJ5563 Clarke and five-pointed star(计算几何)

Clarke and five-pointed starTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 468 Accepted Submission(s): 247Problem Description

2015-11-18 10:36:16 978

原创 BestCoder Round #62 (div.2) HDOJ5562 Clarke and food(脑洞)

Clarke and foodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 501 Accepted Submission(s): 292Problem DescriptionClarke is a

2015-11-18 10:23:01 1015

原创 POJ3349 Snowflake Snow Snowflakes(hash)

Snowflake Snow SnowflakesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 35715 Accepted: 9399DescriptionYou may have heard that no two snowflakes ar

2015-11-17 11:20:44 905

原创 POJ3764 The xor-longest Path(字典树)

The xor-longest PathTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4946 Accepted: 1076DescriptionIn an edge-weighted tree, the xor-length of a path

2015-11-17 10:35:32 1284

原创 POJ3630 Phone List(字典树)

Phone ListTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25813 Accepted: 7804DescriptionGiven a list of phone numbers, determine if it is consisten

2015-11-17 09:54:18 1152

原创 POJ1251 Jungle Roads(kru)

题目链接:点击打开链接给出n - 1组边长, 构成一张图, 要求删除一些边使得边长和最小且任意两点可到达.最小生成树, 套一个kru模板即可. 并查集初始化, 读入数据后对边长进行排序, 若并查集确定两点不在同一连通分量则将两点连接并存储所得到的边.AC代码:#include "iostream"#include "cstdio"#include "cstring"

2015-11-17 09:04:25 1034

原创 Codeforces Round #331 (Div. 2) 596ABC题解

题目链接: 点击打开链接A: 给出n个点的坐标, 问你这n个点能不能确定一个矩形, 如果可以求出面积, 不可以则输出-1.脑洞题, n为1输出-1, 其他情况则求面积, 若面积为0则不能确定, 注意数据初始化, 为此wa了一发.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "

2015-11-17 08:37:35 1346

2015北大ACM-ICPC暑期课(深度优先搜索)

2015北大ACM-ICPC暑期课(计算几何)

2015北大ACM-ICPC暑期课(高级搜索)

2015北大ACM-ICPC暑期课(广度优先搜索)

空空如也