UVa 124 Following Orders

// Following Orders
// UVa ID: 124
// Verdict: Accepted
// Submission Date: 2015-11-27
// UVa Run Time: 0.000s
//
// 版权所有（C）2015，邱秋。metaphysis # yeah dot net#include <iostream>
#include <cstring>
#include <sstream>
#include <algorithm>using namespace std;#define MAXN 20bool visited[MAXN];
int nChar, value[2 * MAXN], nLimit;
char output[MAXN], input[MAXN], limit[MAXN][2];void print()
{for (int i = 0; i < nChar; i++)cout << output[i];cout << endl;
}bool isValid()
{for (int i = 0; i < nLimit; i++)if (value[limit[i][0] - 'a'] >= 0 &&value[limit[i][1] - 'a'] >= 0 &&value[limit[i][0] - 'a'] > value[limit[i][1] - 'a'])return false;return true;
}void lexicographical(int current)
{if (current >= 2 && !isValid())return;if (current == nChar){print();return;}for (int i = 0; i < nChar; i++)if (!visited[i]){visited[i] = true;output[current] = input[i];value[input[i] - 'a'] = current;lexicographical(current + 1);value[input[i] - 'a'] = -1;visited[i] = false;}
}bool cmp(char a, char b)
{return a < b;
}int main(int ac, char *av[])
{string line;int cases = 0;while (getline(cin, line), line.length() > 0){// 输出间隔空行。if (cases > 0)cout << endl;// 读取字符，初始化相关变量。istringstream first(line);nChar = 0;while (first >> input[nChar]){output[nChar] = 0;visited[nChar] = false;nChar++;}for (int i = 0; i < 2 * MAXN; i++)value[i] = -1;sort(input, input + nChar, cmp);// 读取限制。nLimit = 0;getline(cin, line);istringstream next(line);while (next >> limit[nLimit][0])next >> limit[nLimit++][1];// 使用回溯生成字典序排列然后检查是否符合限制条件。lexicographical(0);cases++;}return 0;
}

UVa 124 Following Orders相关推荐

UVa Online Judge 工具網站
UVa Online Judge 工具網站转自http://www.csie.ntnu.edu.tw/~u91029/uva.html Lucky貓的ACM園地,Lucky貓的 ACM 中譯題目 M ...
uva 10256 The Great Divide (Convex Hull, Simple)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=14&page=sh ...
POJ 3525/UVA 1396 Most Distant Point from the Sea（二分+半平面交）
Description The main land of Japan called Honshu is an island surrounded by the sea. In such an isla ...
UVa 11027 - Palindromic Permutation 回文串，组合加搜索
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=115&page=s ...
uva 11275 3D Triangles (3D-Geometry)
uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem= ...
UVa 207 - PGA Tour Prize Money
时间限制:3.000秒题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&catego ...
UVa 1471 Defense Lines - 线段树 - 离散化
题意是说给一个序列,删掉其中一段连续的子序列(貌似可以为空),使得新的序列中最长的连续递增子序列最长. 网上似乎最多的做法是二分查找优化,然而不会,只会值域线段树和离散化... 先预处理出所有的点所能 ...
Ananagrams（sort+map） UVA - 156 统计字谜
Ananagrams(sort+map) UVA - 156 统计字谜 Most crossword puzzle fans are used to anagrams - groups of word ...
UVa 109 - SCUD Busters（凸包计算）
题目来源:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&pa ...
Candy UVA 1639 (数学期望)
Candy UVA 1639 (数学期望) 有两个盒子各有n颗糖(n<=2*105),从两个盒子取糖的概率为p和1-p,直到一个盒子没糖,求另一个盒子中糖的个数的数学期望. 期望公式为: E=∑ ...

UVa 124 Following Orders

UVa 124 Following Orders相关推荐

最新文章

热门文章