1204

使用AC自动机，不过时间还是用的比较多。。。。

有关AC自动机，这里讲得好

 

#include <iostream>#include <cstring>#include <algorithm>using namespace std;struct tnode{static const int CNUM = 26;tnode(): fail(NULL), line(-1){memset(child, 0, sizeof(child));}tnode *fail;tnode *child[CNUM];int line;};int L, C, W, lft, len[1000], direction[8][2] = {{0, -1}, {1, -1}, {1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}};char s[1000][1001], t[1000][1001], ans[1000][20];tnode root, *queue[1000000];void init(){for(int i = 0; i < L; ++i){cin >> s[i];}for(int i = 0; i < W; ++i){cin >> t[i];}}void insert(){for(int i = 0; i < W; ++i){tnode *p = &root;for(int j = 0; t[i][j] != '/0'; ++j){int index = t[i][j] - 'A';if(NULL == p ->child[index]){p ->child[index] = new tnode;}p = p ->child[index];}p ->line = i;len[i] = strlen(t[i]);}}void destroy_child(tnode *p){for(int i = 0; i < tnode::CNUM; ++i){if(p ->child[i]){destroy_child(p ->child[i]);delete p ->child[i];p ->child[i] = NULL;}}}void BFS(){tnode *p;int head = 0, rear = 1;queue[0] = &root;root.fail = &root;while(head < rear){for(int i = 0; i < tnode::CNUM; ++i){if(queue[head] ->child[i]){if(queue[head] == &root){queue[head] ->child[i] ->fail = &root;}else{p = queue[head] ->fail;while(p != &root && !p ->child[i]){p = p ->fail;}queue[head] ->child[i] ->fail = p ->child[i]? p ->child[i]: &root;}queue[rear] = queue[head] ->child[i];++rear;}}++head;}}void match(const char *s, int l, int c, int mode){tnode *p = &root;for(int i = 0; s[i] != '/0'; ++i){int index = s[i] - 'A';while(!p ->child[index] && p != &root){p = p ->fail;}p = p ->child[index]? p ->child[index]: &root;if(p ->line != -1 && '/0' == ans[p ->line][0]){sprintf(ans[p ->line], "%d %d %c", l + (i - len[p ->line] + 1) * direction[mode][1], c + (i - len[p ->line] + 1) * direction[mode][0], 'A' + mode);--lft;}}}int main(){char temp[1001];while(cin >> L >> C >> W){init();insert();BFS();for(int i = 0; i < W; ans[i][0] = '/0', ++i);lft = W;for(int i = 0; i < L && lft; ++i){strcpy(temp, s[i]);match(temp, i, 0, 2);reverse(temp, temp + C);match(temp, i, C - 1, 6);}for(int i = 0; i < C && lft; ++i){for(int j = 0; j < L; ++j){temp[j] = s[j][i];}temp[L] = '/0';match(temp, 0, i, 4);reverse(temp, temp + L);match(temp, L - 1, i, 0);}for(int i = C - 1; i >= 0 && lft; --i){int p = 0;for(int j = 0, k = i; k < C && j < L; ++k, ++j, ++p){temp[p] = s[j][k];}temp[p] = '/0';match(temp, 0, i, 3);reverse(temp, temp + p);match(temp, p - 1, i + p - 1, 7);}for(int i = 1; i < L && lft; ++i){int p = 0;for(int j = i, k = 0; j < L && k < C; ++j, ++k, ++p){temp[p] = s[j][k];}temp[p] = '/0';match(temp, i, 0, 3);reverse(temp, temp + p);match(temp, i + p - 1, p - 1, 7);}for(int i = C - 1; i >= 0 && lft; --i){int p = 0;for(int j = i, k = 0; j >= 0 && k < L; --j, ++k, ++p){temp[p] = s[k][j];}temp[p] = '/0';match(temp, 0, i, 5);reverse(temp, temp + p);match(temp, p - 1, i - p + 1, 1);}for(int i = 1; i < L && lft; ++i){int p = 0;for(int j = C - 1, k = i; j >= 0 && k < L; --j, ++k, ++p){temp[p] = s[k][j];}temp[p] = '/0';match(temp, i, C - 1, 5);reverse(temp, temp + p);match(temp, i + p - 1, C - p, 1);}for(int i = 0; i < W; ++i){cout << ans[i] << endl;}destroy_child(&root);}return 0;}