标签：
UVa 1262 Password
题目：
| Time Limit: 3000MS | Memory Limit: Unknown | 64bit IO Format: %lld & %llu |
Description
Suppose that we have a smart phone. If we touch the screen keyboard directly to enter the password, this is very vulnerable since a shoulder-surfer easily knows what we have typed. So it is desirable to conceal the input information to discourage shoulder-surfers around us. Let me explain one way to do this.
You are given a 6 x 5 grid. Each column can be considered the visible part of a wheel. So you can easily rotate each column wheel independently to make password characters visible. In this problem, we assume that each wheel contains the 26 upper letters of English alphabet. See the following Figure 1.
Assume that we have a length-5 password such as p1 p2 p3 p4 p5. In order to pass the authentication procedure, we should construct a configuration of grid space where each pi appears in the i-th column of the grid. In that situation we say that the user password is accepted.
Let me start with one example. Suppose that our password was set `COMPU‘. If we construct the grid as shown in Figure 2 on next page, then the authentication is successfully processed.
In this password system, the position of each password character in each column is meaningless. If each of the 5 characters in p1 p2 p3 p4 p5 appears in the corresponding column, that can be considered the correct password. So there are many grid configurations allowing one password. Note that the sequence of letters on each wheel is randomly determined for each trial and for each column. In practice, the user is able to rotate each column and press ``Enter" key, so a should-surfer cannot perceive the password by observing the 6 x 5 grid since there are too many password candidates. In this 6 x 5 grid space, maximally 65 = 7, 776 cases are possible. This is the basic idea of the proposed password system against shoulder-surfers.
Unfortunately there is a problem. If a shoulder-surfer can observe more than two grid plate configurations for a person, then the shoulder-surfer can reduce the searching space and guess the correct password. Even though it is not easy to stealthily observe other‘s more than once, this is one weakness of implicit grid passwords.
Let me show one example with two observed configurations for a grid password. The user password is `COMPU‘, but `DPMAG‘ is also one candidate password derived from the following configuration.
You are given two configurations of grid password from a shoulder-surfer. Suppose that you have succeeded to stealthily record snapshots of the target person‘s device (e.g. smart phone). Then your next task is to reconstruct all possible passwords from these two snapshots. Since there are lots of password candidates, you are asked for the k-th password among all candidates in lexicographical order. In Figure 3, let us show the first 5 valid password. The first 5 valid passwords are `ABGAG‘ , `ABGAS‘, `ABGAU‘, `ABGPG‘ and `ABGPS‘.
The number k is given in each test case differently. If there does not exist a k-th password since k is larger than the number of all possible passwords, then you should print `NO‘ in the output.
Your program is to read from standard input. The input consists of T test cases. The number of test cases T is given in the first line of the input. The first line of each test case contains one integer, K, the order of the password you should find. Note that 1K
7, 777. Next the following 6 lines show the 6 rows of the first grid and another 6 lines represent the 6 rows of the second grid.
The following shows sample input and output for three test cases.
3 1 AYGSU DOMRA CPFAS XBODG WDYPK PRXWO CBOPT DOSBG GTRAR APMMS WSXNU EFGHI 5 AYGSU DOMRA CPFAS XBODG WDYPK PRXWO CBOPT DOSBG GTRAR APMMS WSXNU EFGHI 64 FGHIJ EFGHI DEFGH CDEFG BCDEF ABCDE WBXDY UWYXZ XXZFG YYFYH EZWZI ZGHIJ
ABGAG ABGPS NO
思路：
解码与编码问题。去掉不重复的字母得出每个位置可能的字母集，sort后递归求解。注意
K-=k*m
string 与char 有别，编程时需要注意。
代码：
1 #include<iostream> 2 #include<string> 3 #include<vector> 4 #include<cstdio> 5 #include<algorithm> //sort 6 #define FOR(a,b,c) for(int a=(b);a<(c);a++) 7 using namespace std; 8 9 const int maxn = 6,maxm=5; 10 11 int K; 12 vector<char> table[maxm]; 13 string ans; 14 15 int dfs(int d) { 16 if(d==maxm) return true; 17 int m=1; FOR(i,d+1,maxm) m *= table[i].size(); 18 FOR(k,0,table[d].size()) 19 if(k*m < K && K<=(k+1)*m ){ 20 ans += table[d][k]; 21 K-=k*m; 22 return dfs(d+1); 23 } 24 return false; 25 } 26 27 int main() { 28 string A[maxn],B[maxn]; 29 int T; scanf("%d",&T); 30 while(T--) { 31 ans=""; FOR(i,0,maxm) table[i].clear(); //clear() 32 33 scanf("%d",&K); 34 FOR(i,0,maxn) cin>>A[i]; 35 FOR(i,0,maxn) cin>>B[i]; 36 FOR(j,0,maxm) 37 FOR(i,0,maxn) FOR(k,0,maxn) //make_table 38 if(A[i][j]==B[k][j]) { 39 table[j].push_back(A[i][j]); 40 break; 41 } 42 FOR(i,0,maxm) sort(table[i].begin(),table[i].end()); //sort 43 /* FOR(i,0,maxm){ 44 FOR(j,0,table[i].size()) 45 cout<<table[i][j]; 46 cout<<endl; 47 } 48 */ 49 if( dfs(0) ) cout<<ans; else cout<<"NO"; 50 cout<<"\n"; 51 } 52 return 0; 53 }
标签：
原文地址：http://www.cnblogs.com/lidaxin/p/4761409.html
