亚洲免费在线-亚洲免费在线播放-亚洲免费在线观看-亚洲免费在线观看视频-亚洲免费在线看-亚洲免费在线视频

匹配行UVA 題目10010 - Where's Waldorf?

系統 1991 0

發一下牢騷和主題無關:

????

? ?Where's Waldorf??

????Given a?

????m

?by?

????n

?grid of letters, (?

????

????), and a list of words, find the location in the grid at which the word can be found. A word matches a straight, uninterrupted line of letters in the grid. A word can match the letters in the grid regardless of case (i.e. upper and lower case letters are to be treated as the same). The matching can be done in any of the eight directions either horizontally, vertically or diagonally through the grid.

????

Input?

????The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.

????The input begins with a pair of integers,? m ?followed by? n ,??in decimal notation on a single line. The next? m ?lines contain? n ?letters each; this is the grid of letters in which the words of the list must be found. The letters in the grid may be in upper or lower case. Following the grid of letters, another integer? k ?appears on a line by itself (?). The next? k ?lines of input contain the list of words to search for, one word per line. These words may contain upper and lower case letters only (no spaces, hyphens or other non-alphabetic characters).

????

Output?

????For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

????For each word in the word list, a pair of integers representing the location of the corresponding word in the grid must be output. The integers must be separated by a single space. The first integer is the line in the grid where the first letter of the given word can be found (1 represents the topmost line in the grid, and? m ?represents the bottommost line). The second integer is the column in the grid where the first letter of the given word can be found (1 represents the leftmost column in the grid, and? n ?represents the rightmost column in the grid). If a word can be found more than once in the grid, then the location which is output should correspond to the uppermost occurence of the word (i.e. the occurence which places the first letter of the word closest to the top of the grid). If two or more words are uppermost, the output should correspond to the leftmost of these occurences. All words can be found at least once in the grid.

????

Sample Input?

    1



8 11

abcDEFGhigg

hEbkWalDork

FtyAwaldORm

FtsimrLqsrc

byoArBeDeyv

Klcbqwikomk

strEBGadhrb

yUiqlxcnBjf

4

Waldorf

Bambi

Betty

Dagbert
  

????

Sample Output?

    2 5

2 3

1 2

7 8
  

????

????


????

?

????

????Miguel Revilla?

????2000-08-22

????

????

????【粗心】:

????輸入:

????給你一個由字母成組的網格,M行N列。找尋一個單詞在網格中的置位。 一個單詞匹配網格中聯系不間斷的字母??梢匝匾馊畏较蚱ヅ洌还部梢云ヅ浒藗€方向。略忽大小寫。

???? 須要匹配的字符串有 K 個。

???? 出輸:

???? 每組出輸之間都一行空行。

???? m n m 代表匹配的最上面的行

???? ????? n 代表匹配的最下面的行

???? 如果結果有多個,只出輸匹配串。要求:匹配串的第一個字母必須是最高最左的。結果至少有一個。

????【代碼】:

????每日一道理
青春是用意志的血滴和拼搏的汗水釀成的瓊漿——歷久彌香;青春是用不凋的希望和不滅的向往編織的彩虹——絢麗輝煌;青春是用永恒的執著和頑強的韌勁筑起的一道銅墻鐵壁——固若金湯。
    /*********************************

*   期日:2013-4-23

*   作者:SJF0115

*   題號: 標題10010 - Where's Waldorf?

*   起源:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=12&page=show_problem&problem=951

*   結果:AC

*   起源:UVA

*   結總:

**********************************/

#include<stdio.h>

#include<string.h>



char Matrix[51][51];

char str[21],temp[21];

int StartR,StartC;

//M行 N列

