-
Notifications
You must be signed in to change notification settings - Fork 18
Expand file tree
/
Copy pathC.cpp
More file actions
77 lines (71 loc) · 1.91 KB
/
C.cpp
File metadata and controls
77 lines (71 loc) · 1.91 KB
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
#include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define REP(i, a) for (int i = 0, _a = (a); i < _a; ++i)
#define DEBUG(X) \
{ cout << #X << " = " << (X) << endl; }
#define PR(A, n) \
{ \
cout << #A << " = "; \
FOR(_, 1, n) cout << A[_] << ' '; \
cout << endl; \
}
#define PR0(A, n) \
{ \
cout << #A << " = "; \
REP(_, n) cout << A[_] << ' '; \
cout << endl; \
}
#define sqr(x) ((x) * (x))
#define ll long long
#define __builtin_popcount __builtin_popcountll
#define SZ(x) ((int)(x).size())
using namespace std;
double safe_sqrt(double x) { return sqrt(max((double)0.0, x)); }
int GI(ll& x) { return scanf("%lld", &x); }
#undef int
int main() {
#define int long long
ios::sync_with_stdio(0);
cin.tie(0);
cout << (fixed) << setprecision(9);
int a, b;
while (cin >> a >> b) {
map<string, int> need, black, white;
need["pawn"] = 8;
need["rook"] = 2;
need["knight"] = 2;
need["bishop"] = 2;
need["king"] = 1;
need["queen"] = 1;
int total = a;
FOR(i, 1, a) {
string c, name;
cin >> c >> name;
if (c == "black")
black[name]++;
else
white[name]++;
}
vector<string> res;
FOR(i, 1, b) {
string c, name;
cin >> c >> name;
if (c == "black" && black[name] < need[name]) {
black[name]++;
total++;
res.push_back(c + " " + name);
} else if (c == "white" && white[name] < need[name]) {
white[name]++;
total++;
res.push_back(c + " " + name);
}
}
if (total < 32)
cout << "impossible" << endl;
else {
for (auto s : res) cout << s << '\n';
}
}
}