ZOJ 3601 Unrequited Love 【STL__pair_的应用】

下面这个例子就是 STL：pair 的用法

#include <iostream>
#include <utility>
#include <string>
using namespace std;
 
int main () {
  pair <string,double> product1 ("tomatoes",3.25);
  pair <string,double> product2;
  pair <string,double> product3;
 
  product2.first = "lightbulbs";     // type of first is string
  product2.second = 0.99;            // type of second is double
 
  product3 = make_pair ("shoes",20.0);
 
  cout << "The price of " << product1.first << " is $" << product1.second << "
";
  cout << "The price of " << product2.first << " is $" << product2.second << "
";
  cout << "The price of " << product3.first << " is $" << product3.second << "
";
  return 0;
}

这道题目使用　pair　可以非常方便的解决

Source Code:

//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
#include <stack>
#include <string>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <vector>
#include <algorithm>
#define Max(a,b) (((a) > (b)) ? (a) : (b))
#define Min(a,b) (((a) < (b)) ? (a) : (b))
#define Abs(x) (((x) > 0) ? (x) : (-(x)))
#define MOD 1000000007
#define pi acos(-1.0)

using namespace std;

typedef long long           ll      ;
typedef unsigned long long  ull     ;
typedef unsigned int        uint    ;
typedef unsigned char       uchar   ;

template<class T> inline void checkmin(T &a,T b){if(a>b) a=b;}
template<class T> inline void checkmax(T &a,T b){if(a<b) a=b;}

const double eps = 1e-7      ;
const int N = 210            ;
const int M = 1100011*2      ;
const ll P = 10000000097ll   ;
const int MAXN = 10900000    ;


map <string,int> mp;
map < pair<int,int>,int > G;
vector <string> a[60000];
int b[60000];
string str[60000], tmp;

int main() {
    int i, j, t, n, m, k, q;
    scanf("%d",&t);
    while (t--) {
        scanf("%d %d %d",&n,&m,&q);
        mp.clear();
        G.clear();
        for (i = 0; i < n + m; ++i) {
                a[i].clear();
                cin >> tmp;
                mp[tmp] = i;
                cin >> k;
                for (j = 0; j < k; ++j) {
                    cin >> tmp;
                    a[i].push_back(tmp);
                }
        }
        for (i = 0; i < n + m; ++i)
                for (j = 0; j < a[i].size(); ++j)
                        G[make_pair (i,mp[a[i][j]])] = 1;
        while (q--) {
                cin >> k;
                for (i = 0; i < k; ++i) {
                        cin >> tmp;
                        str[i] = tmp;
                        b[i] = mp[str[i]];
                }
                int flag;
                for (i = 0; i < k; ++i) {
                        flag = 1;
                        for (j = 0; j < k; ++j) {
                            if (i != j) {
                                if ( G[ make_pair(b[i],b[j]) ] == 0 || G[ make_pair(b[j],b[i]) ] == 1 ) {
                                    flag = 0;
                                    break;
                                }
                            }
                        }
                        if (flag) {
                            cout << "1 " << str[i] << endl;
                            break;
                        }
                }
                if (!flag) cout << 0 << endl;
        }
        cout << endl;
    }
    return 0;
}