int Match(int M,int N,int &StartR,int &StartC){

	int i,j,k,flag;

	StartR = 51,StartC = 51;

	int len = strlen(str);

	for(i = 0;i < M;i++){

		for(j = 0;j < N;j++){

			flag = 1;

			//left - right

			if(j + len <= N){

				flag = 0;

				for(k = 0;k < len;k++){

					if(str[k] != Matrix[i][j+k]){

						flag = 1;

						break;

					}

				}

				if(flag == 0){

					if(StartR >  i+1){

						StartR = i+1;

						StartC = j+1;

					}

					else if(StartR ==  i+1 && StartC > j+1){

						StartR = i+1;

						StartC = j+1;

					}

				}

			}

			//right - left

			if(j - len + 1>= 0){

				flag = 0;

				for(k = 0;k < len;k++){

					if(str[k] != Matrix[i][j-k]){

						flag = 1;

						break;

					}

				}

				if(flag == 0){

					if(StartR >  i+1){

						StartR = i+1;

						StartC = j+1;

					}

					else if(StartR ==  i+1 && StartC > j+1){

						StartR = i+1;

						StartC = j+1;

					}

				}

			}

			//up - down

			if(i + len <= M){

				flag = 0;

				for(k = 0;k < len;k++){

					if(str[k] != Matrix[i+k][j]){

						flag = 1;

						break;

					}

				}

				if(flag == 0){

					if(StartR >  i+1){

						StartR = i+1;

						StartC = j+1;

					}

					else if(StartR ==  i+1 && StartC > j+1){

						StartR = i+1;

						StartC = j+1;

					}

				}

			}

			//down - up

			if(i - len + 1 >= 0){

				flag = 0;

				for(k = 0;k < len;k++){

					if(str[k] != Matrix[i-k][j]){

						flag = 1;

						break;

					}

				}

				if(flag == 0){

					if(StartR >  i+1){

						StartR = i+1;

						StartC = j+1;

					}

					else if(StartR ==  i+1 && StartC > j+1){

						StartR = i+1;

						StartC = j+1;

					}

				}

			}

			//right - up

			if(j + len <= N && i - len + 1 >= 0){

				flag = 0;

				for(k = 0;k < len;k++){

					if(str[k] != Matrix[i-k][j+k]){

						flag = 1;

						break;

					}

				}

				if(flag == 0){

					if(StartR >  i+1){

						StartR = i+1;

						StartC = j+1;

					}

					else if(StartR ==  i+1 && StartC > j+1){

						StartR = i+1;

						StartC = j+1;

					}

				}

			}

			//right - down

			if(j + len <= N && i + len <= M){

				flag = 0;

				for(k = 0;k < len;k++){

					if(str[k] != Matrix[i+k][j+k]){

						flag = 1;

						break;

					}

				}

				if(flag == 0){

					if(StartR >  i+1){

						StartR = i+1;

						StartC = j+1;

					}

					else if(StartR ==  i+1 && StartC > j+1){

						StartR = i+1;

						StartC = j+1;

					}

				}

			}

			//left - up

			if(j - len + 1 >= 0 && i - len + 1 >= 0){

				flag = 0;

				for(k = 0;k < len;k++){

					if(str[k] != Matrix[i-k][j-k]){

						flag = 1;

						break;

					}

				}

				if(flag == 0){

					if(StartR >  i+1){

						StartR = i+1;

						StartC = j+1;

					}

					else if(StartR ==  i+1 && StartC > j+1){

						StartR = i+1;

						StartC = j+1;

					}

				}

			}

			//left - down

			if(j - len + 1 >= 0 && i + len <= M){

				flag = 0;

				for(k = 0;k < len;k++){

					if(str[k] != Matrix[i-k][j+k]){

						flag = 1;

						break;

					}

				}

				if(flag == 0){

					if(StartR >  i+1){

						StartR = i+1;

						StartC = j+1;

					}

					else if(StartR ==  i+1 && StartC > j+1){

						StartR = i+1;

						StartC = j+1;

					}

				}

			}

		}//for j

	}//for i

	return 0;

}



