简单搜索
chen_zan_yu_
同是寒窗苦读,岂能甘拜下风
展开
-
深度优先搜索(dfs)的用法——lake counting
Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains ei...原创 2018-10-14 21:32:05 · 396 阅读 · 0 评论 -
Cycles of Lanes
滴答滴答---题目链接 Cycles of Lanes Time Limit:1000MS Memory Limit:65536K Total Submissions:1809 Accepted:663 Description Each of the M lanes of the Par...原创 2019-09-10 23:23:35 · 202 阅读 · 0 评论 -
ACM-ICPC北京赛区2018-Jin Yong’s Wukong Ranking List-闭包传递
Jin Yong was the most famous and popular Chinese wuxia (The one who fight bad people by his Wukong i.e. Wushu and Kongfu) novelist who lived in Hong Kong. Between 1955 and 1972, he wrote 14 novels whi...原创 2018-11-18 00:39:05 · 871 阅读 · 0 评论 -
F - Flying Safely
滴答滴答---题目链接题意求连通图 思路:套模板 #include <iostream>#include<stdio.h>#include<string.h>#include<cmath>#include<queue>using namespace std;const int maxn=1001;int ...原创 2018-11-17 00:02:12 · 175 阅读 · 0 评论 -
C - Catch That Cow
滴答滴答---题目链接若忆_starFarmer 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 ≤ 100,000) on a number line and the cow is at a ...原创 2018-11-08 21:30:10 · 128 阅读 · 0 评论 -
Lake Counting
Lake Counting 试题描述 有一个大小为M*N的园子,雨后积起了水。八连通的积水被认为是连接在一起的。请求出园子里共有多少水洼?(八连通指的是下面图中相对W的*的部分) *** *W* *** 限制条件: N,M≤100 输入 第一行包含两个正整数 N 和 M,表示将一个园子地面分成...原创 2018-11-06 00:14:03 · 207 阅读 · 0 评论 -
[POJ] 1562 Oil Deposits (DFS)
[POJ] 1562 Oil Deposits (DFS)Oil DepositsTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 16655 Accepted: 8917 DescriptionThe GeoSurvComp geologic survey company is...原创 2018-11-05 23:58:43 · 106 阅读 · 0 评论 -
Red and Black(dfs模板)
Red and Black Red and Black Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 118 Accepted Submission(s): 92 Problem Descr...原创 2018-11-05 23:11:43 · 166 阅读 · 0 评论 -
ALDS1_11_C Breadth First Search(邻接表转化为邻接矩阵并求每个点到1点的距离)
滴答滴答---题目链接 Write a program which reads an directed graph G=(V,E)G=(V,E), and finds the shortest distance from vertex 11 to each vertex (the number of edges in the shortest path). Vertices are ident...原创 2018-11-07 09:53:18 · 286 阅读 · 0 评论 -
Depth First Search(给出临接表输出dfs遍历的顺系)
滴答滴答---题目链接 Depth-first search (DFS) follows the strategy to search ”deeper” in the graph whenever possible. In DFS, edges are recursively explored out of the most recently discovered vertex vv that...原创 2018-11-07 09:28:10 · 350 阅读 · 0 评论 -
Graph(邻接表转为邻接矩阵)
滴答滴答---题目链接 There are two standard ways to represent a graph G=(V,E)G=(V,E), where VV is a set of vertices and EE is a set of edges; Adjacency list representation and Adjacency matrix representation...原创 2018-11-07 08:32:30 · 1602 阅读 · 0 评论 -
Connected Components (邻接表dfs)
滴答滴答---题目链接 Write a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each other through the network.InputIn the first line, two...原创 2018-11-06 18:14:54 · 383 阅读 · 0 评论 -
The Settlers of Catan
The Settlers of Catan Time Limit:1000MS Memory Limit:65536K Total Submissions:1613 Accepted:1054 Description Within ...原创 2019-09-11 23:24:31 · 442 阅读 · 0 评论