-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathHJ25.CPP
85 lines (81 loc) · 2.2 KB
/
HJ25.CPP
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
#include <iostream>
#include <vector>
#include <set>
#include <string>
#include <unordered_map>
#include <sstream>
using namespace std;
int main()
{
int INum = 0;
while (cin >> INum){
vector<string> I;
set<int> R;
vector<vector<string>> output;
unordered_map<int, int> map1;
stringstream trainer;
for (int i = 0; i < INum; i++)
{
string input;
cin >> input;
I.push_back(input);
}
int RNum = 0;
cin >> RNum;
for (int i = 0; i < RNum; i++)
{
int input;
cin >> input;
R.insert(input);
}
int mark1 = 0;
for (auto i = 0; i < R.size(); i++)
{
int k = 0;
auto Iop = R.begin();
for (int o = 0; o < i; o++)
Iop++;
for (int j = 0; j < I.size(); j++)
{
string bak1;
trainer<<*Iop;trainer>>bak1;trainer.clear();
if (I[j].find(bak1) != I[j].npos)
{
if (k == 0)
{
map1.insert(make_pair(*Iop, mark1));
mark1++;
vector<string> bak;
bak.push_back(bak1);
output.push_back(bak);
k = 1;
}
string bak2;
trainer << j;
trainer >> bak2;
trainer.clear();
output[map1[*Iop]].push_back(bak2);
output[map1[*Iop]].push_back(I[j]);
}
}
}
int total = 0;
for (auto i = output.begin(); i != output.end(); i++)
{
total += i->size() + 1;
}
cout << total;
for (auto i = output.begin(); i != output.end(); i++)
{
int mark = 0;
for (auto j = i->begin(); j != i->end(); j++)
{
if (mark == 1)
cout << " " << ((i->size() - 1) / 2);
cout << " " << *j;
mark++;
}
}
cout<<endl;
}
}