int main (){

	int i,j,Case,k,M,N;

	//freopen("C:\\Users\\XIAOSI\\Desktop\\acm.txt","r",stdin);  

	while(scanf("%d",&Case) != EOF){

		while(Case--){

			scanf("%d %d",&M,&N);

			//輸入字符陣矩

			for(i = 0;i < M;i++){

				scanf("%s",temp);

				for(j = 0;j < N;j++){

					Matrix[i][j] = temp[j];

					//轉換為小寫

					if(Matrix[i][j] >= 'A' && Matrix[i][j] <= 'Z'){

						Matrix[i][j] = Matrix[i][j] - 'A' + 'a';

					}

				}

			}

			scanf("%d",&k);

			//待匹配串

			for(i = 0;i < k;i++){

				scanf("%s",str);

				int len = strlen(str);

				//轉換為小寫

				for(j = 0;j < len;j++){

					if(str[j] >= 'A' && str[j] <= 'Z'){

						str[j] = str[j] - 'A' + 'a';

					}

				}

				//printf("%s",str);

				Match(M,N,StartR,StartC);

				printf("%d %d\n",StartR,StartC);

			}

			//每組測試之間有空行

			if(Case){

				printf("\n");

			}

		}

	}

	return 0;

}
  

文章結束給大家分享下程序員的一些笑話語錄: 《諾基亞投資手機瀏覽器UCWEB,資金不詳或控股》杯具了,好不容易養大的閨女嫁外國。(心疼是你養的嗎?中國創業型公司創業初期哪個從國有銀行貸到過錢?)

匹配行UVA 題目10010 - Where's Waldorf?


更多文章、技術交流、商務合作、聯系博主

微信掃碼或搜索:z360901061

微信掃一掃加我為好友

QQ號聯系: 360901061

您的支持是博主寫作最大的動力,如果您喜歡我的文章,感覺我的文章對您有幫助,請用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧,狠狠點擊下面給點支持吧,站長非常感激您!手機微信長按不能支付解決辦法:請將微信支付二維碼保存到相冊,切換到微信,然后點擊微信右上角掃一掃功能,選擇支付二維碼完成支付。

【本文對您有幫助就好】

您的支持是博主寫作最大的動力,如果您喜歡我的文章,感覺我的文章對您有幫助,請用微信掃描上面二維碼支持博主2元、5元、10元、自定義金額等您想捐的金額吧,站長會非常 感謝您的哦!??!

發表我的評論
最新評論 總共0條評論
主站蜘蛛池模板: 久久99中文字幕久久 | 国产成人99久久亚洲综合精品 | 国产精品福利久久 | 250pp久久新 26uuu精品一区二区 | 97影院论理手机在线观看 | 国产chinesehd在线观看 | 欧美操穴 | 日日噜噜夜夜躁躁狠狠 | 日本精品久久久久久久 | 国产v欧美v日本v精品 | 色综合色综合色综合 | 成人区精品一区二区不卡亚洲 | 午夜毛片福利 | 日韩欧美国产一区二区三区 | 一级毛片老太婆交性欧美 | 午夜亚洲精品久久久久久 | 一本大道久久香蕉成人网 | 欧美黄页网 | 国产成人精品综合 | 久久国产午夜精品理论片34页 | 国内精品久久久久久久久久影视 | 国产目拍亚洲精品区一区 | 中文字幕一区二区三区视频在线 | 偷偷狠狠的日日高清完整视频 | 四虎免费在线观看视频 | 好看的中文字幕在线 | 久久国产一区二区三区 | 国产99久久 | jizz中国人| 久久免费国产精品一区二区 | 99精品久久99久久久久 | 九天玄帝诀王凡小说免费阅读 | 国产麻豆精品在线 | 成人免费看毛片 | 亚洲国产精 | 黄视频网站免费看 | 国产精品高清一区二区不卡 | 亚洲小色网 | 91免费网站在线看入口黄 | 青草视频.com| 一区二区在线精品免费视频 |