暴力/set Codeforces Round #291 (Div. 2) C. Watto and Mechanism

题目传送门

 /*
     set的二分查找
     如果数据规模小的话可以用O(n^2)的暴力想法
     否则就只好一个一个的换(a, b, c)，在set容器找相匹配的
 */
 #include <cstdio>
 #include <cmath>
 #include <string>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 #include <map>
 #include <set>
 #include <vector>
 using namespace std;

 int main(void)
 {
     //freopen ("C.in", "r", stdin);

     set<string> s;
     string tmp;
     int n, m, mx;

     while (cin >> n >> m)
     {
         mx = -;
         s.clear ();
         for (int i=; i<=n; ++i)
         {
             cin >> tmp;
             s.insert (tmp);
             int len = tmp.size ();
             mx = max (mx, len);
         }
         if (n * m * mx < 1e8)
         {
             for (int j=; j<=m; ++j)
             {
                 cin >> tmp;
                 int cnt = ;
                 set<string>::iterator it;
                 for (it=s.begin (); it!=s.end (); ++it)
                 {
                     if (it->size () == tmp.size ())
                     {
                         cnt = ;
                         for (int j=; j<it->size (); ++j)
                         {
                             if ((*it)[j] != tmp[j])   cnt++;
                             if (cnt > )    break;
                         }
                         if (cnt == )   break;
                     }
                 }
                 if (cnt == )   cout << "YES" << endl;
                 else    cout << "NO" << endl;
             }
             continue;
         }

         for (int i=; i<=m; ++i)
         {
             cin >> tmp;
             bool flag = false;
             for (int j=; tmp[j]!='\0'; ++j)
             {
                 if (tmp[j] == 'a')
                 {
                     tmp[j] = 'b';
                     if (s.find (tmp) != s.end ())
                     {
                         flag = true;    break;
                     }
                     tmp[j] = 'c';
                     if (s.find (tmp) != s.end ())
                     {
                         flag = true;    break;
                     }
                     tmp[j] = 'a';
                 }
                 if (tmp[j] == 'b')
                 {
                     tmp[j] = 'a';
                     if (s.find (tmp) != s.end ())
                     {
                         flag = true;    break;
                     }
                     tmp[j] = 'c';
                     if (s.find (tmp) != s.end ())
                     {
                         flag = true;    break;
                     }
                     tmp[j] = 'b';
                 }
                 if (tmp[j] == 'c')
                 {
                     tmp[j] = 'a';
                     if (s.find (tmp) != s.end ())
                     {
                         flag = true;    break;
                     }
                     tmp[j] = 'b';
                     if (s.find (tmp) != s.end ())
                     {
                         flag = true;    break;
                     }
                     tmp[j] = 'c';
                 }
             }
             (flag) ? cout << "YES" << endl : cout << "NO" << endl;
         }
     }

     return ;
 }

 /*
 YES NO
 */