Code/CDOWN.cpp at master · sushiljacksparrow/Code · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
/*Sushil Kumar Singh */
#include <cassert>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <ext/numeric>
#include <ext/hash_map>
#include <ext/hash_set>
#include <ext/algorithm>

using namespace std;
using namespace __gnu_cxx;

#define pb push_back
#define vi vector<int>
#define vii vector<vi>
#define ii pair<int,int>
#define vs vector<string>
#define all(v) (v).begin(), (v).end()
#define For(i,x) for(int i=0;i<x;i++)

map<string, string> mp;
int len;

int sove(vector< pair<string, string> > vp, string s, int d)
{
	if(mp[s]!=0)
		return mp[s];
	int count=0;

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

	vector< pair<string, string> > vp;
	int n, d, t;
	string s1, s2;
	cin>>n>>d;
	pair<string, string> p;
	mp.clear();
	set<string>ss;
	for(int i=0;i<n;i++)
	{
		cin>>s1>>t;
		p.first=s1;
		ss.insert(s1);
		while(t--)
		{
			cin>>s2;
			p.second=s2;
			vp.push_back(p);
			ss.insert(s2);
		}

	}

	len=vp.size();
	set<string>::iterator it;
	for(it=ss.begin(); it!=ss.end();it++)
	{
		string s = *it;
		if(mp[s]!=0)
		{
			solve(vp, s, d);
		}
	}

    system("pause");
}