653B. Bear and Compressing

B. Bear and Compressing：题目

纯纯暴力DFS，和dp有啥关系！不想写了，copy一份，写的真精简。

#include <bits/stdc++.h>
using namespace std;
int n, m;
string a[40], b[40];
int f[10][10][2];int dfs(int pos, int pre, int flag) {if (!pos)return flag;if (f[pos][pre][flag] != -1)return f[pos][pre][flag];int res = 0;for (int i = 0; i < m; ++i) {res += dfs(pos - 1, a[i][0] - 'a', flag && (b[i][0] - 'a' == pre));}f[pos][pre][flag] = res;return res;
}
int main() {cin >> n >> m;for (int i = 0; i < m; ++i)cin >> a[i] >> b[i];memset(f, -1, sizeof f);cout << dfs(n - 1, 0, 1) << endl;return 0;
}

明天开始1400分内容了，冲

653B. Bear and Compressing相关推荐

Code Forces Bear and Forgotten Tree 3 639B
B. Bear and Forgotten Tree 3 time limit per test2 seconds memory limit per test256 megabytes inputst ...
D - Bear and Finding Criminals
Description There are n cities in Bearland, numbered 1 through n. Cities are arranged in one long ro ...
Bear and Finding Criminals （模拟）
Bear and Finding Criminals There are n cities in Bearland, num ...
IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) A. Bear and Three Balls 水题
A. Bear and Three Balls 题目连接: http://www.codeforces.com/contest/653/problem/A Description Limak is a ...
Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition) A. Bear and Game 水题
A. Bear and Game 题目连接: http://www.codeforces.com/contest/673/problem/A Description Bear Limak likes ...
CodeForces 658C Bear and Forgotten Tree 3（构造）
题意:构造一棵树,有N个点,直径为d,深度为h 思路:首先构造一个长度为d的链,然后把其中一个距离边上为h的点变为根.然后我们就不停的在距离根为h上面的那一点不停的加点就好了,使得新加入的点的距离也为 ...
Bear and Strings
The bear has a string s = s1s2- s|s| (record |s| is the string's length), consisting of lowercase En ...
Bear and Finding Criminals
Description There are n cities in Bearland, numbered 1 through n. Cities are arranged in one long ro ...
Bear and Raspberry
Description The bear decided to store some raspberry for the winter. He cunningly found out the pric ...

653B. Bear and Compressing

653B. Bear and Compressing相关推荐

最新文章

热门文章