DFS
阿龙的圈子
仰望星空 脚踏实地
向前走 永不停
展开
-
POJ (DFS+回溯) Graph Coloring
Graph ColoringTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4271 Accepted: 1942 Special JudgeDescriptionYou are to write a program that tries to f原创 2014-11-11 16:22:14 · 522 阅读 · 0 评论 -
codeforces 316 D
D. Tree Requeststime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRoman planted a tree consisting of n verti原创 2015-08-19 11:14:13 · 823 阅读 · 0 评论 -
多校 hdu 5305
FriendsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1429 Accepted Submission(s): 725Problem DescriptionThere are n people原创 2015-08-04 10:08:17 · 529 阅读 · 0 评论 -
多校 hdu 5325
Crazy BoboTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1308 Accepted Submission(s): 400Problem DescriptionBobo has a tree原创 2015-08-01 14:17:00 · 633 阅读 · 0 评论 -
Calender Colors
Calender ColorsTaro is a member of a programming contest circle. In this circle, the members manage their schedules in the system called Great Web Calender.Taro has just added some of his frie原创 2015-08-24 11:09:52 · 730 阅读 · 0 评论 -
Rabbit Party
G. Rabbit PartyTime Limit: 5000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 39423Rabbit PartyA rabbit Taro decided原创 2015-08-24 15:49:31 · 1067 阅读 · 0 评论 -
codeforces
B - Inna and NineTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionInna loves digit 9 very much. That's why she asked Dima to wri原创 2015-08-09 17:15:19 · 1385 阅读 · 0 评论 -
蓝桥杯 大臣的旅费
#include using namespace std;#define maxn 1000000 + 10struct edge{ int v, dist;};int n;int index = 1;int M = -1;vectorG[maxn];bool vis[maxn] = {false};void DFS(int u, int dist){原创 2015-04-08 21:26:04 · 678 阅读 · 0 评论 -
Rikka with string
Accepts: 395 Submissions: 2281 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionAs we know, Rikka is poor at math. Yuta原创 2015-04-12 17:10:39 · 884 阅读 · 0 评论 -
蓝桥杯 水水搜索
#include using namespace std;#define maxn 10int vis[maxn][maxn] = {0};int cnt = 0;bool judge(int i, int j){ if(i<4 && j<5) return true; return false;}void dfs(int i, int j){ i原创 2015-04-07 17:25:20 · 900 阅读 · 0 评论 -
HDU 1232 另外一种写法
#include #include #include #include #include #include using namespace std;#define maxn 1000 + 10int n, m;vectorG[maxn];int cnt ;bool vis[maxn];void DFS(int u){ vis[u] = true;原创 2015-04-10 22:14:03 · 566 阅读 · 0 评论 -
编程实现通过状态图确定句子
举例,对于如如下文法G[Z]: Z→U0∣V1 U →Z1∣1 V →Z0∣0,状态图如下所示, 现在需要判断ω=100110是否是该文法的句子,可以通过一般的状态图深度优先搜索(DFS)进行查找,如果查找到该句子,说明有文法可以得出该句子,否则不可以。 该程序对于所有的文法状态图都可以进行相关句子的判断,并不仅限于例子,具有很好的普遍适用性。#include <bit原创 2016-03-22 08:22:27 · 913 阅读 · 0 评论