构造 Codeforces Round #107 (Div. 2) B. Phone Numbers

题目传送门

 /*
     构造：结构体排个序，写的有些啰嗦，主要想用用流，少些了判断条件WA好几次:(
 */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <cmath>
 #include <vector>
 #include <map>
 #include <iostream>
 #include <string>
 using namespace std;

 const int MAXN = 1e2 + ;
 const int INF = 0x3f3f3f3f;
 struct Phone
 {
     string name;
     string num[MAXN];
     int tot, t, p, g, id;
 }p[MAXN];

 bool cmp_t(Phone x, Phone y)
 {
     if (x.t == y.t)    return x.id < y.id;
     return x.t > y.t;
 }

 bool cmp_p(Phone x, Phone y)
 {
     if (x.p == y.p)    return x.id < y.id;
     return x.p > y.p;
 }

 bool cmp_g(Phone x, Phone y)
 {
     if (x.g == y.g)    return x.id < y.id;
     return x.g > y.g;
 }

 int main(void)        //Codeforces Round #107 (Div. 2) B. Phone Numbers
 {
 //    freopen ("C.in", "r", stdin);

     int n;
     while (cin >> n)
     {
         for (int i=; i<=n; ++i)
         {
             cin >> p[i].tot >> p[i].name;    p[i].id = i;
             p[i].t = p[i].p = p[i].g = ;
             for (int j=; j<=p[i].tot; ++j)
             {
                 cin >> p[i].num[j];
                 if (p[i].num[j][] == p[i].num[j][] && p[i].num[j][] == p[i].num[j][] &&
                     p[i].num[j][] == p[i].num[j][] &&    p[i].num[j][] == p[i].num[j][] &&
                     p[i].num[j][] == p[i].num[j][])    p[i].t++;
                 else if (p[i].num[j][] > p[i].num[j][] && p[i].num[j][] > p[i].num[j][] &&
                         p[i].num[j][] > p[i].num[j][] && p[i].num[j][] > p[i].num[j][] &&
                         p[i].num[j][] > p[i].num[j][])    p[i].p++;
             }
             p[i].g = p[i].tot - p[i].t - p[i].p;
 //            cout << p[i].t << " " << p[i].p << " " << p[i].g << endl;
         }

         int pre = ;
         sort (p+, p++n, cmp_t);
         cout << "If you want to call a taxi, you should call: ";
         for (int i=; i<=n; ++i)
         {
             if (i == )
             {
                 cout << p[i].name;    pre = p[i].t;
             }
             else if (p[i].t == pre)    cout << ", " << p[i].name;
             else    break;
         }
         cout << "." << endl;
         sort (p+, p++n, cmp_p);
         cout << "If you want to order a pizza, you should call: ";
         for (int i=; i<=n; ++i)
         {
             if (i == )
             {
                 cout << p[i].name;    pre = p[i].p;
             }
             else if (p[i].p == pre)    cout << ", " << p[i].name;
             else    break;
         }
         cout << "." << endl;
         sort (p+, p++n, cmp_g);
         cout << "If you want to go to a cafe with a wonderful girl, you should call: ";
         for (int i=; i<=n; ++i)
         {
             if (i == )
             {
                 cout << p[i].name;    pre = p[i].g;
             }
             else if (p[i].g == pre)    cout << ", " << p[i].name;
             else    break;
         }
         cout << "." << endl;
     }

     return ;
 }

 /*
 If you want to call a taxi, you should call: Rogulenko.
 If you want to order a pizza, you should call: Fedorov, Rogulenko, Kaluzhin.
 If you want to go to a cafe with a wonderful girl, you should call: Melnikov.
 */