text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, i, j, k, l;
string s1 = "I hate that ";
string s2 = "I love that ";
string s3 = "I hate it";
string s4 = "I love it";
int main() {
cin >> a;
if (a == 1) {
cout << "I hate it";
return 0;
}
for (i = 1; i <= a; i++) {
if (i % 2 == 1 && i < a) cout << s1;
if (i % 2 == 0 && i < a) cout << s2;
if (a % 2 == 1 && i == a) cout << s3;
if (a % 2 == 0 && i == a) cout << s4;
}
}
|
#include <bits/stdc++.h>
int n;
using namespace std;
int main() {
cin >> n;
for (int i = 1; i <= n - 1; i++) {
if (i % 2 == 1) {
cout << "I hate that ";
} else {
cout << "I love that ";
}
}
if (n % 2 == 1) {
cout << "I hate it";
} else {
cout << "I love it";
}
}
|
#include <bits/stdc++.h>
int main() {
int n, i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
if (i % 2 != 0 && i != n) {
printf("I hate that ");
} else if (i % 2 != 0 && i == n) {
printf("I hate ");
} else if (i != n) {
printf("I love that ");
} else {
printf("I love ");
}
}
printf("it");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(10);
cout << fixed;
long long int n;
cin >> n;
;
string ans = "I hate ";
for (int i = 2; i <= n; ++i) {
if (i % 2 == 0) {
ans += "that I love ";
} else {
ans += "that I hate ";
}
}
ans += "it";
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
std::cin >> n;
for (i = 1; i <= n; i++) {
if (i % 2 == 0 && i != n)
std::cout << "I love that"
<< " ";
else if (i % 2 != 0 && i != n)
std::cout << "I hate that"
<< " ";
else if (i == n && i % 2 == 0)
std::cout << "I love"
<< " ";
else if (i == n && i % 2 != 0)
std::cout << "I hate"
<< " ";
}
std::cout << "it" << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << "I hate";
for (int i = 1; i < n; i++) {
if (i % 2 != 0)
cout << " that I love";
else {
cout << " that I hate";
}
}
cout << " it";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0;
cin >> a;
for (int i = 0; i < a; i++) {
if (i % 2 == 0) {
cout << "I hate ";
} else {
cout << "I love ";
}
if (i == a - 1) {
cout << "it";
} else {
cout << "that ";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string ans = "I hate";
int toggle = 1;
for (int i = 1; i < n; i++) {
if (toggle)
ans.append(" that I love");
else
ans.append(" that I hate");
toggle = 1 - toggle;
}
ans.append(" it");
cout << ans;
}
|
#include <bits/stdc++.h>
int main() {
int n, i;
scanf("%d", &n);
printf("I hate ");
for (i = 0; i < n; i++) {
if (i >= 1) {
if (i % 2 != 0) {
printf("that I love ");
} else {
printf("that I hate ");
}
}
}
printf("it\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
string p[] = {"I hate", "I love", " that ", " it"};
cin >> n;
for (i = 0; i < n; i++) {
cout << p[i % 2];
if (i < n - 1)
cout << p[2];
else
cout << p[3];
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i < n; i++) {
if (i % 2 == 1) {
cout << "I hate that ";
} else {
cout << "I love that ";
}
}
if (n % 2 == 1) {
cout << "I hate it ";
} else {
cout << "I love it ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
scanf("%d", &t);
string str1 = "I hate that ";
string str2 = "I love that ";
string str3 = "I hate it";
string str4 = "I love it";
for (int i = 1; i < t; i++) {
if (i % 2 != 0)
cout << str1;
else
cout << str2;
}
if (t % 2 != 0)
cout << str3 << endl;
else
cout << str4 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
string s = "I hate ";
string p = "I love ";
for (i = 1; i <= n; i++) {
if (i > 1) {
cout << "that ";
}
if (i % 2 != 0) {
cout << s;
} else
cout << p;
}
cout << "it" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n{}, counter{1};
cin >> n;
cout << "I hate ";
while (counter < n) {
counter++;
if (counter % 2 == 0) {
cout << "that I love ";
} else
cout << "that I hate ";
}
cout << "it";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s = "";
cin >> n;
for (int i = 1; i <= n; i++) {
if (i % 2 != 0) {
if (i != n)
s += "I hate that ";
else
s += "I hate it";
} else {
if (i != n)
s += "I love that ";
else
s += "I love it";
}
}
cout << s << endl;
}
|
#include <bits/stdc++.h>
inline int F() {
register int aa, bb, ch;
while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-')
;
ch == '-' ? aa = bb = 0 : (aa = ch - '0', bb = 1);
while (ch = getchar(), ch >= '0' && ch <= '9') aa = aa * 10 + ch - '0';
return bb ? aa : -aa;
}
int a[7], b[7], d[7], c[100010];
char s[11];
int get() {
int flag = 0;
scanf("%s", s + 1);
int len = strlen(s + 1);
for (int i = 1; i <= len; ++i)
if (s[i] == ',') flag = i;
if (flag) {
if (s[1] == 'S') return 7;
if (s[1] == 'M') return 8;
if (s[1] == 'L') return 9;
if (s[2] == 'L') return 10;
if (s[3] == 'L') return 11;
} else {
if (s[1] == 'S') return 1;
if (s[1] == 'M') return 2;
if (s[1] == 'L') return 3;
if (s[2] == 'L') return 4;
if (s[3] == 'L') return 5;
if (s[4] == 'L') return 6;
}
return 0;
}
int main() {
for (int i = 1; i <= 6; ++i) a[i] = F();
int n = F(), now;
for (int i = 1; i <= n; ++i) {
now = c[i] = get();
if (now <= 6)
--a[now];
else
++b[now - 6];
}
bool flag = 1;
for (int i = 1; i <= 5; ++i) {
if (a[i] < 0 || a[i + 1] < 0) flag = 0;
int now = a[i] - d[i];
if (now >= b[i])
d[i + 1] = 0;
else
d[i + 1] = b[i] - now;
if (a[i + 1] - d[i + 1] < 0) flag = 0;
}
if (!flag) {
puts("NO");
} else {
puts("YES");
for (int i = 1; i <= n; ++i)
if (c[i] <= 6) {
if (c[i] == 1) puts("S");
if (c[i] == 2) puts("M");
if (c[i] == 3) puts("L");
if (c[i] == 4) puts("XL");
if (c[i] == 5) puts("XXL");
if (c[i] == 6) puts("XXXL");
} else {
if (c[i] == 7)
if (d[2]) {
--d[2], puts("M");
} else
puts("S");
if (c[i] == 8)
if (d[3]) {
--d[3], puts("L");
} else
puts("M");
if (c[i] == 9)
if (d[4]) {
--d[4], puts("XL");
} else
puts("L");
if (c[i] == 10)
if (d[5]) {
--d[5], puts("XXL");
} else
puts("XL");
if (c[i] == 11)
if (d[6]) {
--d[6], puts("XXXL");
} else
puts("XXL");
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
unordered_map<string, int> M;
string ss[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int n, m = 6, a[100010], L[100010];
vector<int> ke[10];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (int i = 1; i <= 6; i++) M[ss[i - 1]] = i;
for (int i = 1; i <= m; i++) cin >> a[i];
vector<pair<int, int> > v;
cin >> n;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
bool kt = true;
for (int i = 0, _v = s.size(); i < _v; i++) {
if (s[i] == ',') {
s[i] = ' ';
kt = false;
}
}
if (kt) {
L[i] = M[s];
a[M[s]]--;
} else {
stringstream sss(s);
string s1, s2;
sss >> s1;
ke[M[s1]].push_back(i);
}
}
for (int i = 1; i <= n; i++)
if (a[i] < 0) {
cout << "NO";
return 0;
};
for (int i = 1; i <= 6; i++) {
while (ke[i - 1].size() > 0) {
int temp = ke[i - 1][ke[i - 1].size() - 1];
ke[i - 1].pop_back();
L[temp] = i;
a[i]--;
}
if (a[i] < 0) {
cout << "NO";
return 0;
};
if (a[i] > 0) {
while (a[i] > 0) {
if (ke[i].size() == 0) break;
int temp = ke[i][ke[i].size() - 1];
ke[i].pop_back();
L[temp] = i;
a[i]--;
}
}
}
for (int i = 1; i <= 6; i++)
if (ke[i].size() > 0) {
cout << "NO";
return 0;
};
cout << "YES" << '\n';
for (int i = 1; i <= n; i++) {
cout << ss[L[i] - 1] << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
using fl = long double;
using ll = long long;
using pii = pair<int, int>;
const int m = 6;
const int maxn = 3e5;
int cnt[m + 1];
int u[m + 1];
int res[maxn];
int need[maxn];
int allow[m + 1];
int shift[m + 1];
int parse(string s) {
switch (s[0]) {
case 'S':
return 0;
case 'M':
return 1;
case 'L':
return 2;
case 'X':
return s.length() + 1;
default:
return -1;
}
}
void print(int t) {
switch (t) {
case 0:
cout << "S";
break;
case 1:
cout << "M";
break;
case 2:
cout << "L";
break;
case 3:
cout << "XL";
break;
case 4:
cout << "XXL";
break;
case 5:
cout << "XXXL";
break;
default:
break;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
for (int i = 0; i < m; ++i) {
cin >> cnt[i];
}
int n;
cin >> n;
string s;
for (int i = 0; i < n; ++i) {
cin >> s;
size_t y;
if (string::npos == (y = s.find(','))) {
res[i] = parse(s);
need[i] = -1;
--cnt[res[i]];
} else {
need[i] = parse(s.substr(0, y));
++u[need[i]];
res[i] = -1;
}
}
for (int i = 0; i < m; ++i) {
if (cnt[i] < 0) {
cout << "NO\n";
return 0;
}
}
for (int i = 0; i < m; ++i) {
if (cnt[i] >= u[i]) {
allow[i] = u[i];
} else {
allow[i] = cnt[i];
if (cnt[i + 1] < u[i] - cnt[i]) {
cout << "NO\n";
return 0;
}
cnt[i + 1] -= (u[i] - cnt[i]);
}
}
cout << "YES\n";
for (int i = 0; i < n; ++i) {
if (res[i] >= 0) {
print(res[i]);
} else {
if (allow[need[i]] > 0) {
print(need[i]);
--allow[need[i]];
} else {
print(need[i] + 1);
}
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxL = 70;
int mod = 1e9 + 7;
long long mod1 = 1e9 + 7;
const int inf = 1.2e18;
const int maxn = 6e5 + 100;
const int baze = 330;
const int base = 3;
int from[maxn];
int to[maxn];
int w[maxn];
int dis[maxn];
int head[maxn];
int sdfgf[maxn];
int backup[maxn];
int chiz[maxn];
int eof, source = maxn - 1, sink = maxn - 2;
void add_edge(int u, int v, int W) {
from[eof] = u, to[eof] = v, w[eof] = W, sdfgf[eof] = head[u], head[u] = eof++;
swap(u, v);
W = 0;
from[eof] = u, to[eof] = v, w[eof] = W, sdfgf[eof] = head[u], head[u] = eof++;
}
bool bfs() {
int st = 0, en = 1;
chiz[0] = source;
memset(dis, 63, sizeof dis);
dis[source] = 0;
while (st < en) {
int v = chiz[st++];
for (int e = head[v]; ~e; e = sdfgf[e])
if (w[e] && dis[to[e]] > dis[v] + 1) {
dis[to[e]] = dis[v] + 1;
chiz[en++] = to[e];
if (to[e] == sink) return true;
}
}
return false;
}
int dfs(int v, int mn = 1000000) {
if (!mn || v == sink) return mn;
int ret = 0;
for (int &e = head[v]; ~e; e = sdfgf[e])
if (dis[to[e]] == dis[v] + 1) {
int x = dfs(to[e], min(mn, w[e]));
ret += x;
w[e] -= x;
w[e ^ 1] += x;
mn -= x;
if (mn == 0) break;
}
return ret;
}
int flow() {
memcpy(backup, head, sizeof head);
int ret = 0;
while (bfs()) {
ret += dfs(source);
memcpy(head, backup, sizeof head);
}
return ret;
}
int ar[60];
string t[maxn];
int pos[maxn];
int n;
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
memset(head, -1, sizeof head);
map<string, int> mp;
mp["S"] = 0;
mp["M"] = 1;
mp["L"] = 2;
mp["XL"] = 3;
mp["XXL"] = 4;
mp["XXXL"] = 5;
for (int i = 0; i < 6; i++) cin >> ar[i], add_edge(source, i, ar[i]);
cin >> n;
vector<int> vc;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
t[i] = s;
pos[i] = ((int)((s).size()));
if (s.find(',') < ((int)((s).size()))) {
int x = s.find(',');
pos[i] = x;
vc.push_back(eof);
add_edge(mp[s.substr(0, x)], i + 10, 1);
add_edge(mp[s.substr(x + 1, ((int)((s).size())))], i + 10, 1);
add_edge(i + 10, sink, 1);
} else
vc.push_back(eof), add_edge(mp[s], sink, 1);
}
int ans = flow();
if (ans != n) return cout << "NO" << endl, 0;
cout << "YES" << endl;
int hlp = 0;
for (int x : vc) {
if (w[x] == 0)
cout << t[hlp].substr(0, pos[hlp]) << '\n';
else
cout << t[hlp].substr(pos[hlp] + 1, ((int)((t[hlp]).size()))) << '\n';
hlp++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 256;
const char nxtl = '\n';
const int mod = (int)1e9 + 7;
const double eps = (double)1e-9;
template <typename T>
inline bool updmin(T &a, const T &b) {
return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool updmax(T &a, const T &b) {
return a < b ? a = b, 1 : 0;
}
int cnt[7];
int n;
string res[MAXN], q[MAXN], w[MAXN];
map<string, int> pos;
map<int, string> invpos;
set<int> g[10];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
pos["S"] = 1;
pos["M"] = 2;
pos["L"] = 3;
pos["XL"] = 4;
pos["XXL"] = 5;
pos["XXXL"] = 6;
for (auto &to : pos) {
invpos[to.second] = to.first;
}
for (int i = 1; i <= 6; ++i) cin >> cnt[i];
cin >> n;
for (int i = 1; i <= n; ++i) {
string cur;
cin >> cur;
int ptr = 0;
while (ptr < ((int)(cur.size())) && cur[ptr] != ',')
q[i] += cur[ptr], ptr++;
ptr++;
while (ptr < ((int)(cur.size()))) w[i] += cur[ptr], ptr++;
if (w[i].empty()) {
cnt[pos[q[i]]]--;
res[i] = q[i];
} else {
g[pos[q[i]]].insert(i);
g[pos[w[i]]].insert(i);
}
}
for (int i = 1; i <= 6; ++i)
if (cnt[i] < 0) {
cout << "NO\n";
return 0;
}
for (int i = 1; i <= 6; ++i) {
vector<int> go;
for (auto &to : g[i]) {
if (w[to] == invpos[i]) go.push_back(to);
}
if (((int)(go.size())) > cnt[i]) {
cout << "NO\n";
return 0;
}
cnt[i] -= ((int)(go.size()));
for (auto &to : go) {
g[i].erase(to);
g[pos[w[to]]].erase(to);
res[to] = invpos[i];
}
for (auto &to : g[i]) {
if (!cnt[i]) break;
res[to] = invpos[i];
cnt[i]--;
g[pos[w[to]]].erase(to);
}
}
for (int i = 1; i <= n; ++i)
if (res[i].empty()) {
cout << "NO\n";
return 0;
}
cout << "YES\n";
for (int i = 1; i <= n; ++i) cout << res[i] << nxtl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Dim = 1e5 + 5;
char cuv[Dim][10];
int n, s, m, l, xl, xxl, xxxl;
int ans[Dim];
int s_m, m_l, l_xl, xl_xxl, xxl_xxxl;
int main() {
ios::sync_with_stdio(false);
cin.tie(), cout.tie();
cin >> s >> m >> l >> xl >> xxl >> xxxl >> n;
for (int i = 1; i <= n; ++i) {
cin >> cuv[i] + 1;
if (strcmp(cuv[i] + 1, "S") == 0) --s, ans[i] = 1;
if (strcmp(cuv[i] + 1, "M") == 0) --m, ans[i] = 2;
if (strcmp(cuv[i] + 1, "L") == 0) --l, ans[i] = 3;
if (strcmp(cuv[i] + 1, "XL") == 0) --xl, ans[i] = 4;
if (strcmp(cuv[i] + 1, "XXL") == 0) --xxl, ans[i] = 5;
if (strcmp(cuv[i] + 1, "XXXL") == 0) --xxxl, ans[i] = 6;
if (s < 0 || m < 0 || l < 0 || xl < 0 || xxl < 0 || xxxl < 0) {
cout << "NO\n";
return 0;
}
if (strcmp(cuv[i] + 1, "S,M") == 0) ++s_m;
if (strcmp(cuv[i] + 1, "M,L") == 0) ++m_l;
if (strcmp(cuv[i] + 1, "L,XL") == 0) ++l_xl;
if (strcmp(cuv[i] + 1, "XL,XXL") == 0) ++xl_xxl;
if (strcmp(cuv[i] + 1, "XXL,XXXL") == 0) ++xxl_xxxl;
}
for (int i = 1; i <= n; ++i)
if (s > 0 && strcmp(cuv[i] + 1, "S,M") == 0) ans[i] = 1, --s, --s_m;
if (s_m != 0) {
for (int i = 1; i <= n; ++i) {
if (ans[i] == 0 && strcmp(cuv[i] + 1, "S,M") == 0) ans[i] = 2, --m;
if (m < 0) {
cout << "NO\n";
return 0;
}
}
}
for (int i = 1; i <= n; ++i)
if (m > 0 && strcmp(cuv[i] + 1, "M,L") == 0) ans[i] = 2, --m, --m_l;
if (m_l != 0) {
for (int i = 1; i <= n; ++i) {
if (ans[i] == 0 && strcmp(cuv[i] + 1, "M,L") == 0) ans[i] = 3, --l;
if (l < 0) {
cout << "NO\n";
return 0;
}
}
}
for (int i = 1; i <= n; ++i)
if (l > 0 && strcmp(cuv[i] + 1, "L,XL") == 0) ans[i] = 3, --l, --l_xl;
if (l_xl != 0) {
for (int i = 1; i <= n; ++i) {
if (ans[i] == 0 && strcmp(cuv[i] + 1, "L,XL") == 0) ans[i] = 4, --xl;
if (xl < 0) {
cout << "NO\n";
return 0;
}
}
}
for (int i = 1; i <= n; ++i)
if (xl > 0 && strcmp(cuv[i] + 1, "XL,XXL") == 0) ans[i] = 4, --xl, --xl_xxl;
if (xl_xxl != 0) {
for (int i = 1; i <= n; ++i) {
if (ans[i] == 0 && strcmp(cuv[i] + 1, "XL,XXL") == 0) ans[i] = 5, --xxl;
if (xxl < 0) {
cout << "NO\n";
return 0;
}
}
}
for (int i = 1; i <= n; ++i)
if (xxl > 0 && strcmp(cuv[i] + 1, "XXL,XXXL") == 0)
ans[i] = 5, --xxl, --xxl_xxxl;
if (xxl_xxxl != 0) {
for (int i = 1; i <= n; ++i) {
if (ans[i] == 0 && strcmp(cuv[i] + 1, "XXL,XXXL") == 0)
ans[i] = 6, --xxxl;
if (xxxl < 0) {
cout << "NO\n";
return 0;
}
}
}
cout << "YES\n";
for (int i = 1; i <= n; ++i) {
if (ans[i] == 1) cout << "S\n";
if (ans[i] == 2) cout << "M\n";
if (ans[i] == 3) cout << "L\n";
if (ans[i] == 4) cout << "XL\n";
if (ans[i] == 5) cout << "XXL\n";
if (ans[i] == 6) cout << "XXXL\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> A(6);
vector<pair<deque<int>, deque<int>>> Q(6);
int n;
map<string, int> Choise = {{"S", 0}, {"M", 1}, {"L", 2},
{"XL", 3}, {"XXL", 4}, {"XXXL", 5}};
vector<string> deparse = {"S", "M", "L", "XL", "XXL", "XXXL"};
function<pair<int, int>(string s)> parse = [](string s) {
string cur = "";
pair<int, int> ans = {2147483647, 2147483647};
for (int i = 0; i < s.size(); i++) {
if (s[i] == ',') {
ans.second = Choise[cur];
cur = "";
} else {
cur += s[i];
}
}
ans.first = Choise[cur];
if (ans.second < ans.first) swap(ans.first, ans.second);
return ans;
};
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
for (auto &x : A) cin >> x;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
pair<int, int> x = parse(s);
if (x.second == 2147483647) {
Q[x.first].first.push_back(i);
} else {
Q[x.first].second.push_back(i);
}
}
vector<int> Ans(n);
deque<int> O1, O2;
for (int i = 0; i < 6; i++) {
while (!Q[i].first.empty()) {
O1.push_back(Q[i].first.front());
Q[i].first.pop_front();
}
while (!Q[i].second.empty()) {
O2.push_back(Q[i].second.front());
Q[i].second.pop_front();
}
while (!O1.empty() && A[i] > 0) {
Ans[O1.front()] = i;
O1.pop_front();
A[i]--;
}
while (!O2.empty() && A[i] > 0) {
Ans[O2.front()] = i;
O2.pop_front();
A[i]--;
}
if (O1.size()) {
cout << "NO"
<< "\n";
return 0;
}
swap(O1, O2);
}
cout << "YES\n";
for (auto x : Ans) {
cout << deparse[x] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 5;
int main() {
vector<string> v{"S", "M", "L", "XL", "XXL", "XXXL"};
map<string, int> mp;
for (int i = 0; i < 6; i++) {
mp[v[i]] = i;
}
vector<int> cnt(10, 0);
for (int i = 0; i < 6; i++) cin >> cnt[i];
int man;
cin >> man;
vector<pair<int, pair<int, int> > > shirt;
for (int i = 0; i < man; i++) {
string txt;
cin >> txt;
string a, b;
bool ok = false;
for (char ch : txt) {
if (ch == ',') {
ok = true;
continue;
}
if (ok)
b += ch;
else
a += ch;
}
if (ok)
shirt.push_back({mp[a], {mp[b], i}});
else
shirt.push_back({-1, {mp[a], i}});
}
sort(shirt.begin(), shirt.end());
std::vector<int> ans(mx);
for (int i = 0; i < man; i++) {
int a = shirt[i].first;
int b = (shirt[i].second).first;
int c = (shirt[i].second).second;
if (a == -1) {
cnt[b]--;
ans[c] = b;
} else {
if (cnt[a]) {
cnt[a]--;
ans[c] = a;
} else {
cnt[b]--;
ans[c] = b;
}
}
}
for (int i = 0; i < 6; i++) {
if (cnt[i] < 0) {
cout << "NO\n";
exit(0);
}
}
cout << "YES\n";
for (int i = 0; i < man; i++) cout << v[ans[i]] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
string tt[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int n, m = 6;
int d[11];
string ss;
int a[N], b[N];
int ans[N];
class Dinic {
public:
struct Edge {
int from, to, cap, flow;
Edge(int _from = -1, int _to = -1, int _cap = 0, int _flow = 0)
: from(_from), to(_to), cap(_cap), flow(_flow) {}
};
int n;
vector<vector<int> > g;
vector<vector<int>::iterator> work;
vector<Edge> edges;
vector<int> level;
void init(int _n) {
n = _n;
g.assign(_n, vector<int>());
work.assign(_n, vector<int>::iterator());
edges.clear();
level.resize(_n);
}
void addEdge(int u, int v, int cap, bool twoWay) {
g[u].push_back((int)edges.size());
edges.push_back(Edge(u, v, cap, 0));
g[v].push_back((int)edges.size());
edges.push_back(Edge(v, u, (twoWay == true) ? cap : 0, 0));
}
void resetFlows() {
for (int i = 0; i < (int)edges.size(); ++i) edges[i].flow = 0;
}
bool bfs(int s, int t) {
level = vector<int>(n, -1);
queue<int> q;
q.push(s);
level[s] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
for (__typeof(g[u].begin()) it = g[u].begin(); it != g[u].end(); ++it) {
int e = *it;
int v = edges[e].to;
if (level[v] == -1 && edges[e].flow < edges[e].cap) {
level[v] = level[u] + 1;
q.push(v);
}
}
}
return (level[t] != -1);
}
int dfs(int s, int t, int f) {
if (s == t) return f;
for (vector<int>::iterator &e = work[s]; e != g[s].end(); ++e) {
int v = edges[*e].to;
if (level[v] == level[s] + 1 && edges[*e].flow < edges[*e].cap) {
int d = dfs(v, t, min(f, edges[*e].cap - edges[*e].flow));
if (d > 0) {
edges[*e].flow += d;
edges[*e ^ 1].flow -= d;
return d;
}
}
}
return 0;
}
int maxFlow(int s, int t) {
int ret = 0;
while (bfs(s, t)) {
for (int i = 0; i < n; ++i) work[i] = g[i].begin();
for (int d; (d = dfs(s, t, numeric_limits<int>::max())) != 0; ret += d)
;
}
return ret;
}
void print() {
for (int i = 0; i < (int)edges.size(); ++i)
if (edges[i].flow > 0) {
int u = edges[i].from;
int v = edges[i].to;
if (u >= v) continue;
if (1 <= u && u <= m && m + 1 <= v && v < n) {
ans[v - m - 1] = u - 1;
}
}
}
} netWork;
void check(string s, int id) {
string s1, s2;
int n = (int)s.size();
for (int i = 0; i < n; ++i)
if (s[i] == ',') {
s1 = s.substr(0, i);
s2 = s.substr(i + 1, n - i - 1);
for (int j = 0; j < m; ++j)
if (s1 == tt[j]) a[id] = j;
for (int j = 0; j < m; ++j)
if (s2 == tt[j]) b[id] = j;
return;
}
for (int j = 0; j < m; ++j)
if (s == tt[j]) a[id] = j;
b[id] = -1;
}
int main() {
ios::sync_with_stdio(false);
for (int i = 0; i < m; ++i) cin >> d[i];
cin >> n;
int s = 0, t = m + n + 1;
netWork.init(t + 1);
for (int i = 0; i < n; ++i) {
cin >> ss;
check(ss, i);
}
for (int i = 1; i <= m; ++i) {
netWork.addEdge(s, i, d[i - 1], 0);
}
for (int i = 1; i <= n; ++i) {
netWork.addEdge(a[i - 1] + 1, m + i, 1, 0);
if (b[i - 1] != -1) {
netWork.addEdge(b[i - 1] + 1, m + i, 1, 0);
}
netWork.addEdge(m + i, t, 1, 0);
}
int maxFlow = netWork.maxFlow(s, t);
if (maxFlow == n) {
cout << "YES" << endl;
netWork.print();
for (int i = 0; i < n; ++i) cout << tt[ans[i]] << endl;
} else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string t[200000], st[200000];
long long s, m, l, xl, xxl, xxxl;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> s >> m >> l >> xl >> xxl >> xxxl;
long long n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> st[i];
for (int i = 1; i <= n; i++)
if (st[i] == "S") {
t[i] = "S";
s--;
} else if (st[i] == "M") {
t[i] = "M";
m--;
} else if (st[i] == "L") {
t[i] = "L";
l--;
} else if (st[i] == "XL") {
t[i] = "XL";
xl--;
} else if (st[i] == "XXL") {
xxl--;
t[i] = "XXL";
} else if (st[i] == "XXXL") {
xxxl--;
t[i] = "XXXL";
}
for (int i = 1; i <= n; i++)
if (st[i] == "S,M") {
if (s != 0) {
s--;
t[i] = "S";
} else {
t[i] = "M";
m--;
}
}
for (int i = 1; i <= n; i++)
if (st[i] == "M,L") {
if (m != 0) {
m--;
t[i] = "M";
} else {
l--;
t[i] = "L";
}
}
for (int i = 1; i <= n; i++)
if (st[i] == "L,XL") {
if (l != 0) {
l--;
t[i] = "L";
} else {
xl--;
t[i] = "XL";
}
}
for (int i = 1; i <= n; i++)
if (st[i] == "XL,XXL") {
if (xl != 0) {
xl--;
t[i] = "XL";
} else {
t[i] = "XXL";
xxl--;
}
}
for (int i = 1; i <= n; i++)
if (st[i] == "XXL,XXXL") {
if (xxl != 0) {
xxl--;
t[i] = "XXL";
} else {
t[i] = "XXXL";
xxxl--;
}
}
if (s >= 0 && l >= 0 && m >= 0 && xl >= 0 && xxl >= 0 && xxxl >= 0) {
cout << "YES" << '\n';
for (int i = 1; i <= n; i++) cout << t[i] << '\n';
} else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
const int nmax = 10;
int v[nmax + 1];
map<string, int> mp;
string ans[100010];
string trad[10] = {"", "S", "M", "L", "XL", "XXL", "XXXL"};
vector<int> intre[nmax + 1];
int main() {
cin.sync_with_stdio(false);
cin.tie();
cout.tie();
mp["S"] = 1;
mp["M"] = 2;
mp["L"] = 3;
mp["XL"] = 4;
mp["XXL"] = 5;
mp["XXXL"] = 6;
for (int i = 1; i <= 6; ++i) cin >> v[i];
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
string s;
cin >> s;
if (mp.find(s) != mp.end()) {
--v[mp[s]];
ans[i] = s;
} else {
string aux;
for (auto j : s) {
if (j == ',') break;
aux += j;
}
intre[mp[aux]].push_back(i);
}
}
for (int i = 1; i < 6; ++i) {
while (!intre[i].empty() && v[i] > 0) {
--v[i];
ans[intre[i].back()] = trad[i];
intre[i].pop_back();
}
while (!intre[i].empty()) {
--v[i + 1];
ans[intre[i].back()] = trad[i + 1];
intre[i].pop_back();
}
}
bool ok = 1;
for (int i = 1; i <= 6; ++i)
if (v[i] < 0 || intre[i].size()) ok = 0;
if (ok == 1) {
cout << "YES\n";
for (int i = 1; i <= n; ++i) cout << ans[i] << "\n";
} else {
cout << "NO\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
map<string, int> kek;
map<int, string> wtf;
kek["S"] = 0;
kek["M"] = 1;
kek["L"] = 2;
kek["XL"] = 3;
kek["XXL"] = 4;
kek["XXXL"] = 5;
wtf[0] = "S";
wtf[1] = "M";
wtf[2] = "L";
wtf[3] = "XL";
wtf[4] = "XXL";
wtf[5] = "XXXL";
vector<int> kol(6);
for (int i = 0; i < 6; ++i) {
cin >> kol[i];
}
int m;
cin >> m;
vector<vector<int> > ans(6);
vector<string> answer(m);
vector<bool> used(m, 0);
vector<string> vv;
string s;
vector<string> vod(2);
int x;
for (int i = 0; i < m; ++i) {
cin >> s;
vod[0] = "", vod[1] = "";
x = 0;
for (int j = 0; j < s.length(); ++j) {
if (s[j] != ',') {
vod[x] += s[j];
} else {
x++;
}
}
if (x == 0) {
kol[kek[vod[0]]]--;
answer[i] = vod[0];
used[i] = 1;
} else {
if (kol[kek[vod[0]]] <= 0) {
kol[kek[vod[1]]]--;
answer[i] = vod[1];
used[i] = 1;
} else if (kol[kek[vod[1]]] <= 0) {
kol[kek[vod[0]]]--;
answer[i] = vod[0];
used[i] = 1;
} else {
ans[kek[vod[0]]].push_back(i);
ans[kek[vod[1]]].push_back(i);
}
}
}
for (int i = 0; i < 6; ++i) {
if (kol[i] < 0) {
cout << "NO";
return 0;
}
}
int i = 0;
while (i < 6) {
while ((!ans[i].empty()) && kol[i] > 0) {
if (!used[ans[i][ans[i].size() - 1]]) {
kol[i]--;
answer[ans[i][ans[i].size() - 1]] = wtf[i];
used[ans[i][ans[i].size() - 1]] = 1;
}
ans[i].pop_back();
}
i++;
while (i < 6 && (!ans[i - 1].empty()) && kol[i] > 0) {
if (!used[ans[i - 1][ans[i - 1].size() - 1]]) {
kol[i]--;
answer[ans[i - 1][ans[i - 1].size() - 1]] = wtf[i];
used[ans[i - 1][ans[i - 1].size() - 1]] = 1;
}
ans[i - 1].pop_back();
}
}
for (int i = 0; i < m; ++i) {
if (!used[i]) {
cout << "NO";
return 0;
}
}
cout << "YES\n";
for (int i = 0; i < m; ++i) {
cout << answer[i] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
const int INF = 1000000000;
struct Edge {
int from, to, cap, flow;
};
bool operator<(const Edge& a, const Edge& b) {
return a.from < b.from || (a.from == b.from && a.to < b.to);
}
struct Dinic {
int n, m, s, t;
vector<Edge> edges;
vector<int> G[maxn];
bool vis[maxn];
int d[maxn];
int cur[maxn];
void ClearAll(int n) {
for (int i = 0; i < n; i++) G[i].clear();
edges.clear();
}
void ClearFlow() {
for (int i = 0; i < (int)edges.size(); i++) edges[i].flow = 0;
}
void AddEdge(int from, int to, int cap) {
edges.push_back((Edge){from, to, cap, 0});
edges.push_back((Edge){to, from, 0, 0});
m = edges.size();
G[from].push_back(m - 2);
G[to].push_back(m - 1);
}
bool BFS() {
memset(vis, 0, sizeof(vis));
queue<int> Q;
Q.push(s);
vis[s] = 1;
d[s] = 0;
while (!Q.empty()) {
int x = Q.front();
Q.pop();
for (int i = 0; i < (int)G[x].size(); i++) {
Edge& e = edges[G[x][i]];
if (!vis[e.to] && e.cap > e.flow) {
vis[e.to] = 1;
d[e.to] = d[x] + 1;
Q.push(e.to);
}
}
}
return vis[t];
}
int DFS(int x, int a) {
if (x == t || a == 0) return a;
int flow = 0, f;
for (int& i = cur[x]; i < (int)G[x].size(); i++) {
Edge& e = edges[G[x][i]];
if (d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap - e.flow))) > 0) {
e.flow += f;
edges[G[x][i] ^ 1].flow -= f;
flow += f;
a -= f;
if (a == 0) break;
}
}
return flow;
}
int Maxflow(int s, int t) {
this->s = s;
this->t = t;
int flow = 0;
while (BFS()) {
memset(cur, 0, sizeof(cur));
flow += DFS(s, INF);
}
return flow;
}
vector<int> Mincut() {
vector<int> ans;
for (int i = 0; i < (int)edges.size(); i++) {
Edge& e = edges[i];
if (vis[e.from] && !vis[e.to] && e.cap > 0) ans.push_back(i);
}
return ans;
}
void Reduce() {
for (int i = 0; i < (int)edges.size(); i++) edges[i].cap -= edges[i].flow;
}
};
Dinic g;
int n, a[10];
char s[20], sp[20];
char mat[70][10] = {"", "S", "M", "L", "XL", "XXL", "XXXL"};
vector<int> vec[maxn];
void add(int i, char* p) {
for (int k = 1; k <= 6; k++)
if (strcmp(p, mat[k]) == 0) {
g.AddEdge(i, n + k, 1);
vec[i].push_back(k);
}
}
int main() {
for (int i = 1; i <= 6; i++) scanf("%d", &a[i]);
scanf("%d", &n);
g.ClearAll(n + 8);
for (int i = 1; i <= 6; i++) g.AddEdge(n + i, n + 7, a[i]);
for (int i = 1; i <= n; i++) {
vec[i].clear();
g.AddEdge(0, i, 1);
scanf("%s", s);
bool div = 0;
int len = strlen(s);
for (int j = 0; j < len; j++)
if (s[j] == ',') {
div = 1;
for (int k = 0; k < j; k++) sp[k] = s[k];
sp[j] = '\0';
add(i, sp);
for (int k = j + 1; k < len; k++) sp[k - j - 1] = s[k];
sp[len - j - 1] = '\0';
add(i, sp);
}
if (!div) add(i, s);
}
int flow = g.Maxflow(0, n + 7);
if (flow < n)
puts("NO");
else {
puts("YES");
for (int x = 1; x <= n; x++)
for (int i = 0; i < (int)g.G[x].size(); i++) {
Edge& e = g.edges[g.G[x][i]];
if (e.from != x) continue;
if (e.cap != e.flow || e.cap == 0) continue;
printf("%s\n", mat[e.to - n]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pci = pair<char, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
const ll infll = 1e18 + 3;
const int maxn = 1e6 + 77;
const int nmax = 1e6 + 577;
const ll basell = 1e18 + 3;
const int mod = 1e9 + 7;
const ld eps = 1e-7;
const int inf = 1009000999;
const int nv = 100505;
const int baseint = 1000200013;
const ld PI = acos(-1.0);
inline bool EQ(ld a, ld b) { return fabs(a - b) < 1e-9; }
int s[10];
int ans[nv];
int inline solve() {
ios::sync_with_stdio(NULL), cin.tie(NULL), cout.tie(NULL);
;
cin >> s[0] >> s[1] >> s[2] >> s[3] >> s[4] >> s[5];
int n;
cin >> n;
vector<pair<pii, int>> v;
for (int i = 0; i < n; ++i) {
string str;
cin >> str;
int h = -1;
for (int j = 0; j < ((int)(str).size()); ++j) {
if (str[j] == ',') h = j;
}
if (h == -1) {
if (str == "S") s[0]--, ans[i] = 0;
if (str == "M") s[1]--, ans[i] = 1;
if (str == "L") s[2]--, ans[i] = 2;
if (str == "XL") s[3]--, ans[i] = 3;
if (str == "XXL") s[4]--, ans[i] = 4;
if (str == "XXXL") s[5]--, ans[i] = 5;
} else {
pii g;
if (str.substr(0, h) == "S") g.first = 0, g.second = 1;
if (str.substr(0, h) == "M") g.first = 1, g.second = 2;
if (str.substr(0, h) == "L") g.first = 2, g.second = 3;
if (str.substr(0, h) == "XL") g.first = 3, g.second = 4;
if (str.substr(0, h) == "XXL") g.first = 4, g.second = 5;
v.push_back(make_pair(g, i));
}
}
if (s[0] < 0 || s[1] < 0 || s[2] < 0 || s[3] < 0 || s[4] < 0 || s[5] < 0) {
return cout << "NO", 0;
}
sort(begin(v), end(v));
for (int i = 0; i < ((int)(v).size()); ++i) {
if (s[v[i].first.first] > 0) {
s[v[i].first.first]--;
ans[v[i].second] = v[i].first.first;
} else if (s[v[i].first.second] > 0) {
s[v[i].first.second]--;
ans[v[i].second] = v[i].first.second;
} else {
return cout << "NO", 0;
}
}
cout << "YES\n";
for (int i = 0; i < n; ++i) {
if (ans[i] == 0) cout << "S\n";
if (ans[i] == 1) cout << "M\n";
if (ans[i] == 2) cout << "L\n";
if (ans[i] == 3) cout << "XL\n";
if (ans[i] == 4) cout << "XXL\n";
if (ans[i] == 5) cout << "XXXL\n";
}
return 0;
}
int32_t main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class edge {
public:
long long int u, v, flow, cap;
edge(long long int u, long long int v, long long int cap)
: u(u), v(v), cap(cap), flow(0) {}
};
class dinic {
public:
vector<edge> ed;
vector<vector<long long int>> adj;
vector<long long int> lvl, ptr;
queue<long long int> q;
long long int s, t, n, m = 0, inf = 1e18;
dinic(long long int n, long long int s, long long int t) : s(s), t(t), n(n) {
lvl.resize(n, 0);
ptr.resize(n, 0);
adj.resize(n);
}
void add_edge(long long int u, long long int v, long long int cap) {
ed.emplace_back(u, v, cap);
ed.emplace_back(v, u, 0);
adj[u].push_back(m);
adj[v].push_back(m + 1);
m += 2;
}
bool bfs() {
while (!q.empty()) {
long long int u = q.front();
q.pop();
for (auto x : adj[u]) {
long long int v = ed[x].v;
if (lvl[v] == -1 && ed[x].cap - ed[x].flow > 0)
lvl[v] = lvl[u] + 1, q.push(v);
}
}
return lvl[t] != -1;
}
long long int dfs(long long int u, long long int flow) {
if (!flow) return 0;
if (u == t) return flow;
for (long long int &id = ptr[u]; id < adj[u].size(); id++) {
long long int x = adj[u][id];
long long int v = ed[x].v;
if (lvl[v] == lvl[u] + 1 && ed[x].cap - ed[x].flow > 0) {
long long int temp = dfs(v, min(flow, ed[x].cap - ed[x].flow));
if (temp) {
ed[x].flow += temp;
ed[x ^ 1].flow -= temp;
return temp;
}
}
}
return 0;
}
long long int maxflow() {
long long int mf = 0;
while (1) {
fill(lvl.begin(), lvl.end(), -1);
lvl[s] = 0, q.push(s);
if (!bfs()) break;
fill(ptr.begin(), ptr.end(), 0);
while (long long int f = dfs(s, inf)) mf += f;
}
return mf;
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int T = 1;
for (long long int qq = 1; qq <= T; qq++) {
long long int k[6];
for (int i = 0; i < 6; i++) {
cin >> k[i];
}
long long int n;
cin >> n;
dinic fl(n + 8, 0, n + 7);
for (int i = 0; i < 6; i++) fl.add_edge(0, i + 1, k[i]);
map<string, long long int> mp;
mp["S"] = 1, mp["M"] = 2, mp["L"] = 3, mp["XL"] = 4, mp["XXL"] = 5,
mp["XXXL"] = 6;
string v[] = {"r", "S", "M", "L", "XL", "XXL", "XXXL"};
for (int i = 0; i < n; i++) {
string s;
cin >> s;
long long int x = 0, y = 0;
while (x != s.size() && s[x] != ',') x++;
if (x != s.size()) y = 1;
x = mp[s.substr(0, x)];
if (y) fl.add_edge(x + 1, i + 7, 1);
fl.add_edge(x, i + 7, 1);
fl.add_edge(i + 7, n + 7, 1);
}
if (fl.maxflow() == n) {
cout << "YES" << endl;
vector<long long int> ans(n);
for (auto x : fl.ed) {
if (x.u >= 1 && x.u <= 6 && x.flow > 0 && x.v > 0) ans[x.v - 7] = x.u;
}
for (auto x : ans) cout << v[x] << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 987654321;
int V, m, S, T;
vector<int> last, nxt, oppo, capa;
void init() {
m = 0;
last.clear();
nxt.clear();
oppo.clear();
capa.clear();
last = vector<int>(V, -1);
}
void add_edge(int u, int v, int c) {
nxt.push_back(last[u]);
last[u] = m;
oppo.push_back(v);
capa.push_back(c);
m++;
}
vector<int> lv;
bool bfs() {
queue<int> q;
lv.clear();
lv = vector<int>(V, -1);
q.push(S);
lv[S] = 0;
while (!q.empty()) {
int fq = q.front();
q.pop();
for (int i = last[fq]; i != -1; i = nxt[i]) {
int j = oppo[i];
if (capa[i] && lv[j] == -1) {
lv[j] = lv[fq] + 1;
q.push(j);
}
}
}
if (lv[T] == -1) return false;
return true;
}
vector<int> l2;
int dfs(int now, int f) {
if (now == T) return f;
for (int i = l2[now]; i != -1; i = nxt[i]) {
int j = oppo[i];
l2[now] = i;
if (lv[j] == lv[now] + 1 && capa[i]) {
int t = dfs(j, min(f, capa[i]));
if (t == 0) continue;
capa[i] -= t;
capa[i ^ 1] += t;
return t;
}
}
return 0;
}
int dinic() {
int tf = 0;
while (bfs()) {
l2.clear();
for (int i = 0; i < V; i++) l2.push_back(last[i]);
while (int t = dfs(S, inf)) tf += t;
}
return tf;
}
map<string, int> mp;
vector<string> inv;
vector<int> sz;
int N;
vector<vector<int> > adj;
vector<string> ans;
void pre() {
mp["S"] = 0;
mp["M"] = 1;
mp["L"] = 2;
mp["XL"] = 3;
mp["XXL"] = 4;
mp["XXXL"] = 5;
inv.resize(6);
inv[0] = "S";
inv[1] = "M";
inv[2] = "L";
inv[3] = "XL";
inv[4] = "XXL";
inv[5] = "XXXL";
}
void get_nw() {
V = N + 8;
S = N + 6;
T = N + 7;
init();
for (int i = 0; i < N; i++) {
if (adj[i].size() == 1) continue;
add_edge(S, i, 1);
add_edge(i, S, 0);
for (int j = 0; j < 2; j++) {
add_edge(i, N + adj[i][j], 1);
add_edge(N + adj[i][j], i, 0);
}
}
for (int i = 0; i < 6; i++) {
add_edge(N + i, T, sz[i]);
add_edge(T, N + i, 0);
}
}
int cnt = 0;
void solve() {
int a = dinic();
if (a != N - cnt)
printf("NO");
else {
printf("YES\n");
for (int i = 0; i < N; i++) {
if (adj[i].size() == 1) continue;
for (int j = last[i]; j != -1; j = nxt[j]) {
if (!capa[j]) {
ans[i] = inv[oppo[j] - N];
break;
}
}
}
for (int i = 0; i < N; i++) {
cout << ans[i] << endl;
}
}
}
int main() {
sz.resize(6);
for (int i = 0; i < 6; i++) {
scanf("%d", &sz[i]);
}
pre();
scanf("%d", &N);
adj.resize(N);
for (int i = 0; i < N; i++) {
string S;
cin >> S;
string t;
for (int j = 0; j < S.size(); j++) {
if (S[j] == ',') {
adj[i].push_back(mp[t]);
t.clear();
} else
t.push_back(S[j]);
}
adj[i].push_back(mp[t]);
}
ans.resize(N);
for (int i = 0; i < N; i++) {
if (adj[i].size() == 1) {
cnt++;
if (sz[adj[i][0]] == 0) {
cout << "NO";
return 0;
}
sz[adj[i][0]]--;
ans[i] = inv[adj[i][0]];
}
}
get_nw();
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100500;
int r[6];
map<string, int> c;
map<int, string> cc;
bool vis[N];
vector<pair<int, int> > w[6];
int ans[N];
int main() {
c["S"] = 0;
c["M"] = 1;
c["L"] = 2;
c["XL"] = 3;
c["XXL"] = 4;
c["XXXL"] = 5;
cc[0] = "S";
cc[1] = "M";
cc[2] = "L";
cc[3] = "XL";
cc[4] = "XXL";
cc[5] = "XXXL";
for (int i = 0, ttto = 6; i < ttto; i++) cin >> r[i];
int n, f = 1;
cin >> n;
for (int i = 0, ttto = n; i < ttto; i++) {
string s, t;
cin >> s;
int p = s.find(",");
if (p != string::npos) t = s.substr(p + 1, s.size());
if (p == string::npos) {
r[c[s]]--;
vis[i] = 1;
ans[i] = c[s];
if (r[c[s]] < 0) f = 0;
} else {
s = s.substr(0, p);
int u = c[s], v = c[t];
if (u > v) swap(u, v);
w[u].push_back(pair<int, int>(1, i));
w[v].push_back(pair<int, int>(0, i));
}
}
if (f == 0)
puts("NO");
else {
for (int i = 0, ttto = 6; i < ttto; i++) {
sort(w[i].begin(), w[i].end());
for (int j = 0, ttto = w[i].size(); j < ttto; j++)
if (!vis[w[i][j].second] && r[i])
ans[w[i][j].second] = i, vis[w[i][j].second] = 1, r[i]--;
}
for (int i = 0, ttto = n; i < ttto; i++)
if (!vis[i]) {
cerr << i << endl;
puts("NO");
return 0;
}
puts("YES");
for (int i = 0, ttto = n; i < ttto; i++) cout << cc[ans[i]] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100100;
int N;
int cnt[6];
vector<int> only[6];
vector<pair<int, int> > both[6];
bool used[MAXN];
map<string, int> mp;
string ans[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int T[MAXN];
bool check() {
for (int i = 0; i < N; i++)
if (!used[i]) return false;
return true;
}
int main() {
ios::sync_with_stdio(0);
mp["S"] = 0;
mp["M"] = 1;
mp["L"] = 2;
mp["XL"] = 3;
mp["XXL"] = 4;
mp["XXXL"] = 5;
for (int i = 0; i < 6; i++) cin >> cnt[i];
cin >> N;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
int idx = 0;
for (; idx < s.size(); idx++)
if (s[idx] == ',') break;
if (idx == (int)s.size())
only[mp[s]].push_back(i);
else {
int x = mp[s.substr(0, idx)];
both[x].push_back(make_pair(1, i));
both[x + 1].push_back(make_pair(0, i));
}
}
for (int i = 0; i < 6; i++) {
for (int j = 0; j < only[i].size() && cnt[i] > 0; j++) {
T[only[i][j]] = i;
cnt[i]--;
used[only[i][j]] = true;
}
sort(both[i].begin(), both[i].end());
for (int j = 0; j < both[i].size() && cnt[i] > 0; j++) {
if (used[both[i][j].second]) continue;
T[both[i][j].second] = i;
cnt[i]--;
used[both[i][j].second] = true;
}
}
if (check()) {
cout << "YES\n";
for (int i = 0; i < N; i++) cout << ans[T[i]] << "\n";
} else
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
namespace fastinput {
inline int readChar();
template <class T = int>
inline T readInt();
template <class T>
inline void writeInt(T x, char end = 0);
inline void writeChar(int x);
inline void writeWord(const char *s);
static const int buf_size = 16384;
inline int getChar() {
static char buf[buf_size];
static int len = 0, pos = 0;
if (pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin);
if (pos == len) return -1;
return buf[pos++];
}
inline int readChar() {
int c = getChar();
while (c <= 32) c = getChar();
return c;
}
template <class T>
inline T readInt() {
int s = 1, c = readChar();
T x = 0;
if (c == '-') s = -1, c = getChar();
while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
return s == 1 ? x : -x;
}
static int write_pos = 0;
static char write_buf[buf_size];
inline void writeChar(char x) {
if (write_pos == buf_size)
fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
write_buf[write_pos++] = x;
}
template <class T>
inline void writeInt(T x, char end) {
if (x < 0) writeChar('-'), x = -x;
char s[24];
int n = 0;
while (x || !n) s[n++] = '0' + x % 10, x /= 10;
while (n--) writeChar(s[n]);
if (end) writeChar(end);
}
inline void writeWord(const char *s) {
while (*s) writeChar(*s++);
}
struct Flusher {
~Flusher() {
if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
}
} flusher;
} // namespace fastinput
using namespace fastinput;
const string arr[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int decode(string s) {
for (int i = 0; i < 6; ++i)
if (s == arr[i]) return i;
}
int cnt[6];
int answer[N];
pair<int, int> want[N];
int give[N];
map<pair<int, int>, vector<int> > whowant;
void NO() {
puts("NO");
exit(0);
}
int main() {
::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
for (int i = 0; i < 6; ++i) cin >> cnt[i];
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
string t;
cin >> t;
size_t x = t.find(',');
if (x != std::string::npos) {
want[i].first = decode(t.substr(0, x));
want[i].second = decode(t.substr(x + 1));
} else
want[i].first = decode(t), want[i].second = -1;
whowant[want[i]].push_back(i);
}
for (int i = 0; i < 6; ++i) {
vector<int> tmp = whowant[{i, -1}];
while (cnt[i] > 0 && tmp.size() > 0) {
give[tmp.back()] = i;
tmp.pop_back();
--cnt[i];
}
if (tmp.size() > 0) NO();
tmp = whowant[{i - 1, i}];
while (cnt[i] > 0 && tmp.size() > 0) {
give[tmp.back()] = i;
tmp.pop_back();
--cnt[i];
}
if (tmp.size() > 0) NO();
tmp = whowant[{i, i + 1}];
while (cnt[i] > 0 && tmp.size() > 0) {
give[tmp.back()] = i;
tmp.pop_back();
--cnt[i];
}
whowant[{i, i + 1}] = tmp;
}
cout << "YES\n";
for (int i = 0; i < n; ++i) cout << arr[give[i]] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long gcd(long long a, long long b) {
a = ((a) < 0 ? -(a) : (a));
b = ((b) < 0 ? -(b) : (b));
while (b) {
a = a % b;
swap(a, b);
}
return a;
}
const long long inf = 2147383647;
const long long mod = 1000000007;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
struct node {
int x, y, next, cap, cost;
};
struct FLOW {
int source, sink;
int head[100030];
void clear() {
e = 0;
memset(head, -1, sizeof(head));
}
node edge[800030];
int e;
void addEdge(int u, int v, int cap, int cap2, int cost) {
edge[e].x = u;
edge[e].y = v;
edge[e].cap = cap;
edge[e].cost = cost;
edge[e].next = head[u];
head[u] = e;
e++;
edge[e].x = v;
edge[e].y = u;
edge[e].cap = cap2;
edge[e].cost = -cost;
edge[e].next = head[v];
head[v] = e;
e++;
}
int vis[100030], q[100030], now[100030];
bool bfs() {
memset(vis, -1, sizeof vis);
vis[source] = 0;
int ini = 0, qend = 0;
q[qend++] = source;
while (ini < qend && vis[sink] == -1) {
int s = q[ini++];
int i;
for (i = head[s]; i != -1; i = edge[i].next) {
int t = edge[i].y;
if (vis[t] == -1 && edge[i].cap) {
vis[t] = vis[s] + 1;
q[qend++] = t;
}
}
}
if (vis[sink] != -1)
return true;
else
return false;
}
int dfs(int s, int f) {
if (f == 0) return 0;
if (s == sink) return f;
for (int &i = now[s]; i != -1; i = edge[i].next) {
int t = edge[i].y;
if (vis[s] + 1 != vis[t]) continue;
int pushed = dfs(t, ((f) < (edge[i].cap) ? (f) : (edge[i].cap)));
if (pushed) {
edge[i].cap -= pushed;
edge[i ^ 1].cap += pushed;
return pushed;
}
}
return 0;
}
int maxFlow(int highestNumberOfNode, int flow) {
int res = 0;
while (1) {
if (flow == 0) break;
if (bfs() == false) break;
int i;
for (i = 0; i <= highestNumberOfNode; i++) now[i] = head[i];
while (int pushed = dfs(source, flow)) {
res += pushed;
flow -= pushed;
}
}
return res;
}
int inq[100030], par[100030], record[100030];
int minCostFlow(int highestNumberOfNode) {
int res = 0, i, j, k, fl = 0;
while (1) {
for (i = 0; i <= highestNumberOfNode; i++) vis[i] = inf;
vis[source] = 0;
deque<int> dq;
dq.push_back(source);
while (!dq.empty()) {
int s = dq.front();
dq.pop_front();
inq[s] = 0;
for (i = head[s]; i != -1; i = edge[i].next) {
int t = edge[i].y;
if (edge[i].cap) {
if (vis[s] + edge[i].cost < vis[t]) {
vis[t] = vis[s] + edge[i].cost;
par[t] = s;
record[t] = i;
if (inq[t] == 0) {
inq[t] = 1;
if (dq.empty() == false && vis[dq.front()] > vis[t])
dq.push_front(t);
else
dq.push_back(t);
}
}
}
}
}
if (vis[sink] == inf) break;
fl++;
res += vis[sink];
for (i = sink; i != source; i = par[i]) {
int t = record[i];
edge[t].cap--;
edge[t ^ 1].cap++;
}
}
return res;
}
} graph;
map<string, int> am;
string br[102];
int ar[102], cr[100005], choice[100005];
int main() {
br[1] = "S";
br[2] = "M";
br[3] = "L";
br[4] = "XL";
br[5] = "XXL";
br[6] = "XXXL";
am["S"] = 1;
am["M"] = 2;
am["L"] = 3;
am["XL"] = 4;
am["XXL"] = 5;
am["XXXL"] = 6;
int n, flag, x, last = 0;
string s;
graph.clear();
for (int i = 1; i <= 6; i++) {
scanf("%d", &ar[i]);
}
scanf("%d", &n);
for (int i = 1; i <= 6; i++) {
graph.addEdge(n + i, n + 7, ar[i], 0, 0);
}
for (int i = 1; i <= n; i++) {
graph.addEdge(0, i, 1, 0, 0);
int pos = -1;
flag = 0;
cin >> s;
for (int j = 0; j < ((long long)(s).size()); j++) {
if (s[j] == ',') {
pos = j;
flag = 1;
break;
}
}
if (pos == -1) pos = ((long long)(s).size());
s = s.substr(0, pos);
x = am[s];
choice[i] = x;
cr[i] = graph.e;
graph.addEdge(i, n + x, 1, 0, 0);
if (flag) {
graph.addEdge(i, n + x + 1, 1, 0, 0);
}
}
graph.source = 0;
graph.sink = n + 7;
x = graph.maxFlow(n + 10, 1e9);
if (x < n) {
printf("NO\n");
} else {
printf("YES\n");
for (int i = 1; i <= n; i++) {
if (!graph.edge[cr[i]].cap) {
cout << br[choice[i]] << "\n";
} else {
cout << br[choice[i] + 1] << "\n";
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string sizes[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int n, cnt[7];
map<string, int> leftNode, rightNode, myMap;
int source, dest;
int id = 0;
const int nmax = 300;
vector<int> gf[nmax];
vector<string> v[100005];
int capac[nmax][nmax];
const int inf = (1 << 30);
int t[nmax], q[2000], flux[nmax][nmax];
bool viz[nmax];
int N;
string ans[100005];
string concat(string s1, string s2) { return s1 + s2; }
int getNode(string s) { return leftNode[s]; }
int getNode(string s1, string s2) { return leftNode[concat(s1, s2)]; }
int getNodeRight(string s) { return rightNode[s]; }
void addEdge(int x, int y, int c) {
gf[x].push_back(y);
gf[y].push_back(x);
capac[x][y] = c;
}
int getNext() {
++id;
return id;
}
bool bfs(int S, int D) {
for (int i = S; i <= D; ++i) viz[i] = 0;
int st = 1;
int dr = 0;
q[++dr] = S;
viz[S] = 1;
for (; st <= dr;) {
int nod = q[st];
++st;
for (int i = 0; i < gf[nod].size(); ++i) {
int vc = gf[nod][i];
if (viz[vc] == 0 && capac[nod][vc] > flux[nod][vc]) {
t[vc] = nod;
viz[vc] = 1;
if (vc == D) return 1;
q[++dr] = vc;
}
}
}
return 0;
}
void rezolva() {
int Flux = 0;
for (; bfs(source, dest);) {
int Min = inf;
for (int i = dest; i != source; i = t[i]) {
Min = min(Min, capac[t[i]][i] - flux[t[i]][i]);
}
for (int i = dest; i != source; i = t[i]) {
flux[t[i]][i] += Min;
flux[i][t[i]] -= Min;
}
Flux += Min;
}
if (Flux < N) {
cout << "NO\n";
return;
}
for (int i = 1; i <= n; ++i) {
if (v[i].size() > 1) {
int node = getNode(v[i][0], v[i][1]);
int node1 = getNodeRight(v[i][0]);
int node2 = getNodeRight(v[i][1]);
if (flux[node][node1] > 0) {
--flux[node][node1];
ans[i] = v[i][0];
} else {
--flux[node][node2];
ans[i] = v[i][1];
}
}
}
cout << "YES\n";
for (int i = 1; i <= n; ++i) {
cout << ans[i] << "\n";
}
}
int main() {
ios::sync_with_stdio(false);
for (int i = 1; i <= 6; ++i) {
cin >> cnt[i];
}
cin >> n;
cin.get();
source = 0;
for (int i = 0; i < 5; ++i) {
leftNode[concat(sizes[i], sizes[i + 1])] = getNext();
}
for (int i = 0; i < 6; ++i) {
myMap[sizes[i]] = i + 1;
}
for (int i = 0; i < 6; ++i) {
rightNode[sizes[i]] = getNext();
}
dest = getNext();
N = n;
for (int i = 1; i <= n; ++i) {
string s;
getline(cin, s);
string s1, s2;
int ok = 0;
for (int j = 0; j < s.size(); ++j) {
if (s[j] == ',') {
ok = 1;
continue;
}
if (ok) {
s2 += s[j];
} else {
s1 += s[j];
}
}
v[i].push_back(s1);
if (s2.size() > 0) {
v[i].push_back(s2);
}
if (v[i].size() == 1) {
if (cnt[myMap[v[i][0]]] == 0) {
cout << "NO\n";
return 0;
}
cnt[myMap[v[i][0]]]--;
ans[i] = v[i][0];
--N;
}
}
for (int i = 1; i <= n; ++i) {
if (v[i].size() == 1) {
continue;
}
string s1 = v[i][0];
string s2 = v[i][1];
int node = getNode(s1, s2);
addEdge(source, node, capac[source][node] + 1);
}
for (int i = 0; i < 6; ++i) {
addEdge(getNodeRight(sizes[i]), dest, cnt[i + 1]);
}
for (int i = 0; i < 5; ++i) {
addEdge(getNode(sizes[i], sizes[i + 1]), getNodeRight(sizes[i]), inf);
addEdge(getNode(sizes[i], sizes[i + 1]), getNodeRight(sizes[i + 1]), inf);
}
rezolva();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int mark[10] = {0};
map<string, int> mp;
mp["S"] = 0;
mp["M"] = 1;
mp["L"] = 2;
mp["XL"] = 3;
mp["XXL"] = 4;
mp["XXXL"] = 5;
for (int i = 0; i < 6; i++) {
cin >> mark[i];
}
int n;
cin >> n;
vector<pair<int, pair<int, int> > > vt;
int ans[n + 5];
for (int i = 0; i < n; i++) {
string tem;
cin >> tem;
string a, b;
int f;
for (int i = 0; i < tem.length(); i++) {
if (tem[i] == ',') {
f = i + 1;
break;
}
a.push_back(tem[i]);
}
for (int i = f; i < tem.length(); i++) {
b.push_back(tem[i]);
}
if (!b.length()) {
ans[i] = mp[a];
mark[mp[a]]--;
} else {
vt.push_back(make_pair(mp[a], make_pair(mp[b], i)));
}
}
sort(vt.begin(), vt.end());
int f = 0;
for (auto data : vt) {
int a = data.first;
int b = data.second.first;
int id = data.second.second;
if (mark[a] > 0) {
mark[a]--;
ans[id] = a;
} else if (mark[b] > 0) {
ans[id] = b;
mark[b]--;
} else {
f = 1;
}
}
for (int i = 0; i < 6; i++)
if (mark[i] < 0) f = 1;
if (f == 1)
cout << "NO\n";
else {
cout << "YES\n";
for (int i = 0; i < n; i++) {
if (ans[i] == 0) cout << "S\n";
if (ans[i] == 1) cout << "M\n";
if (ans[i] == 2) cout << "L\n";
if (ans[i] == 3) cout << "XL\n";
if (ans[i] == 4) cout << "XXL\n";
if (ans[i] == 5) cout << "XXXL\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long lINF = 1000000000000000000;
const int INF = 1000000000;
int gets(const string& s) {
if (s == "S")
return 0;
else if (s == "M")
return 1;
else if (s == "L")
return 2;
else if (s == "XL")
return 3;
else if (s == "XXL")
return 4;
else if (s == "XXXL")
return 5;
}
bool comp(const pair<pair<string, string>, int>& a,
const pair<pair<string, string>, int>& b) {
return gets(a.first.first) < gets(b.first.first);
}
int main() {
iostream::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int an[6];
for (auto(i) = (0); (i) < (6); (i)++) cin >> an[i];
int n;
cin >> n;
vector<string> ans(n);
vector<pair<pair<string, string>, int> > ord;
for (auto(i) = (0); (i) < (n); (i)++) {
string s;
string a, b;
b = "#";
cin >> s;
int j = 0;
for (; j < (int((s).size())); j++)
if (s[j] == ',') {
a = s.substr(0, j);
b = s.substr(j + 1, (int((s).size())));
break;
}
if (b == "#") {
if (an[gets(s)]) {
ans[i] = s;
an[gets(s)]--;
} else {
cout << "NO";
return 0;
}
} else
ord.push_back(make_pair(make_pair(a, b), i));
}
sort(ord.begin(), ord.end(), comp);
for (auto(i) = (0); (i) < ((int((ord).size()))); (i)++) {
if (an[gets(ord[i].first.first)]) {
an[gets(ord[i].first.first)]--;
ans[ord[i].second] = ord[i].first.first;
} else if (an[gets(ord[i].first.second)]) {
an[gets(ord[i].first.second)]--;
ans[ord[i].second] = ord[i].first.second;
} else {
cout << "NO";
return 0;
}
}
cout << "YES\n";
for (auto(i) = (0); (i) < (n); (i)++) cout << ans[i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 17;
int n, a[6];
vector<int> g[N];
map<string, int> mp;
string s[N], res[N];
string str[11] = {"S", "M", "L", "XL", "XXL", "XXXL"};
void Init() {
for (int i = 0; i < 5; i++) str[i + 6] = str[i] + ',' + str[i + 1];
for (int i = 0; i < 11; i++) mp[str[i]] = i;
}
int main() {
Init();
for (int i = 0; i < 6; i++) scanf("%d", a + i);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
g[mp[s[i]]].push_back(i);
}
for (int i = 0; i < 6; i++)
for (int j = 0; j < g[i].size(); j++)
if (!a[i]) {
puts("NO");
return 0;
} else
a[i]--, res[g[i][j]] = str[i];
for (int i = 6; i < 11; i++)
for (int j = 0; j < g[i].size(); j++)
if (a[i - 6])
a[i - 6]--, res[g[i][j]] = str[i - 6];
else if (a[i - 5])
a[i - 5]--, res[g[i][j]] = str[i - 5];
else {
puts("NO");
return 0;
}
puts("YES");
for (int i = 0; i < n; i++) cout << res[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
char s1[6][10] = {"S", "M", "L", "XL", "XXL", "XXXL"};
char s2[5][10] = {"S,M", "M,L", "L,XL", "XL,XXL", "XXL,XXXL"};
char s3[100005][10];
int cnt[6];
int main() {
int n;
for (int i = 0; i < (6); i++) cin >> cnt[i];
cin >> n;
for (int i = 0; i < (n); i++) {
scanf("%s", &s3[i]);
for (int j = 0; j < (6); j++) {
if (strcmp(s1[j], s3[i]) == 0) {
cnt[j]--;
break;
}
}
}
for (int i = 0; i < (6); i++) {
if (cnt[i] < 0) {
cout << "NO" << endl;
return 0;
}
}
for (int j = 0; j < (5); j++) {
for (int i = 0; i < (n); i++) {
if (strcmp(s2[j], s3[i]) == 0) {
if (cnt[j]) {
cnt[j]--;
strcpy(s3[i], s1[j]);
} else if (cnt[j + 1]) {
cnt[j + 1]--;
strcpy(s3[i], s1[j + 1]);
} else {
cout << "NO" << endl;
return 0;
}
}
}
}
cout << "YES" << endl;
for (int i = 0; i < (n); i++) puts(s3[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t[6], r[6] = {0, 0, 0, 0, 0, 0};
int rr[6] = {0, 0, 0, 0, 0, 0};
string rq[100100];
int n;
for (int i = 0; i < 6; i++) cin >> t[i];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> rq[i];
if (rq[i] == "S")
r[0]++;
else if (rq[i] == "M")
r[1]++;
else if (rq[i] == "L")
r[2]++;
else if (rq[i] == "XL")
r[3]++;
else if (rq[i] == "XXL")
r[4]++;
else if (rq[i] == "XXXL")
r[5]++;
else if (rq[i] == "S,M")
rr[0]++;
else if (rq[i] == "M,L")
rr[1]++;
else if (rq[i] == "L,XL")
rr[2]++;
else if (rq[i] == "XL,XXL")
rr[3]++;
else if (rq[i] == "XXL,XXXL")
rr[4]++;
}
for (int i = 0; i < 6; i++) {
t[i] = t[i] - r[i];
if (t[i] < 0) {
cout << "NO" << endl;
return 0;
}
}
int s, m, l, xl, xxl, xxxl;
s = min(t[0], rr[0]);
rr[0] -= s;
if (t[1] < rr[0]) {
cout << "NO" << endl;
return 0;
}
t[1] -= rr[0];
m = min(t[1], rr[1]);
rr[1] -= m;
if (t[2] < rr[1]) {
cout << "NO" << endl;
return 0;
}
t[2] -= rr[1];
l = min(t[2], rr[2]);
rr[2] -= l;
if (t[3] < rr[2]) {
cout << "NO" << endl;
return 0;
}
t[3] -= rr[2];
xl = min(t[3], rr[3]);
rr[3] -= xl;
if (t[4] < rr[3]) {
cout << "NO" << endl;
return 0;
}
t[4] -= rr[3];
xxl = min(t[4], rr[4]);
rr[4] -= xxl;
if (t[5] < rr[4]) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
for (int i = 0; i < n; i++) {
if (rq[i] == "S" || rq[i] == "M" || rq[i] == "L" || rq[i] == "XL" ||
rq[i] == "XXL" || rq[i] == "XXXL") {
cout << rq[i] << endl;
} else if (rq[i] == "S,M") {
if (s-- > 0)
cout << "S" << endl;
else
cout << "M" << endl;
} else if (rq[i] == "M,L") {
if (m-- > 0)
cout << "M" << endl;
else
cout << "L" << endl;
} else if (rq[i] == "L,XL") {
if (l-- > 0)
cout << "L" << endl;
else
cout << "XL" << endl;
} else if (rq[i] == "XL,XXL") {
if (xl-- > 0)
cout << "XL" << endl;
else
cout << "XXL" << endl;
} else if (rq[i] == "XXL,XXXL") {
if (xxl-- > 0)
cout << "XXL" << endl;
else
cout << "XXXL" << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
string kk[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
string ss[6] = {"S,M", "M,L", "L,XL", "XL,XXL", "XXL,XXXL"};
string t[MAXN];
int main() {
int n, i, j;
int sum[7] = {0};
for (i = 0; i < 6; i++) scanf("%d", sum + i);
bool flag = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> t[i];
for (j = 0; j < 6; j++)
if (t[i] == kk[j]) {
sum[j]--;
if (sum[j] < 0) flag = 1;
}
}
if (flag) {
printf("NO\n");
return 0;
}
for (i = 0; i < 5; i++)
for (j = 0; j < n; j++) {
if (t[j] == ss[i]) {
if (sum[i] > 0) {
sum[i]--;
t[j] = kk[i];
continue;
}
if (sum[i + 1] > 0) {
sum[i + 1]--;
t[j] = kk[i + 1];
continue;
}
flag = 1;
break;
}
}
if (flag) {
printf("NO\n");
return 0;
}
printf("YES\n");
for (i = 0; i < n; i++) cout << t[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void Read(int &x) {
char c;
while (c = getchar(), c != EOF)
if (c >= '0' && c <= '9') {
x = c - '0';
while (c = getchar(), c >= '0' && c <= '9') x = x * 10 + c - '0';
ungetc(c, stdin);
return;
}
}
int n;
char ss[7][20] = {"", "S", "M", "L", "XL", "XXL", "XXXL"};
struct node {
int v, cap;
node *back, *next;
} * adj[10000], edge[10000], *ecnt = edge;
void addedge(int u, int v, int cap) {
node *p = ++ecnt;
p->v = v;
p->cap = cap;
p->next = adj[u];
adj[u] = p;
p = p->back = ++ecnt;
p->v = u;
p->cap = 0;
p->next = adj[v];
adj[v] = p;
p->back = ecnt - 1;
}
int S = 12, T, tot = T = 13, cap[20], dist[20], vd[20];
inline int f(char *s) {
if (*s == 'S') {
return s[1] ? 7 : 1;
}
if (*s == 'M') return s[1] ? 8 : 2;
if (*s == 'L') return s[1] ? 9 : 3;
if (s[1] == 'L') return s[2] ? 10 : 4;
if (s[2] == 'L') return s[3] ? 11 : 5;
return 6;
}
int dfs(int u, int augu) {
if (u == T) return augu;
int augv = 0, v, delta, mind = tot - 1;
for (node *p = adj[u]; p; p = p->next)
if (p->cap) {
v = p->v;
if (dist[u] == dist[v] + 1) {
delta = min(augu - augv, p->cap);
delta = dfs(v, delta);
augv += delta;
p->cap -= delta;
p->back->cap += delta;
if (augu == augv || dist[S] >= tot) return augv;
}
mind = min(dist[v], mind);
}
if (!augv) {
if (!--vd[dist[u]]) dist[S] = tot;
vd[dist[u] = mind + 1]++;
}
return augv;
}
char s[100000 + 10][20];
int sap() {
int flow = 0;
vd[0] = tot;
while (dist[S] < tot) flow += dfs(S, 0x7fffffff);
return flow;
}
void read() {
int i, wt;
for (i = 1; i <= 6; i++) {
Read(wt);
addedge(i, T, wt);
}
for (i = 1; i < 6; i++) {
addedge(i + 6, i, 0x7fffffff);
addedge(i + 6, i + 1, 0x7fffffff);
}
Read(n);
for (i = 1; i <= n; i++) {
scanf("%s", s[i]);
cap[f(s[i])]++;
}
for (i = 1; i <= 11; i++) addedge(S, i, cap[i]);
}
void solve() {
if (sap() != n) {
puts("NO");
exit(0);
}
puts("YES");
int i;
for (i = 1; i <= n; i++)
if (f(s[i]) <= 6)
puts(s[i]);
else {
int t = f(s[i]);
for (node *p = adj[t]; p; p = p->next)
if (p->v <= 6) {
if (p->back->cap) {
puts(ss[p->v]);
p->back->cap--;
break;
}
}
}
}
int main() {
read();
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int inf = 0x3f3f3f3f;
int num[maxn][2];
struct Edge {
int from, to, cap, flow;
Edge(int u, int v, int c, int f) : from(u), to(v), cap(c), flow(f) {}
};
struct EdmondsKarp {
int n, m;
vector<Edge> edges;
vector<int> G[maxn];
int a[maxn];
int p[maxn];
void init(int n) {
for (int i = 0; i < n; i++) G[i].clear();
edges.clear();
}
void AddEdge(int from, int to, int cap) {
edges.push_back(Edge(from, to, cap, 0));
edges.push_back(Edge(to, from, 0, 0));
m = edges.size();
G[from].push_back(m - 2);
G[to].push_back(m - 1);
}
int Maxflow(int s, int t) {
int flow = 0;
for (;;) {
memset(a, 0, sizeof(a));
queue<int> Q;
Q.push(s);
a[s] = inf;
while (!Q.empty()) {
int x = Q.front();
Q.pop();
for (int i = 0; i < (int)G[x].size(); i++) {
Edge& e = edges[G[x][i]];
if (!a[e.to] && e.cap > e.flow) {
p[e.to] = G[x][i];
a[e.to] = min(a[x], e.cap - e.flow);
Q.push(e.to);
}
}
if (a[t]) break;
}
if (!a[t]) break;
for (int u = t; u != s; u = edges[p[u]].from) {
edges[p[u]].flow += a[t];
edges[p[u] ^ 1].flow -= a[t];
if (13 <= u && u <= 17 && 1 <= edges[p[u]].from &&
edges[p[u]].from <= 6) {
if (edges[p[u]].from == u - 12) num[u][0] += a[t];
if (edges[p[u]].from == u - 11) num[u][1] += a[t];
}
if (1 <= u && u <= 6 && 13 <= edges[p[u]].from &&
edges[p[u]].from <= 17) {
assert(0);
if (u == edges[p[u]].from - 12) num[edges[p[u]].from][0] -= a[t];
if (u == edges[p[u]].from - 11) num[edges[p[u]].from][1] -= a[t];
}
}
flow += a[t];
}
return flow;
}
} ED;
int n;
int cnt[maxn];
int ID[maxn];
string s;
int id() {
cin >> s;
if (s == "S") return 7;
if (s == "M") return 8;
if (s == "L") return 9;
if (s == "XL") return 10;
if (s == "XXL") return 11;
if (s == "XXXL") return 12;
if (s == "S,M") return 13;
if (s == "M,L") return 14;
if (s == "L,XL") return 15;
if (s == "XL,XXL") return 16;
if (s == "XXL,XXXL") return 17;
assert(1);
}
void print(int x) {
if (x == 7)
puts("S");
else if (x == 8)
puts("M");
else if (x == 9)
puts("L");
else if (x == 10)
puts("XL");
else if (x == 11)
puts("XXL");
else if (x == 12)
puts("XXXL");
else if (num[x][0]) {
num[x][0]--;
print(x - 6);
} else
print(x - 5);
}
int main() {
ED.init(19);
int tp;
for (int i = 0; i < 6; i++) {
scanf("%d", &tp);
ED.AddEdge(0, i + 1, tp);
}
scanf("%d", &n);
for (int i = 0; i < n; i++) cnt[ID[i] = id()]++;
for (int i = 7; i <= 17; i++)
if (cnt[i]) {
ED.AddEdge(i, 18, cnt[i]);
if (i >= 13) {
ED.AddEdge(i - 12, i, n);
ED.AddEdge(i - 11, i, n);
} else
ED.AddEdge(i - 6, i, n);
}
int flow = ED.Maxflow(0, 18);
if (flow != n)
puts("NO");
else {
puts("YES");
for (int i = 0; i < n; i++) print(ID[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int nS, nM, nL, nXL, nXXL, nXXXL, m,
mS = 0, mM = 0, mL = 0, mXL = 0, mXXL = 0, mXXXL = 0, mS2 = 0, mM2 = 0,
mL2 = 0, mXL2 = 0, mXXL2 = 0;
cin >> nS >> nM >> nL >> nXL >> nXXL >> nXXXL;
cin >> m;
string s;
int X[m][2];
for (int i = 0; i < m; ++i) {
cin >> s;
if (s == "S") {
mS++;
X[i][0] = 1;
X[i][1] = 1;
}
if (s == "M") {
mM++;
X[i][0] = 2;
X[i][1] = 2;
}
if (s == "L") {
mL++;
X[i][0] = 3;
X[i][1] = 3;
}
if (s == "XL") {
mXL++;
X[i][0] = 4;
X[i][1] = 4;
}
if (s == "XXL") {
mXXL++;
X[i][0] = 5;
X[i][1] = 5;
}
if (s == "XXXL") {
mXXXL++;
X[i][0] = 6;
X[i][1] = 6;
}
if (s == "S,M") {
mS2++;
X[i][0] = 7;
X[i][1] = 0;
}
if (s == "M,L") {
mM2++;
X[i][0] = 8;
X[i][1] = 0;
}
if (s == "L,XL") {
X[i][0] = 9;
X[i][1] = 0;
mL2++;
}
if (s == "XL,XXL") {
X[i][0] = 10;
X[i][1] = 0;
mXL2++;
}
if (s == "XXL,XXXL") {
X[i][0] = 11;
X[i][1] = 0;
mXXL2++;
}
}
nS -= mS;
nM -= mM;
nL -= mL;
nXL -= mXL;
nXXL -= mXXL;
nXXXL -= mXXXL;
for (int i = 0; i < m && nS > 0; ++i) {
if (X[i][0] == 7 && X[i][1] == 0) {
X[i][1] = 1;
nS--;
}
}
for (int i = 0; i < m && nM > 0; ++i) {
if (X[i][0] == 7 && X[i][1] == 0) {
X[i][1] = 2;
nM--;
}
}
for (int i = 0; i < m && nM > 0; ++i) {
if (X[i][0] == 8 && X[i][1] == 0) {
X[i][1] = 2;
nM--;
}
}
for (int i = 0; i < m && nL > 0; ++i) {
if (X[i][0] == 8 && X[i][1] == 0) {
X[i][1] = 3;
nL--;
}
}
for (int i = 0; i < m && nL > 0; ++i) {
if (X[i][0] == 9 && X[i][1] == 0) {
X[i][1] = 3;
nL--;
}
}
for (int i = 0; i < m && nXL > 0; ++i) {
if (X[i][0] == 9 && X[i][1] == 0) {
X[i][1] = 4;
nXL--;
}
}
for (int i = 0; i < m && nXL > 0; ++i) {
if (X[i][0] == 10 && X[i][1] == 0) {
X[i][1] = 4;
nXL--;
}
}
for (int i = 0; i < m && nXXL > 0; ++i) {
if (X[i][0] == 10 && X[i][1] == 0) {
X[i][1] = 5;
nXXL--;
}
}
for (int i = 0; i < m && nXXL > 0; ++i) {
if (X[i][0] == 11 && X[i][1] == 0) {
X[i][1] = 5;
nXXL--;
}
}
for (int i = 0; i < m && nXXXL > 0; ++i) {
if (X[i][0] == 11 && X[i][1] == 0) {
X[i][1] = 6;
nXXXL--;
}
}
for (int i = 0; i < m; ++i) {
if (X[i][1] == 0) {
cout << "NO";
return 0;
}
}
if (nS < 0 || nM < 0 || nL < 0 || nXL < 0 || nXXL < 0 || nXXXL < 0) {
cout << "NO";
return 0;
}
cout << "YES\n";
string W[7] = {"", "S", "M", "L", "XL", "XXL", "XXXL"};
for (int i = 0; i < m; ++i) {
cout << W[X[i][1]] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int get_size(string a) {
if (a == "S") {
return 0;
}
if (a == "M") {
return 1;
}
return a.size() + 1;
}
pair<int, int> get_size() {
pair<int, int> a = make_pair(-1, -1);
string second;
cin >> second;
int n = second.size();
string v = "";
for (int i = 0; i < n; ++i) {
if (second[i] == ',') {
a.first = get_size(v);
a.second = a.first + 1;
break;
}
v += second[i];
}
a.first = get_size(v);
return a;
}
string get_name(int a) {
if (a == 0) {
return "S";
}
if (a == 1) {
return "M";
}
if (a == 2) {
return "L";
}
if (a == 3) {
return "XL";
}
if (a == 4) {
return "XXL";
}
return "XXXL";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
int a[6];
for (int i = 0; i < 6; ++i) {
cin >> a[i];
}
cin >> n;
vector<pair<pair<int, int>, int> > name(n);
for (int i = 0; i < n; ++i) {
auto hh = get_size();
name[i] = make_pair(hh, i);
}
sort(name.begin(), name.end());
vector<int> ans(n);
for (int i = 0; i < n; ++i) {
auto z = name[i];
auto second = z.first;
if (a[second.first] > 0) {
--a[second.first];
ans[z.second] = second.first;
} else {
if (second.second != -1 && a[second.second] > 0) {
--a[second.second];
ans[z.second] = second.second;
} else {
cout << "NO";
return 0;
}
}
}
cout << "YES\n";
for (int i = 0; i < n; ++i) {
cout << get_name(ans[i]) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int s, t;
struct Edge {
int from, to, next;
int cap, flow;
void get(int u, int a, int b, int c, int d) {
from = u;
to = a;
next = b;
cap = c;
flow = d;
}
} edge[100050 << 4];
int tol;
int head[100050];
int gap[100050], dep[100050], pre[100050], cur[100050];
void init() {
tol = 0;
memset(head, -1, sizeof head);
}
void add_edge(int u, int v, int w, int rw = 0) {
edge[tol].get(u, v, head[u], w, 0);
head[u] = tol++;
edge[tol].get(v, u, head[v], rw, 0);
head[v] = tol++;
}
int sap(int start, int end, int N) {
memset(gap, 0, sizeof gap);
memset(dep, 0, sizeof dep);
memcpy(cur, head, sizeof head);
int u = start;
pre[u] = -1;
gap[0] = N;
int ans = 0;
while (dep[start] < N) {
if (u == end) {
int Min = 1e7;
for (int i = pre[u]; i != -1; i = pre[edge[i ^ 1].to])
if (Min > edge[i].cap - edge[i].flow) Min = edge[i].cap - edge[i].flow;
for (int i = pre[u]; i != -1; i = pre[edge[i ^ 1].to]) {
edge[i].flow += Min;
edge[i ^ 1].flow -= Min;
}
u = start;
ans += Min;
continue;
}
bool flag = false;
int v;
for (int i = cur[u]; i != -1; i = edge[i].next) {
v = edge[i].to;
if (edge[i].cap - edge[i].flow && dep[v] + 1 == dep[u]) {
flag = true;
cur[u] = pre[v] = i;
break;
}
}
if (flag) {
u = v;
continue;
}
int Min = N;
for (int i = head[u]; i != -1; i = edge[i].next)
if (edge[i].cap - edge[i].flow && dep[edge[i].to] < Min) {
Min = dep[edge[i].to];
cur[u] = i;
}
gap[dep[u]]--;
if (!gap[dep[u]]) return ans;
dep[u] = Min + 1;
gap[dep[u]]++;
if (u != start) u = edge[pre[u] ^ 1].to;
}
return ans;
}
int a[11];
char str[100050];
void add(int now) {
int len = strlen(str);
int j;
for (int i = 0; i < len; i = j + 1) {
j = i;
while (str[j] != ',' && str[j] != 0) j++;
if (str[i] == 'S') {
add_edge(now, n + 1, 1);
} else if (str[i] == 'M') {
add_edge(now, n + 2, 1);
} else if (str[i] == 'L') {
add_edge(now, n + 3, 1);
} else {
int more = j - i;
more += 2;
add_edge(now, more + n, 1);
}
}
}
void print(int num) {
num -= n;
if (num == 1) {
cout << "S" << endl;
} else if (num == 2)
cout << "M" << endl;
else if (num == 3)
cout << "L" << endl;
else if (num == 4)
cout << "XL" << endl;
else if (num == 5)
cout << "XXL" << endl;
else
cout << "XXXL" << endl;
}
int main() {
for (int i = 1; i <= 6; i++) {
cin >> a[i];
}
cin >> n;
int N;
s = 0, t = n + 7, N = t + 1;
init();
for (int i = 1; i <= 6; i++) {
add_edge(n + i, t, a[i]);
}
for (int i = 1; i <= n; i++) {
cin >> str;
add_edge(s, i, 1);
add(i);
}
int ans = sap(s, t, N);
if (ans != n) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
for (int u = 1; u <= n; u++) {
for (int i = head[u]; i != -1; i = edge[i].next) {
int v = edge[i].to;
if (v > n && v <= n + 6 && edge[i].flow) {
print(v);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> vec_splitter(string s) {
for (char& c : s) c = c == ',' ? ' ' : c;
stringstream ss;
ss << s;
vector<string> res;
for (string z; ss >> z; res.push_back(z))
;
return res;
}
void debug_out(vector<string> args, int idx) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, Head H, Tail... T) {
if (idx > 0) cerr << ", ";
stringstream ss;
ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, T...);
}
void localTest() {}
const long long N = 1e5 + 5;
vector<string> V[N];
vector<string> ts = {"S", "M", "L", "XL", "XXL", "XXXL"};
map<string, long long> tidx;
map<long long, string> ans;
int main() {
localTest();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long cnt = 0;
for (auto u : ts) tidx[u] = cnt++;
vector<long long> tcnt(6, 0);
for (long long i = 0; i <= 5; ++i) cin >> tcnt[i];
long long n;
cin >> n;
for (long long i = 1; i <= n; ++i) {
string s, aux = "";
cin >> s;
for (auto u : s) {
if (u == ',')
V[i].push_back(aux), aux = "";
else
aux += u;
}
V[i].push_back(aux);
long long sz = V[i].size(), idx = tidx[V[i][0]];
if (sz == 1) tcnt[idx]--, ans[i] = ts[idx];
}
for (long long t = 0; t <= 5; ++t) {
for (long long i = 1; i <= n; ++i) {
if (ans.find(i) != ans.end()) continue;
string fi = V[i][0], se = V[i][1];
if (fi == ts[t]) {
if (tcnt[t] > 0) {
ans[i] = ts[t];
tcnt[t]--;
} else if (tcnt[tidx[se]] > 0) {
ans[i] = ts[tidx[se]];
tcnt[tidx[se]]--;
} else {
cout << "NO\n";
return 0;
}
}
}
}
long long fl = 1;
for (long long i = 0; i <= 5; ++i)
if (tcnt[i] < 0) fl = 0;
if (!fl)
cout << "NO\n";
else {
cout << "YES\n";
for (long long i = 1; i <= n; ++i) cout << ans[i] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
vector<int> avail(6);
for (auto &i : avail) cin >> i;
map<string, int> mp;
map<int, string> rmp;
rmp[0] = "S";
rmp[1] = "M";
rmp[2] = "L";
rmp[3] = "XL";
rmp[4] = "XXL";
rmp[5] = "XXXL";
mp["S"] = 0;
mp["M"] = 1;
mp["L"] = 2;
mp["XL"] = 3;
mp["XXL"] = 4;
mp["XXXL"] = 5;
long long n;
cin >> n;
vector<pair<int, pair<int, int>>> in;
vector<int> ans(n);
for (int i = 0; i < n; i++) {
string c;
cin >> c;
int t = c.size();
string a = "", b = "";
bool one = true;
for (int j = 0; j < t; j++) {
if (c[j] == ',') {
one = false;
continue;
}
if (one) {
a += c[j];
} else {
b += c[j];
}
}
int x = mp[a];
int y = 100;
if (!one) {
y = mp[b];
in.push_back({x, {y, i}});
} else {
in.push_back({100, {100, i}});
if (!avail[x]) {
cout << "NO";
return 0;
} else {
ans[i] = x;
avail[x]--;
}
}
}
sort(in.begin(), in.end());
for (int j = 0; j < n; j++) {
if (in[j].first == 100) {
break;
}
int i = in[j].second.second;
int x = in[j].first;
int y = in[j].second.first;
if (avail[x]) {
ans[i] = x;
avail[x]--;
continue;
}
if (avail[y]) {
ans[i] = y;
avail[y]--;
continue;
}
cout << "NO";
return 0;
}
cout << "YES" << endl;
for (auto i : ans) cout << rmp[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int large[5];
map<string, int> toint;
string tostr[6];
int main() {
ios::sync_with_stdio(false);
toint["S"] = 0;
toint["M"] = 1;
toint["L"] = 2;
toint["XL"] = 3;
toint["XXL"] = 4;
toint["XXXL"] = 5;
toint["S,M"] = 6;
toint["M,L"] = 7;
toint["L,XL"] = 8;
toint["XL,XXL"] = 9;
toint["XXL,XXXL"] = 10;
tostr[0] = "S";
tostr[1] = "M";
tostr[2] = "L";
tostr[3] = "XL";
tostr[4] = "XXL";
tostr[5] = "XXXL";
int sizes[6];
cin >> sizes[0] >> sizes[1] >> sizes[2] >> sizes[3] >> sizes[4] >> sizes[5];
int n = 0;
cin >> n;
int type[n];
for (int i = 0; i < n; ++i) {
type[i] = -1;
}
for (int i = 0; i < n; ++i) {
string s;
string a = "-", b = "-";
cin >> s;
int temp = toint[s];
type[i] = temp;
if (temp > 5) {
++large[temp - 6];
} else {
--sizes[temp];
}
}
int numbers[10];
for (int i = 0; i < 10; ++i) {
numbers[i] = -1;
}
numbers[9] = sizes[5];
large[4] -= min(sizes[5], large[4]);
numbers[8] = large[4];
numbers[7] = sizes[4];
sizes[4] -= large[4];
large[3] -= min(sizes[4], large[3]);
if (sizes[4] < 0) {
cout << "NO\n";
return 0;
}
numbers[6] = large[3];
numbers[5] = sizes[3];
sizes[3] -= large[3];
large[2] -= min(sizes[3], large[2]);
if (sizes[3] < 0) {
cout << "NO\n";
return 0;
}
numbers[4] = large[2];
numbers[3] = sizes[2];
sizes[2] -= large[2];
large[1] -= min(sizes[2], large[1]);
if (sizes[2] < 0) {
cout << "NO\n";
return 0;
}
numbers[2] = large[1];
numbers[1] = sizes[1];
sizes[1] -= large[1];
large[0] -= min(sizes[1], large[0]);
if (sizes[1] < 0) {
cout << "NO\n";
return 0;
}
numbers[0] = large[0];
sizes[0] -= large[0];
if (sizes[0] < 0) {
cout << "NO\n";
} else {
cout << "YES\n";
for (int i = 0; i < n; ++i) {
if (type[i] < 6) {
cout << tostr[type[i]] << "\n";
} else {
if (numbers[(type[i] - 6) * 2] != 0) {
numbers[(type[i] - 6) * 2]--;
cout << tostr[type[i] - 6] << "\n";
} else {
numbers[(type[i] - 6) * 2 + 1]--;
cout << tostr[type[i] - 5] << "\n";
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int numb(string s) {
if (s == "S") return 0;
if (s == "M") return 1;
if (s == "L") return 2;
if (s == "XL") return 3;
if (s == "XXL") return 4;
return 5;
}
int main() {
std::ios::sync_with_stdio(false);
int *d = new int[6];
int *dd = new int[6];
int *a = new int[6];
for (int i = 0; i < 6; ++i) {
cin >> d[i];
a[i] = 0;
}
string *e = new string[6];
e[0] = "S";
e[1] = "M";
e[2] = "L";
e[3] = "XL";
e[4] = "XXL";
e[5] = "XXXL";
int n;
cin >> n;
string *ans = new string[n];
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
bool f = true;
for (int j = 0; j < s.length() && f; ++j) {
if (s[j] == ',') {
f = false;
int q = numb(s.substr(0, j));
a[q]++;
ans[i] = "!" + s.substr(0, j);
}
}
if (f) {
ans[i] = s;
int q = numb(s);
d[q]--;
if (d[q] < 0) {
cout << "NO";
return 0;
}
}
}
for (int i = 0; i < 6; ++i) {
dd[i] = d[i];
}
for (int i = 0; i < 6; ++i) {
if (a[i] > dd[i]) {
if (i < 5) {
dd[i + 1] -= a[i] - dd[i];
if (dd[i + 1] < 0) {
cout << "NO";
return 0;
}
} else {
cout << "NO";
return 0;
}
}
}
cout << "YES" << endl;
for (int i = 0; i < n; ++i) {
if (ans[i][0] == '!') {
int q = numb(ans[i].substr(1));
if (dd[q] > 0) {
ans[i] = ans[i].substr(1);
--dd[q];
}
}
}
for (int i = 0; i < n; ++i) {
if (ans[i][0] == '!') {
int q = numb(ans[i].substr(1));
ans[i] = e[q + 1];
}
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string sz[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int ans[111111];
int n;
int cnt[11];
int id[111111];
map<string, int> mp;
int id1[111111], id2[111111];
void init() {
mp["S"] = 0;
mp["M"] = 1;
mp["L"] = 2;
mp["XL"] = 3;
mp["XXL"] = 4;
mp["XXXL"] = 5;
}
void go(string s, int dd) {
string s1 = s, s2 = "";
for (int i = 0; i < (int)s.size(); ++i) {
if (s[i] == ',') {
s1 = s.substr(0, i);
s2 = s.substr(i + 1, (int)s.size() - i - 1);
}
}
id1[dd] = mp[s1];
if (s2 != "") id2[dd] = mp[s2];
}
bool cmp(int i, int j) { return id1[i] < id1[j]; }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
for (int i = 0; i < 6; ++i) {
cin >> cnt[i];
}
init();
memset(id2, -1, sizeof id2);
cin >> n;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
go(s, i);
if (id2[i] == -1) {
if (cnt[id1[i]] == 0) {
cout << "NO";
return 0;
}
cnt[id1[i]]--;
ans[i] = id1[i];
}
id[i] = i;
}
sort(id, id + n, cmp);
for (int i = 0; i < n; ++i) {
if (id2[id[i]] != -1) {
if (cnt[id1[id[i]]] != 0) {
cnt[id1[id[i]]]--;
ans[id[i]] = id1[id[i]];
} else if (cnt[id2[id[i]]] != 0) {
cnt[id2[id[i]]]--;
ans[id[i]] = id2[id[i]];
} else {
cout << "NO";
return 0;
}
}
}
cout << "YES\n";
for (int i = 0; i < n; ++i) {
cout << sz[ans[i]] + "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int n, m, n2;
int a[N];
int b[10];
map<string, int> mp;
string res[10];
int out[N];
class Dinic {
public:
struct Edge {
int from, to, cap, flow;
Edge(int _from = -1, int _to = -1, int _cap = 0, int _flow = 0)
: from(_from), to(_to), cap(_cap), flow(_flow) {}
};
int n;
vector<vector<int> > g;
vector<vector<int>::iterator> work;
vector<Edge> edges;
vector<int> level;
void init(int _n) {
n = _n;
g.assign(_n, vector<int>());
work.assign(_n, vector<int>::iterator());
edges.clear();
level.resize(_n);
}
void addEdge(int u, int v, int cap, bool twoWay) {
g[u].push_back((int)edges.size());
edges.push_back(Edge(u, v, cap, 0));
g[v].push_back((int)edges.size());
edges.push_back(Edge(v, u, (twoWay == true) ? cap : 0, 0));
}
void resetFlows() {
for (int i = 0; i < (int)edges.size(); ++i) edges[i].flow = 0;
}
bool bfs(int s, int t) {
level = vector<int>(n, -1);
queue<int> q;
q.push(s);
level[s] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
for (__typeof(g[u].begin()) it = g[u].begin(); it != g[u].end(); ++it) {
int e = *it;
int v = edges[e].to;
if (level[v] == -1 && edges[e].flow < edges[e].cap) {
level[v] = level[u] + 1;
q.push(v);
}
}
}
return (level[t] != -1);
}
int dfs(int s, int t, int f) {
if (s == t) return f;
for (vector<int>::iterator &e = work[s]; e != g[s].end(); ++e) {
int v = edges[*e].to;
if (level[v] == level[s] + 1 && edges[*e].flow < edges[*e].cap) {
int d = dfs(v, t, min(f, edges[*e].cap - edges[*e].flow));
if (d > 0) {
edges[*e].flow += d;
edges[*e ^ 1].flow -= d;
return d;
}
}
}
return 0;
}
int maxFlow(int s, int t) {
int ret = 0;
while (bfs(s, t)) {
for (int i = 0; i < n; ++i) work[i] = g[i].begin();
for (int d; (d = dfs(s, t, numeric_limits<int>::max())) != 0; ret += d)
;
}
return ret;
}
void solve(int s, int t) {
int value = maxFlow(s, t);
if (value != n2) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
for (int i = 0; i < (int)edges.size(); ++i) {
int u = edges[i].from;
int v = edges[i].to;
int flow = edges[i].flow;
if (1 <= u && u <= 6 && 6 < v && v <= 6 + n2 && flow > 0) {
out[v - 7] = u;
}
}
for (int i = 0; i < n2; ++i) cout << res[out[i]] << "\n";
}
}
} netWork;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (int i = 0; i < 6; ++i) cin >> b[i];
mp["S"] = 1;
res[1] = "S";
mp["M"] = 2;
res[2] = "M";
mp["L"] = 3;
res[3] = "L";
mp["XL"] = 4;
res[4] = "XL";
mp["XXL"] = 5;
res[5] = "XXL";
mp["XXXL"] = 6;
res[6] = "XXXL";
cin >> n;
n2 = n;
int s = 0, t = 6 + n + 1;
netWork.init(t + 1);
for (int i = 1; i <= 6; ++i) {
netWork.addEdge(s, i, b[i - 1], false);
}
for (int i = 0; i < n; ++i) {
string s, tt;
cin >> s;
tt.clear();
int j = 0;
for (; j < int(s.size()) && s[j] != ','; ++j) {
tt.push_back(s[j]);
}
netWork.addEdge(mp[tt], 6 + i + 1, 1, false);
if (j < int(s.size())) {
tt.clear();
j++;
for (; j < int(s.size()); ++j) tt.push_back(s[j]);
netWork.addEdge(mp[tt], 6 + i + 1, 1, false);
}
netWork.addEdge(6 + i + 1, t, 1, false);
}
netWork.solve(s, t);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f, mod = 1000000007;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double pi = acosl(-1.), eps = 1e-9;
inline int power(int a, int b, int m = mod, int ans = 1) {
for (; b; b >>= 1, a = 1LL * a * a % m)
if (b & 1) ans = 1LL * ans * a % m;
return ans;
}
const int NN = 100010;
int c[10];
char s[100];
int calc(char *s) {
int n = strlen(s);
if (n == 1) {
if (s[0] == 'S')
return 0;
else if (s[0] == 'M')
return 1;
else
return 2;
} else
return n + 1;
}
int ans[NN];
void print(int i) {
if (!i)
puts("S");
else if (i == 1)
puts("M");
else if (i == 2)
puts("L");
else if (i == 3)
puts("XL");
else if (i == 4)
puts("XXL");
else
puts("XXXL");
}
int main() {
vector<int> v[6], t[7];
for (int i = 0; i < 6; i++) scanf("%d", c + i);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%s", s);
int r = strlen(s);
int cnt = 0;
int pos;
for (int j = 0; j < r; j++) {
if (s[j] == ',') {
cnt = 1;
pos = j;
break;
}
}
if (cnt) {
s[pos] = 0;
t[calc(s)].push_back(i);
} else {
v[ans[i] = calc(s)].push_back(i);
}
}
for (int i = 0; i < 6; i++) {
if (c[i] < v[i].size()) {
puts("NO");
return 0;
} else
c[i] -= v[i].size();
}
for (int i = 0; i < 6; i++) {
if (c[i] >= t[i].size()) {
for (auto d : t[i]) ans[d] = i;
continue;
} else {
if (c[i + 1] + c[i] < t[i].size()) {
puts("NO");
return 0;
}
while (c[i]) {
int r = t[i].back();
ans[r] = i;
t[i].pop_back();
c[i]--;
}
c[i + 1] -= t[i].size();
for (auto d : t[i]) ans[d] = i + 1;
}
}
puts("YES");
for (int i = 1; i <= n; i++) print(ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
int t = 1;
while (t--) {
solve();
}
return 0;
}
namespace input {
inline int nextInt() {
int res = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') res = res * 10 + c - '0', c = getchar();
return res;
}
inline long long nextLong() {
long long res = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') res = res * 10 + c - '0', c = getchar();
return res;
}
inline bool isSpace(const char &c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
inline void next(char *str) {
char c = getchar();
while (isSpace(c)) c = getchar();
size_t head = 0;
while (!isSpace(c)) str[head++] = c, c = getchar();
str[head] = 0;
}
inline char nextChar() {
char c = getchar();
while (isSpace(c)) c = getchar();
return c;
}
} // namespace input
using namespace input;
const int N = 2e5 + 5;
int n;
int t[N];
int cnt[100];
char buf[N];
int q[N];
int w[N];
int ans[N];
vector<int> b[100];
vector<int> o[100];
vector<string> fs = {"S", "M", "L", "XL", "XXL", "XXXL"};
void bad() {
puts("NO");
exit(0);
}
void solve() {
for (int i = 0; i < 6; i++) {
scanf("%d", cnt + i);
}
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", buf);
string temp = buf;
string a = "";
int j = 0;
for (; j < temp.size() && temp[j] != ','; j++) {
a += temp[j];
}
for (int k = 0; k < fs.size(); k++) {
if (fs[k] == a) {
q[i] = k;
if (j != temp.size()) {
w[i] = 1;
b[k].push_back(i);
} else {
o[k].push_back(i);
}
}
}
}
for (int t = 0; t < 6; t++) {
for (int i = 0; i < o[t].size(); i++) {
ans[o[t][i]] = t;
cnt[t]--;
}
if (cnt[t] < 0) {
bad();
}
int i = 0;
for (; cnt[t] && i < b[t].size(); i++) {
ans[b[t][i]] = t;
cnt[t]--;
}
if (i != b[t].size()) {
for (; i < b[t].size(); i++) {
o[t + 1].push_back(b[t][i]);
}
}
}
puts("YES");
for (int i = 0; i < n; i++) {
printf("%s\n", fs[ans[i]].c_str());
}
}
|
#include <bits/stdc++.h>
using namespace std;
int num[8], pref[100002], ans[100002], cntpref[7];
int n;
char s[10];
int main() {
for (int i = 1; i <= 5; i++) {
scanf("%d ", &num[i]);
}
scanf("%d\n", &num[6]);
scanf("%d\n", &n);
for (int i = 1; i <= n; i++) {
cin.getline(s, 10);
int len = strlen(s);
bool twosize = false;
for (int j = 0; j < len; j++) {
if (s[j] == ',') twosize = true;
}
if (twosize) {
if (s[0] == 'S') {
pref[i] = 1;
cntpref[1]++;
} else if (s[0] == 'M') {
pref[i] = 2;
cntpref[2]++;
} else if (s[0] == 'L') {
pref[i] = 3;
cntpref[3]++;
} else if (s[2] == ',') {
pref[i] = 4;
cntpref[4]++;
} else if (s[3] == ',') {
pref[i] = 5;
cntpref[5]++;
}
} else {
if (s[0] == 'S') {
num[1]--;
ans[i] = 1;
} else if (s[0] == 'M') {
num[2]--;
ans[i] = 2;
} else if (s[0] == 'L') {
num[3]--;
ans[i] = 3;
} else if (s[1] == 'L') {
num[4]--;
ans[i] = 4;
} else if (s[2] == 'L') {
num[5]--;
ans[i] = 5;
} else if (s[3] == 'L') {
num[6]--;
ans[i] = 6;
}
}
}
for (int i = 1; i <= 6; i++) {
if (num[i] < 0) {
printf("NO\n");
return 0;
}
}
for (int i = 1; i <= 5; i++) {
if (num[i] + num[i + 1] < cntpref[i]) {
printf("NO\n");
return 0;
}
if (num[i] >= cntpref[i]) {
num[i] -= cntpref[i];
cntpref[i] = 0;
for (int j = 1; j <= n; j++) {
if (pref[j] == i) ans[j] = i;
}
} else {
int temp = 0, j = 1;
while (temp < num[i]) {
if (pref[j] == i) {
ans[j] = i;
temp++;
}
j++;
}
cntpref[i] -= num[i];
num[i] = 0;
while (j <= n) {
if (pref[j] == i) {
ans[j] = i + 1;
}
j++;
}
num[i + 1] -= cntpref[i];
cntpref[i] = 0;
}
}
printf("YES\n");
for (int i = 1; i <= n; i++) {
if (ans[i] == 1)
printf("S\n");
else if (ans[i] == 2)
printf("M\n");
else if (ans[i] == 3)
printf("L\n");
else if (ans[i] == 4)
printf("XL\n");
else if (ans[i] == 5)
printf("XXL\n");
else
printf("XXXL\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int num(string s) {
if (s == "S") return 0;
if (s == "M") return 1;
if (s == "L") return 2;
if (s == "XL") return 3;
if (s == "XXL") return 4;
if (s == "XXXL") return 5;
return -1;
}
string st(int nv) {
if (nv == 0) return "S";
if (nv == 1) return "M";
if (nv == 2) return "L";
if (nv == 3) return "XL";
if (nv == 4) return "XXL";
if (nv == 5) return "XXXL";
return "";
}
struct FlowEdge {
int v, u;
long long cap, flow = 0;
FlowEdge(int v, int u, long long cap) : v(v), u(u), cap(cap) {}
};
struct Dinic {
const long long flow_inf = 1e18;
vector<FlowEdge> edges;
vector<vector<int>> adj;
int n, m = 0;
int s, t;
vector<int> level, ptr;
queue<int> q;
Dinic(int n, int s, int t) : n(n), s(s), t(t) {
adj.resize(n);
level.resize(n);
ptr.resize(n);
}
void add_edge(int v, int u, long long cap) {
edges.emplace_back(v, u, cap);
edges.emplace_back(u, v, 0);
adj[v].push_back(m);
adj[u].push_back(m + 1);
m += 2;
}
bool bfs() {
while (!q.empty()) {
int v = q.front();
q.pop();
for (int id : adj[v]) {
if (edges[id].cap - edges[id].flow < 1) continue;
if (level[edges[id].u] != -1) continue;
level[edges[id].u] = level[v] + 1;
q.push(edges[id].u);
}
}
return level[t] != -1;
}
long long dfs(int v, long long pushed) {
if (pushed == 0) return 0;
if (v == t) return pushed;
for (int &cid = ptr[v]; cid < (int)adj[v].size(); cid++) {
int id = adj[v][cid];
int u = edges[id].u;
if (level[v] + 1 != level[u] || edges[id].cap - edges[id].flow < 1)
continue;
long long tr = dfs(u, min(pushed, edges[id].cap - edges[id].flow));
if (tr == 0) continue;
edges[id].flow += tr;
edges[id ^ 1].flow -= tr;
return tr;
}
return 0;
}
long long flow() {
long long f = 0;
while (true) {
fill(level.begin(), level.end(), -1);
level[s] = 0;
q.push(s);
if (!bfs()) break;
fill(ptr.begin(), ptr.end(), 0);
while (long long pushed = dfs(s, flow_inf)) {
f += pushed;
}
}
return f;
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
vector<int> cnt(6, 0);
for (int i = 0; i < 6; i++) {
cin >> cnt[i];
}
int nn;
cin >> nn;
vector<vector<string>> vv;
for (int i = 0; i < nn; i++) {
string k;
cin >> k;
vector<string> v;
string t = "";
for (int j = 0; j < k.length(); j++) {
if (k[j] == ',') {
v.push_back(t);
t = "";
} else {
t += k[j];
}
}
v.push_back(t);
vv.push_back(v);
}
vector<string> ans(nn, "");
Dinic d(10 * nn, 10 * nn - 2, 10 * nn - 1);
for (int i = 0; i < nn; i++) {
d.add_edge(10 * nn - 2, i, 1);
for (auto &x : vv[i]) {
d.add_edge(i, nn + num(x), 1);
}
}
for (int i = nn; i < nn + 6; i++) {
d.add_edge(i, 10 * nn - 1, cnt[i - nn]);
}
int x = d.flow();
if (x != nn) {
cout << "NO\n";
exit(0);
}
for (auto &e : d.edges) {
if (e.v < nn && e.flow == 1) {
ans[e.v] = st(e.u - nn);
}
}
cout << "YES\n";
for (auto &s : ans) {
cout << s << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
const long double EPS = 1e-10;
const long long int MOD = 1000000007ll;
const long long int mod1 = 1000000009ll;
const long long int mod2 = 1100000009ll;
int INF = (int)1e9;
long long int INFINF = (long long int)1e18;
int debug = 0;
using namespace std;
long long int bit_count(long long int _x) {
long long int _ret = 0;
while (_x) {
if (_x % 2 == 1) _ret++;
_x /= 2;
}
return _ret;
}
long long int bit(long long int _mask, long long int _i) {
return (_mask & (1 << _i)) == 0 ? 0 : 1;
}
long long int powermod(long long int _a, long long int _b,
long long int _m = MOD) {
long long int _r = 1;
while (_b) {
if (_b % 2 == 1) _r = (_r * _a) % _m;
_b /= 2;
_a = (_a * _a) % _m;
}
return _r;
}
long long int add(long long int a, long long int b, long long int m = MOD) {
long long int x = a + b;
while (x >= m) x -= m;
return x;
}
long long int sub(long long int a, long long int b, long long int m = MOD) {
long long int x = a - b;
while (x < 0) x += m;
return x;
}
long long int mul(long long int a, long long int b, long long int m = MOD) {
long long int x = a * 1ll * b;
x %= m;
if (x < m) x += m;
return x;
}
int n;
map<string, int> Map;
string rMap[10];
int a[10];
char tempssss[100];
string ans[100010];
vector<int> b[10];
bool rem[100010];
bool comma(string s) {
for (char c : s)
if (c == ',') return true;
return false;
}
int main() {
if (0) {
freopen("input.txt", "r", stdin);
debug = 1;
}
srand(time(NULL));
Map["S"] = 1;
rMap[1] = "S";
Map["M"] = 2;
rMap[2] = "M";
Map["L"] = 3;
rMap[3] = "L";
Map["XL"] = 4;
rMap[4] = "XL";
Map["XXL"] = 5;
rMap[5] = "XXL";
Map["XXXL"] = 6;
rMap[6] = "XXXL";
for (int i = 1; i <= 6; i++) scanf("%d", &a[i]);
scanf("%d", &n);
for (int tttt = 1; tttt <= n; tttt++) {
string s;
scanf("%s", tempssss);
;
s = tempssss;
if (comma(s)) {
string s1 = "", s2 = "";
int i;
for (i = 0; i < s.size(); i++) {
if (s[i] == ',') break;
s1 += s[i];
}
i++;
for (; i < s.size(); i++) s2 += s[i];
b[Map[s1]].push_back(tttt);
} else {
int m = Map[s];
if (a[m] == 0) {
cout << "NO";
return 0;
}
a[m]--;
ans[tttt] = s;
}
}
for (int i = 1; i <= 5; i++) {
for (int j : b[i]) {
if (a[i] == 0) {
if (a[i + 1] == 0) {
cout << "NO";
return 0;
} else {
a[i + 1]--;
ans[j] = rMap[i + 1];
}
} else {
a[i]--;
ans[j] = rMap[i];
}
}
}
cout << "YES\n";
for (int i = 1; i <= n; i++) cout << ans[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Mx = 1e5 + 5;
int A[10], B[Mx], ans[Mx], N, M, nc;
int razmer(char *ch) {
if (ch[0] == 'S') return 1;
if (ch[0] == 'M') return 2;
if (ch[0] == 'L') return 3;
if (ch[1] == 'L') return 4;
if (ch[2] == 'L') return 5;
return 6;
}
char tab[6][5] = {"S", "M", "L", "XL", "XXL", "XXXL"};
struct P {
int x, id;
bool operator<(const P &p) const { return x < p.x; }
} C[Mx];
int solve() {
if (M < N) return 0;
sort(C, C + nc);
for (int i = 1; i <= 6; ++i)
if (A[i] < 0) return 0;
for (int i = 0; i < nc; ++i) {
int nx = C[i].x;
if (A[nx]) {
A[nx]--;
ans[C[i].id] = nx;
} else if (A[nx + 1]) {
A[nx + 1]--;
ans[C[i].id] = nx + 1;
} else
return 0;
}
return 1;
}
int main() {
for (int i = 1; i <= 6; ++i) cin >> A[i], M += A[i];
scanf("%d\n", &N);
for (int i = 0; i < N; ++i) {
char s[10];
gets(s);
int sz1 = razmer(s), sz2 = 0;
for (int j = 0; s[j]; ++j)
if (s[j] == ',') sz2 = razmer(s + j + 1);
if (!sz2) {
ans[i] = sz1;
A[sz1]--;
} else {
C[nc].x = min(sz1, sz2);
C[nc].id = i;
nc++;
}
}
if (solve()) {
cout << "YES\n";
for (int i = 0; i < N; ++i) cout << tab[ans[i] - 1] << '\n';
} else
cout << "NO";
}
|
#include <bits/stdc++.h>
char S[22][9] = {"S", "S,M", "M", "M,L", "L", "L,XL",
"XL", "XL,XXL", "XXL", "XXL,XXXL", "XXXL"};
unsigned A[22], F[22], Q[111111];
int main() {
unsigned i, j, k, q;
char C[9];
for (i = -2; (i += 2) < 11;) scanf("%u", A + i);
for (i = -1, scanf("%u", &q); ++i < q; ++F[Q[i] = j]) {
for (j = -1, scanf("%s", C); ++j < 11;)
if (!strcmp(C, S[j])) break;
if (j > 10) {
printf("ERROR!\n");
return 0;
}
}
for (i = -2; (i += 2) < 11; F[i + 1] -= j) {
if (A[i] < (k = F[i] + (i ? F[i - 1] : 0))) {
printf("NO\n");
return 0;
}
if ((k = A[i] - k) < (j = F[i + 1])) j = k;
}
for (i = -1, printf("YES\n"); ++i < q; printf("%s\n", S[Q[i]]))
if (Q[i] & 1) {
if (F[Q[i]])
--F[Q[i]++];
else
--Q[i];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 123;
const long long INF = (long long)1e18 + 123;
const int inf = (int)1e9 + 123;
const int MOD = (int)1e9 + 7;
int type(string a) {
if (a == "S") return 1;
if (a == "M") return 2;
if (a == "L") return 3;
if (a == "XL") return 4;
if (a == "XXL") return 5;
if (a == "XXXL") return 6;
return 7;
}
int a[10], n;
string t, name[10] = {"", "S", "M", "L", "XL", "XXL", "XXXL"}, res[N];
set<int> st[10];
vector<pair<int, pair<int, int> > > g;
int main() {
for (int i = 1; i <= 6; i++) cin >> a[i];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> t;
string tmp1 = "", tmp2 = "";
int pos = (int)(t.size());
for (int j = 0; j < (int)(t.size()); j++) {
if (t[j] == ',') {
pos = j + 1;
break;
}
tmp1 += t[j];
}
for (int j = pos; j < (int)(t.size()); j++) tmp2 += t[j];
if (type(tmp2) < type(tmp1)) swap(tmp1, tmp2);
if (type(tmp2) == 7) {
res[i] = tmp1, a[type(tmp1)]--;
continue;
}
g.push_back(make_pair(type(tmp1), make_pair(type(tmp2), i)));
}
sort(g.begin(), g.end());
for (auto i : g) {
if (a[i.first] > 0)
a[i.first]--, res[i.second.second] = name[i.first];
else
a[i.second.first]--, res[i.second.second] = name[i.second.first];
}
for (int i = 1; i <= 6; i++)
if (a[i] < 0) {
puts("NO");
return 0;
}
puts("YES");
for (int i = 1; i <= n; i++) cout << res[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, int> mp;
bool cmp(const pair<string, int> &a, const pair<string, int> &b) {
if (a.first.length() == b.first.length()) {
return a.first > b.first;
}
return a.first < b.first;
}
int main(int argc, char *argv[]) {
cin >> mp["S"] >> mp["M"] >> mp["L"] >> mp["XL"] >> mp["XXL"] >> mp["XXXL"];
int n;
cin >> n;
string mas[n];
vector<pair<string, int> > v;
for (int i = 0; i < n; ++i) {
string str;
cin >> str;
bool d = true;
for (int j = 0; j < str.length(); ++j) {
if (str[j] == ',') {
d = false;
}
}
if (d) {
mp[str]--;
mas[i] = str;
if (mp[str] < 0) {
cout << "NO";
return 0;
}
} else {
int j;
string s_1, s_2;
for (j = 0; str[j] != ','; ++j) {
s_1 += str[j];
}
j++;
for (; j < str.length(); ++j) {
s_2 += str[j];
}
if (!mp[s_1] && !mp[s_2]) {
cout << "NO";
return 0;
}
if (!mp[s_1] && mp[s_2]) {
mp[s_2]--;
mas[i] = s_2;
} else if (mp[s_1] && !mp[s_2]) {
mp[s_1]--;
mas[i] = s_1;
} else if (mp[s_1] && mp[s_2]) {
v.push_back(make_pair(s_1, i));
}
}
}
sort(v.begin(), v.end(), cmp);
for (int i = 0; i < v.size(); ++i) {
if (mp[v[i].first]) {
mas[v[i].second] = v[i].first;
mp[v[i].first]--;
} else {
if (v[i].first == "S") {
mp["M"]--;
mas[v[i].second] = "M";
if (mp["M"] < 0) {
cout << "NO";
return 0;
}
} else if (v[i].first == "M") {
mp["L"]--;
mas[v[i].second] = "L";
if (mp["L"] < 0) {
cout << "NO";
return 0;
}
} else if (v[i].first == "L") {
mp["XL"]--;
mas[v[i].second] = "XL";
if (mp["XL"] < 0) {
cout << "NO";
return 0;
}
} else if (v[i].first == "XL") {
mp["XXL"]--;
mas[v[i].second] = "XXL";
if (mp["XXL"] < 0) {
cout << "NO";
return 0;
}
} else if (v[i].first == "XXL") {
mp["XXXL"]--;
mas[v[i].second] = "XXXL";
if (mp["XXXL"] < 0) {
cout << "NO";
return 0;
}
}
}
}
cout << "YES" << endl;
for (int i = 0; i < n; ++i) {
cout << mas[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[6];
string res[100005];
map<string, int> mymap;
vector<int> Split(const string &s) {
vector<int> res;
string tmp;
for (char x : s) {
if (x == ',')
res.push_back(mymap[tmp]), tmp = "";
else
tmp.push_back(x);
}
res.push_back(mymap[tmp]);
return res;
}
int main() {
iostream::sync_with_stdio(false);
cin.tie(0);
int n;
for (int i = 0; i <= 5; ++i) cin >> cnt[i];
mymap["S"] = 0;
mymap["M"] = 1;
mymap["L"] = 2;
mymap["XL"] = 3;
mymap["XXL"] = 4;
mymap["XXXL"] = 5;
map<int, string> nani;
for (auto x : mymap) nani[x.second] = x.first;
vector<pair<int, int> > later;
cin >> n;
for (int i = 1; i <= n; ++i) {
string s;
cin >> s;
auto u = Split(s);
if (u.size() == 1) {
--cnt[u[0]];
res[i] = s;
} else
later.push_back({u[0], i});
}
sort(later.begin(), later.end());
for (auto x : later) {
int v = x.first;
assert(v < 5);
if (cnt[v] > 0)
--cnt[v], res[x.second] = nani[v];
else
--cnt[v + 1], res[x.second] = nani[v + 1];
}
for (int i = 0; i <= 5; ++i)
if (cnt[i] < 0) return !(cout << "NO");
cout << "YES\n";
for (int i = 1; i <= n; ++i) cout << res[i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 100;
const long long LINF = 1e18 + 228;
const double DINF = 5e18 + .0;
const int ITER = 300;
const double EPS = 1e-6;
const int MOD = 1000000007;
const long long MAXN = 1e5 + 10;
int cnt[6];
string ans[MAXN];
bool was[MAXN];
pair<string, string> can[MAXN];
int n;
void solve() {
map<string, int> tosz;
tosz["S"] = 0;
tosz["M"] = 1;
tosz["L"] = 2;
tosz["XL"] = 3;
tosz["XXL"] = 4;
tosz["XXXL"] = 5;
for (int i = 0; i < 6; ++i) cin >> cnt[i];
cin >> n;
for (int i = 0; i < n; ++i) {
string in;
cin >> in;
bool df = false;
string left = "", right = "";
for (int i = 0; i < (int)in.length(); ++i) {
if (in[i] == ',') {
df = true;
continue;
}
if (!df)
left += in[i];
else
right += in[i];
}
if (!df) right = "tao";
can[i] = make_pair(left, right);
}
for (int i = 0; i < n; ++i) {
if (can[i].second == "tao") {
if (!cnt[tosz[can[i].first]]) {
cout << "NO";
return;
}
--cnt[tosz[can[i].first]];
ans[i] = can[i].first;
was[i] = true;
}
}
for (int cur = 0; cur < 5; ++cur) {
for (int i = 0; i < n; ++i) {
if (was[i]) continue;
if (tosz[can[i].first] == cur) {
if (cnt[cur]) {
ans[i] = can[i].first;
was[i] = true;
--cnt[cur];
} else if (cnt[cur + 1]) {
was[i] = true;
ans[i] = can[i].second;
--cnt[cur + 1];
} else {
cout << "NO";
return;
}
}
}
}
cout << "YES\n";
for (int i = 0; i < n; ++i) cout << ans[i] << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int getint() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || '9' < ch) {
if (ch == '-') f = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return f * x;
}
string SZ[7] = {"", "S", "M", "L", "XL", "XXL", "XXXL"};
map<string, int> id;
int a[112345][2];
int sum[7];
int need[7];
int can[7];
int res[7];
int ans[112345];
int main() {
for (int i = 1; i <= 6; i++) {
id[SZ[i]] = i;
sum[i] = getint();
}
int n;
scanf("%d", &n);
string s;
for (int i = 1; i <= n; i++) {
cin >> s;
int pos = s.find(',');
if (pos == -1) {
int ind = id[s];
a[i][0] = ind;
need[ind]++;
a[i][1] = 0;
} else {
int ind = id[s.substr(0, pos)];
a[i][0] = ind;
need[ind]++;
can[ind]++;
a[i][1] = 1;
}
}
bool flag = true;
for (int i = 1; i <= 5; i++) {
if (need[i] > sum[i]) {
if (need[i] - can[i] > sum[i]) {
flag = false;
break;
} else {
need[i + 1] += (need[i] - sum[i]);
res[i] = need[i] - sum[i];
need[i] = sum[i];
}
} else
res[i] = 0;
}
if (need[6] > sum[6]) flag = false;
if (flag) {
printf("YES\n");
for (int i = 1; i <= n; i++) {
int ind = a[i][0];
if (a[i][1] && res[ind]) {
cout << SZ[ind + 1] << endl;
res[ind]--;
} else {
cout << SZ[ind] << endl;
}
}
} else
printf("NO\n");
}
|
#include <bits/stdc++.h>
using namespace std;
struct canh {
int v, c, f;
};
int n, m, k, tmp, s, t;
long long ans;
map<string, int> id;
int sl[11], d[(int)(1e5 + 19)], p[(int)(1e5 + 19)];
string st;
char c[10];
vector<int> ke[(int)(1e5 + 19)];
vector<canh> vc;
char *tostr[] = {"", "S", "M", "L", "XL", "XXL", "XXXL"};
void taomap() {
id["S"] = n + 1;
id["M"] = n + 2;
id["L"] = n + 3;
id["XL"] = n + 4;
id["XXL"] = n + 5;
id["XXXL"] = n + 6;
}
void them(int u, int v, int c) {
vc.push_back((canh){v, c, 0});
ke[u].push_back(((int)vc.size() - 1));
vc.push_back((canh){u, 0, 0});
ke[v].push_back(((int)vc.size() - 1));
}
void nhap() {
for (int i = 1; i <= n; i++) {
while (1) {
scanf("%[^,\n]", &c);
int curid = id[c];
them(i, curid, 1);
scanf("%c", &c[0]);
if (c[0] == '\n') break;
}
them(0, i, 1);
}
t = n + 7;
for (int i = 1; i <= 6; i++) them(i + n, t, sl[i]);
}
int bfs() {
memset(d, 0, sizeof d);
memset(p, 0, sizeof p);
queue<int> qu;
qu.push(0);
d[0] = 1;
while ((int)qu.size()) {
int u = qu.front();
qu.pop();
if (u == t) return 1;
for (int i = 0; i <= ((int)ke[u].size() - 1); i++) {
int id = ke[u][i];
int v = vc[id].v;
int c = vc[id].c;
int f = vc[id].f;
if (d[v] == 0 && f < c) {
d[v] = d[u] + 1;
qu.push(v);
}
}
}
return 0;
}
void inkq() {
for (int u = 1; u <= n; u++) {
for (int i = 0; i <= ((int)ke[u].size() - 1); i++) {
int id = ke[u][i];
int v = vc[id].v;
if (vc[id].f > 0 && n + 1 <= v && v <= n + 6) puts(tostr[v - n]);
}
}
}
int dfs(int u, int mi) {
if (u == t) return mi;
for (int i = p[u]; i <= ((int)ke[u].size() - 1); i++) {
int id = ke[u][i];
int v = vc[id].v;
int c = vc[id].c;
int f = vc[id].f;
if (d[v] == d[u] + 1 && f < c) {
int gt = dfs(v, min(mi, c - f));
if (gt > 0) {
vc[id].f += gt;
vc[id ^ 1].f -= gt;
return gt;
}
}
p[u] = i + 1;
}
return 0;
}
int main() {
for (int i = 1; i <= 6; i++) scanf("%d", &sl[i]);
scanf("%d", &n);
taomap();
scanf("\n");
nhap();
while (bfs())
while (int flow = dfs(0, (int)(1e9 + 7))) {
ans += flow;
}
if (ans == n) {
puts("YES");
inkq();
} else
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class cmp {
public:
bool operator()(pair<int, int> a, pair<int, int> b) {
return a.first < b.first;
}
};
int main() {
unordered_map<string, int> sh;
sh["S"] = 0;
sh["M"] = 1;
sh["L"] = 2;
sh["XL"] = 3;
sh["XXL"] = 4;
sh["XXXL"] = 5;
char* strs[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int cnt[6];
for (int i = 0; i < 6; ++i) {
scanf("%d", &cnt[i]);
}
int n;
scanf("%d", &n);
vector<pair<int, int> > inter;
int res[n];
for (int i = 0; i < n; ++i) {
char s[40];
scanf("%s", s);
string str(s);
int dot = -1;
for (int j = 0; j < str.size(); ++j) {
if (str[j] == ',') {
dot = j;
break;
}
}
if (dot == -1) {
int shirt = sh[str];
if (cnt[shirt] == 0) {
printf("NO");
return 0;
}
cnt[shirt]--;
res[i] = shirt;
} else {
string sh1 = string(str.begin(), str.begin() + dot);
string sh2 = string(str.begin() + dot + 1, str.end());
inter.push_back(make_pair(min(sh[sh1], sh[sh2]), i));
}
}
sort(inter.begin(), inter.end(), cmp());
for (int i = 0; i < inter.size(); ++i) {
int shirt = inter[i].first;
if (cnt[shirt] > 0) {
cnt[shirt]--;
res[inter[i].second] = shirt;
} else if (cnt[shirt + 1] > 0) {
cnt[shirt + 1]--;
res[inter[i].second] = shirt + 1;
} else {
printf("NO");
return 0;
}
}
printf("YES\n");
for (int i = 0; i < n; ++i) {
printf("%s\n", strs[res[i]]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename... T>
void rd(T&... args) {
((cin >> args), ...);
}
template <typename... T>
void wr(T... args) {
((cout << args << " "), ...);
cout << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a[6];
for (int i = 0; i < 6; i++) {
cin >> a[i];
}
map<string, int> sti{{"S", 0}, {"M", 1}, {"L", 2},
{"XL", 3}, {"XXL", 4}, {"XXXL", 5}};
int n;
cin >> n;
vector<vector<int>> b(6);
vector<int> ans(n);
for (int i = 0; i < n; i++) {
vector<string> sz;
string s;
cin >> s;
string t;
for (auto c : s) {
if (c == ',') {
sz.push_back(t);
t = "";
} else
t += c;
}
sz.push_back(t);
if (sz.size() == 1) {
a[sti[sz[0]]]--;
ans[i] = sti[sz[0]];
} else
b[sti[sz[0]]].push_back(i);
}
for (int i = 0; i < 6; i++) {
if (a[i] < 0)
return cout << "NO\n", 0;
else {
int x = min<int>(a[i], b[i].size());
for (int j = 0; j < x; j++) ans[b[i][j]] = i;
for (int j = x; j < (int)b[i].size(); j++) {
ans[b[i][j]] = i + 1;
a[i + 1]--;
}
}
}
cout << "YES\n";
for (auto x : ans) {
for (auto [s, v] : sti) {
if (v == x) {
cout << s << '\n';
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
!is_same<T_container, string>::value,
typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
os << '{';
string sep;
for (const T &x : v) os << sep << x, sep = ", ";
return os << '}';
}
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
cerr << ' ' << H;
dbg_out(T...);
}
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
string asignar(int n) {
if (n == 0) return "S";
if (n == 1) return "M";
if (n == 2) return "L";
if (n == 3) return "XL";
if (n == 4) return "XXL";
if (n == 5) return "XXXL";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
vector<int> stock(6);
for (long long i = (0); i < (long long)(6); i++) cin >> stock[i];
int n;
cin >> n;
vector<pair<pair<int, int>, int>> quiero(n);
for (long long j = (0); j < (long long)(n); j++) {
string s;
cin >> s;
string curr = "";
pair<int, int> x = make_pair(-1, -1);
for (long long i = (0); i < (long long)(s.size()); i++) {
if (s[i] != ',') {
curr += s[i];
} else {
if (curr == "S") x.first = 0;
if (curr == "M") x.first = 1;
if (curr == "L") x.first = 2;
if (curr == "XL") x.first = 3;
if (curr == "XXL") x.first = 4;
if (curr == "XXXL") x.first = 5;
curr = "";
}
}
if (curr == "S") x.second = 0;
if (curr == "M") x.second = 1;
if (curr == "L") x.second = 2;
if (curr == "XL") x.second = 3;
if (curr == "XXL") x.second = 4;
if (curr == "XXXL") x.second = 5;
if (x.first == -1) x.first = x.second;
if (x.first > x.second) swap(x.first, x.second);
quiero[j] = make_pair(x, j);
}
sort((quiero).begin(), (quiero).end());
;
vector<string> ans(n);
for (long long i = (0); i < (long long)(n); i++) {
if (stock[quiero[i].first.first] > 0) {
ans[quiero[i].second] = asignar(quiero[i].first.first);
stock[quiero[i].first.first]--;
} else if (stock[quiero[i].first.second] > 0) {
ans[quiero[i].second] = asignar(quiero[i].first.second);
stock[quiero[i].first.second]--;
} else {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
for (long long i = (0); i < (long long)(n); i++) cout << ans[i] << "\n";
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
struct Dinic {
static const int MAXN = 250000;
struct Edge {
int u, v;
long long cap, rest;
};
int n, m, s, t, d[MAXN], cur[MAXN];
vector<Edge> edges;
vector<int> G[MAXN];
void init() {
edges.clear();
for (int i = 0; i < MAXN; i++) G[i].clear();
}
bool side[MAXN];
void cut(int u) {
side[u] = 1;
for (int i : G[u]) {
if (!side[edges[i].v] && edges[i].rest) cut(edges[i].v);
}
}
void add_edge(int u, int v, long long cap) {
edges.push_back({u, v, cap, cap});
edges.push_back({v, u, 0, 0LL});
m = edges.size();
G[u].push_back(m - 2);
G[v].push_back(m - 1);
}
bool bfs() {
memset(d, -1, sizeof(d));
queue<int> que;
que.push(s);
d[s] = 0;
while (!que.empty()) {
int u = que.front();
que.pop();
for (int ei : G[u]) {
Edge &e = edges[ei];
if (d[e.v] < 0 && e.rest > 0) {
d[e.v] = d[u] + 1;
que.push(e.v);
}
}
}
return d[t] >= 0;
}
long long dfs(int u, long long a) {
if (u == t || a == 0) return a;
long long flow = 0, f;
for (int &i = cur[u]; i < (int)G[u].size(); i++) {
Edge &e = edges[G[u][i]];
if (d[u] + 1 != d[e.v]) continue;
f = dfs(e.v, min(a, e.rest));
if (f > 0) {
e.rest -= f;
edges[G[u][i] ^ 1].rest += f;
flow += f;
a -= f;
if (a == 0) break;
}
}
return flow;
}
long long maxflow(int s, int t) {
this->s = s, this->t = t;
long long flow = 0, mf;
while (bfs()) {
memset(cur, 0, sizeof(cur));
while ((mf = dfs(s, INF))) flow += mf;
}
return flow;
}
} dinic;
map<string, int> ma;
int n, m;
int main() {
ma["S"] = 1;
ma["M"] = 2;
ma["L"] = 3;
ma["XL"] = 4;
ma["XXL"] = 5;
ma["XXXL"] = 6;
Dinic d;
int n, i, j;
string s;
string siz[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int num[6] = {0};
cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4] >> num[5];
d.add_edge(0, 1, num[0]);
d.add_edge(0, 2, num[1]);
d.add_edge(0, 3, num[2]);
d.add_edge(0, 4, num[3]);
d.add_edge(0, 5, num[4]);
d.add_edge(0, 6, num[5]);
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
for (j = 0; j < s.size() && s[j] != ','; j++) {
}
if (j == s.size()) {
d.add_edge(ma[s], 7 + i, 1);
} else {
d.add_edge(ma[s.substr(0, j)], 7 + i, 1);
d.add_edge(ma[s.substr(j + 1)], 7 + i, 1);
}
d.add_edge(7 + i, 7 + n, 1);
}
if (n == d.maxflow(0, 7 + n)) {
cout << "YES" << endl;
vector<int> v;
v.resize(n);
for (i = 0; i < d.edges.size(); i++)
if (d.edges[i].u >= 1 && d.edges[i].u <= 6 &&
d.edges[i].cap == d.edges[i].rest + 1)
v[d.edges[i].v - 7] = d.edges[i].u;
for (i = 0; i < n; i++) cout << siz[v[i] - 1] << endl;
} else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string re[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
string r[5];
for (int i = 0; i < 5; i++) r[i] = re[i] + "," + re[i + 1];
vector<int> s(6);
for (int(i) = 0; (i) < (int)(6); ++(i)) cin >> s[i];
int n, i;
cin >> n;
vector<string> sol(n);
vector<string> ss(n);
for (int(i) = 0; (i) < (int)(n); ++(i)) {
cin >> ss[i];
for (int(j) = 0; (j) < (int)(6); ++(j))
if (re[j] == ss[i]) {
--s[j];
sol[i] = re[j];
break;
}
}
for (int(i) = 0; (i) < (int)(6); ++(i))
if (s[i] < 0) {
cout << "NO";
return 0;
}
for (int(j) = 0; (j) < (int)(5); ++(j))
for (int(i) = 0; (i) < (int)(n); ++(i)) {
string tmp = ss[i];
if (tmp != r[j]) continue;
if (s[j] > 0) {
--s[j];
sol[i] = re[j];
continue;
}
if (s[j + 1] > 0) {
--s[j + 1];
sol[i] = re[j + 1];
continue;
}
cout << "NO";
return 0;
}
cout << "YES" << endl;
for (int i = 0; i < sol.size(); i++) cout << sol[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 7;
const int inf = 0x7f7f7f7f;
const int MOD = 1000000007;
map<string, int> m;
string mm[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int num[8];
int ans[100007];
struct node {
int s1, s2, id;
bool operator<(const node& p) const {
if (s1 == p.s1) return s2 > p.s2;
return s1 < p.s1;
}
} nod[100007];
int main() {
string s, tp;
m["S"] = 0;
m["M"] = 1;
m["L"] = 2;
m["XL"] = 3;
m["XXL"] = 4;
m["XXXL"] = 5;
for (int i = 0; i < 6; i++) scanf("%d", num + i);
int n;
scanf("%d", &n);
int f = 0;
for (int j = 0; j < n; j++) {
s = tp = "";
nod[j].s2 = 99;
nod[j].id = j;
cin >> s;
f = 0;
int l = s.length();
for (int i = 0; i < l; i++) {
if (s[i] != ',')
tp += s[i];
else {
tp += "";
nod[j].s1 = m[tp];
tp = "";
f = 1;
}
}
tp += "";
if (f) {
nod[j].s2 = m[tp];
if (nod[j].s1 > nod[j].s2) swap(nod[j].s1, nod[j].s2);
} else
nod[j].s1 = m[tp];
}
f = 0;
sort(nod, nod + n);
for (int i = 0; i < n; i++) {
int s1 = nod[i].s1;
int s2 = nod[i].s2;
if (num[s1]) {
num[s1]--;
ans[nod[i].id] = s1;
} else if (s2 < 6) {
if (num[s2]) {
num[s2]--;
ans[nod[i].id] = s2;
} else {
f = 1;
break;
}
} else {
f = 1;
break;
}
}
if (f)
printf("NO\n");
else {
printf("YES\n");
for (int i = 0; i < n; i++) {
cout << mm[ans[i]] << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v[100001];
map<string, int> m;
map<int, string> M;
string s;
int cnt[6], n;
bool is[100001];
int color[100001];
void func(int K) {
int i;
for (i = 1; i <= n; i++) {
if (!is[i]) {
if (v[i][0] == K or v[i][1] == K) {
if (cnt[K] > 0) {
cnt[K]--;
color[i] = K;
is[i] = true;
} else {
if (cnt[v[i][0]] > 0) {
cnt[v[i][0]]--;
color[i] = v[i][0];
is[i] = true;
}
if (cnt[v[i][1]] > 0) {
cnt[v[i][1]]--;
color[i] = v[i][1];
is[i] = true;
}
}
}
}
}
}
int main() {
ios_base::sync_with_stdio(0);
int i;
m["S"] = 0;
M[0] = "S";
m["M"] = 1;
M[1] = "M";
m["L"] = 2;
M[2] = "L";
m["XL"] = 3;
M[3] = "XL";
m["XXL"] = 4;
M[4] = "XXL";
m["XXXL"] = 5;
M[5] = "XXXL";
for (i = 0; i < 6; i++) {
cin >> cnt[i];
}
cin >> n;
for (i = 1; i <= n; i++) {
cin >> s;
string str = "";
for (int k = 0; k < s.length(); k++) {
if (s[k] == ',') {
v[i].push_back(m[str]);
str = "";
} else {
str += s[k];
}
}
v[i].push_back(m[str]);
}
bool possible = true;
for (i = 1; i <= n; i++) {
if (v[i].size() == 1) {
if (cnt[v[i][0]] > 0) {
is[i] = true;
cnt[v[i][0]]--;
color[i] = v[i][0];
} else {
possible = false;
break;
}
}
}
if (possible) {
func(0);
func(5);
func(1);
func(4);
func(2);
func(3);
for (i = 1; i <= n; i++) {
if (!is[i]) {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
for (i = 1; i <= n; i++) {
cout << M[color[i]] << endl;
}
} else {
cout << "NO\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 5;
struct part {
int t_shirt1, t_shirt2, ind;
part() {}
part(int a, int b, int c) {
t_shirt1 = a;
t_shirt2 = b;
ind = c;
}
};
bool p;
int n, a[7], t1, t2;
string s, t_shirt1, t_shirt2, t_shirts1[maxN], t_shirts2[maxN], ans[maxN];
vector<part> parts;
int get_code(string t) {
if (t == "S")
return 0;
else if (t == "M")
return 1;
else if (t == "L")
return 2;
else if (t == "XL")
return 3;
else if (t == "XXL")
return 4;
else if (t == "XXXL")
return 5;
else
return -1;
}
bool cmp_parts(part x, part y) {
if (x.t_shirt1 != y.t_shirt1)
return x.t_shirt1 < y.t_shirt1;
else
return x.t_shirt2 < y.t_shirt2;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (int i = 0; i < 6; i++) {
cin >> a[i];
}
cin >> n;
for (int i = 0; i < n; i++) {
p = false;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ',') {
t_shirt1 = s.substr(0, i);
t_shirt2 = s.substr(i + 1);
p = true;
break;
}
}
if (!p) {
t_shirt1 = s;
t_shirt2 = "1";
}
t_shirts1[i] = t_shirt1;
t_shirts2[i] = t_shirt2;
t1 = get_code(t_shirt1);
t2 = get_code(t_shirt2);
parts.push_back(part(t1, t2, i));
}
sort(parts.begin(), parts.end(), cmp_parts);
for (int i = 0; i < n; i++) {
if (a[parts[i].t_shirt1] != 0) {
ans[parts[i].ind] = t_shirts1[parts[i].ind];
a[parts[i].t_shirt1]--;
} else {
if (t_shirts2[parts[i].ind] == "1" || a[parts[i].t_shirt2] == 0) {
cout << "NO" << '\n';
return 0;
} else {
ans[parts[i].ind] = t_shirts2[parts[i].ind];
a[parts[i].t_shirt2]--;
}
}
}
cout << "YES" << '\n';
for (int i = 0; i < n; i++) {
cout << ans[i] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string busca(const string &S) {
for (int i = 0; i < S.size(); i++)
if (S[i] == ',') return S.substr(0, i);
return "";
}
string t_shirts[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
const int SIZE = 6;
vector<int> TS(SIZE);
for (int i = 0; i < SIZE; i++) cin >> TS[i];
int N;
cin >> N;
map<string, int> ID;
ID["S"] = 0;
ID["M"] = 1;
ID["L"] = 2;
ID["XL"] = 3;
ID["XXL"] = 4;
ID["XXXL"] = 5;
vector<int> SOL(N);
vector<pair<int, int> > V;
for (int i = 0; i < N; i++) {
string aux;
cin >> aux;
string ret = busca(aux);
if (ret == "") {
TS[ID[aux]]--;
SOL[i] = ID[aux];
} else {
int tmp = ID[ret];
V.push_back(make_pair(tmp, i));
}
}
sort(V.begin(), V.end());
for (int i = 0; i < V.size(); i++) {
int tmp = V[i].first;
if (TS[tmp] <= 0) tmp++;
TS[tmp]--;
SOL[V[i].second] = tmp;
}
bool yes = *min_element(TS.begin(), TS.end()) >= 0;
if (!yes)
cout << "NO\n";
else {
cout << "YES\n";
for (int i = 0; i < N; i++) cout << t_shirts[SOL[i]] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000009;
const long long maxu = 100009;
struct P {
long long from, to, flow, cap;
};
vector<P> edge;
vector<long long> v[maxu];
void init() {
edge.clear();
for (long long i = 0; i < maxu; i++) v[i].clear();
}
long long d[maxu];
bool vis[maxu];
long long st, ed;
inline void addedge(long long from, long long to, long long cap) {
edge.push_back((P){from, to, 0, cap});
edge.push_back((P){to, from, 0, 0});
long long m = edge.size();
v[from].push_back(m - 2);
v[to].push_back(m - 1);
}
bool bfs() {
memset(vis, 0, sizeof(vis));
queue<long long> que;
que.push(st);
d[st] = 0;
vis[st] = 1;
while (!que.empty()) {
long long u = que.front();
que.pop();
for (auto i : v[u]) {
P &e = edge[i];
if (!vis[e.to] && e.cap > e.flow) {
que.push(e.to);
d[e.to] = d[u] + 1;
vis[e.to] = 1;
}
}
}
return vis[ed];
}
long long cur[maxu];
long long dfs(long long x, long long a) {
if (x == ed || a == 0) return a;
long long Flow = 0, f;
for (long long &i = cur[x]; i < v[x].size(); i++) {
P &e = edge[v[x][i]];
if (d[e.to] == d[x] + 1 && (f = dfs(e.to, min(a, e.cap - e.flow))) > 0) {
a -= f;
e.flow += f;
Flow += f;
edge[v[x][i] ^ 1].flow -= f;
if (a == 0) break;
}
}
return Flow;
}
long long dinic(long long s, long long t) {
st = s;
ed = t;
long long Flow = 0;
while (bfs()) {
memset(cur, 0, sizeof(cur));
Flow += dfs(st, INF);
}
return Flow;
}
long long ans[100009];
map<string, long long> m;
long long n;
signed main() {
m["S"] = 1;
m["M"] = 2;
m["L"] = 3;
m["XL"] = 4;
m["XXL"] = 5;
m["XXXL"] = 6;
vector<long long> v(6);
for (auto &i : v) cin >> i;
for (long long i = 0; i < 6; ++i) addedge(0, i + 1, v[i]);
long long n;
cin >> n;
for (long long i = 1; i < n + 1; ++i) {
string x;
cin >> x;
x += ",";
long long pre = 0;
for (long long j = 0; j < (long long)(x).size(); ++j)
if (x[j] == ',') {
addedge(m[x.substr(pre, j - pre)], i + 6, 1);
pre = j + 1;
}
addedge(i + 6, n + 7, 1);
}
long long res = dinic(0, n + 7);
if (res != n) return cout << "NO", 0;
cout << "YES" << '\n';
for (auto i : edge)
if (i.from >= 1 && i.from <= 6 && i.to >= 7 && i.to <= n + 6 &&
i.flow == i.cap)
ans[i.to] = i.from;
for (long long i = 7; i < n + 7; ++i) {
for (auto j : m)
if (j.second == ans[i]) cout << j.first << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, oo = 1e9 + 7;
int a[6], q, b[5], c[6];
string s[N], ans[N], w[] = {"S", "M", "L", "XL", "XXL", "XXXL",
"S,M", "M,L", "L,XL", "XL,XXL", "XXL,XXXL"};
int main(int argc, const char* argv[]) {
for (int i = 0; i < 6; i++) cin >> a[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> s[i];
int tmp;
for (int j = 0; j < 11; j++)
if (s[i] == w[j]) tmp = j;
if (tmp > 5)
b[tmp - 6]++;
else {
if (a[tmp] > 0)
a[tmp]--;
else {
cout << "NO";
return 0;
}
ans[i] = s[i];
}
}
for (int i = 0; i < 6; i++) c[i] = a[i];
for (int i = 0; i < 5; i++) {
b[i] = max(0, b[i] - c[i]);
if (b[i] > 0 && c[i + 1] < b[i]) {
cout << "NO";
return 0;
}
c[i + 1] -= b[i];
b[i] = 0;
}
cout << "YES\n";
for (int i = 0; i < 5; i++)
for (int j = 0; j < q; j++)
if (s[j] == w[6 + i]) {
if (a[i] > 0) {
a[i]--;
ans[j] = w[i];
} else {
a[i + 1]--;
ans[j] = w[i + 1];
}
}
for (int i = 0; i < q; i++) cout << ans[i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int Modulo = 1000000007;
int N, k, x;
int main() {
int number[6];
int uncertain[5];
vector<int> people;
string sizes[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
for (int i = 0; i < 6; ++i) {
cin >> number[i];
}
int N;
cin >> N;
for (int i = 0; i < N; ++i) {
string S;
cin >> S;
int t = S.find(',');
if (t == -1) {
if (S.size() > 1) {
number[S.size() + 1]--;
people.push_back(S.size() + 1);
} else {
if (S[0] == 'S') {
number[0]--;
people.push_back(0);
}
if (S[0] == 'M') {
number[1]--;
people.push_back(1);
}
if (S[0] == 'L') {
number[2]--;
people.push_back(2);
}
}
} else {
if (t > 1) {
people.push_back(t + 1 + 10);
} else {
if (S[0] == 'S') {
people.push_back(10);
}
if (S[0] == 'M') {
people.push_back(11);
}
if (S[0] == 'L') {
people.push_back(12);
}
}
}
}
for (int i = 0; i < 6; ++i) {
if (number[i] < 0) {
cout << "NO\n";
return 0;
}
for (int j = 0; j < N; j++) {
if (people[j] == i + 10) {
if (number[i] > 0) {
number[i]--;
people[j] -= 10;
} else {
number[i + 1]--;
people[j] -= 9;
}
}
}
}
cout << "YES\n";
for (int i = 0; i < N; ++i) {
cout << sizes[people[i]] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int N = 100010;
vector<int> even;
pair<int, int> have[N];
int a[10], b[N], n;
char s[20];
inline int id(char *s) {
if (s[0] == 'S') return 1;
if (s[0] == 'M') return 2;
if (s[0] == 'L') return 3;
if (s[1] == 'L') return 4;
if (s[2] == 'L') return 5;
if (s[3] == 'L') return 6;
}
bool judge() {
for (int i = 1; i <= 6; i++) {
if (a[i] < 0) return 0;
}
for (int j = 6; j; j--) {
for (int i = 0; i < even.size(); i++) {
int x = even[i];
if (b[x]) continue;
if (have[x].first == j) {
if (a[j] > 0) {
a[j]--;
b[x] = j;
} else
return 0;
}
}
for (int i = 0; i < even.size(); i++) {
int x = even[i];
if (b[x]) continue;
if (have[x].second == j) {
if (a[j] > 0) {
a[j]--;
b[x] = j;
}
}
}
}
return 1;
}
int main() {
for (int i = 1; i <= 6; i++) scanf("%d", &a[i]);
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", s);
int l = strlen(s), pos = l;
for (int j = 0; j < l; j++)
if (s[j] == ',') pos = j;
if (pos == l) {
b[i] = id(s);
a[id(s)]--;
} else {
int x = id(s), y = id(s + pos + 1);
even.push_back(i);
if (x > y) swap(x, y);
have[i] = make_pair(x, y);
}
}
if (!judge()) {
puts("NO");
} else {
puts("YES");
for (int i = 1; i <= n; i++) {
if (b[i] == 1) puts("S");
if (b[i] == 2) puts("M");
if (b[i] == 3) puts("L");
if (b[i] == 4) puts("XL");
if (b[i] == 5) puts("XXL");
if (b[i] == 6) puts("XXXL");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int parse(string s) {
if (s == "S") return 0;
if (s == "M") return 1;
if (s == "L") return 2;
if (s == "XL") return 3;
if (s == "XXL") return 4;
if (s == "XXXL") return 5;
}
string to(int n) {
if (n == 0) return "S";
if (n == 1) return "M";
if (n == 2) return "L";
if (n == 3) return "XL";
if (n == 4) return "XXL";
if (n == 5) return "XXXL";
}
int main() {
ios_base::sync_with_stdio(false);
vector<int> cnt(6);
for (int i = 0; i < 6; i++) {
cin >> cnt[i];
}
int n;
cin >> n;
vector<int> ans(n, -1);
vector<pair<int, int>> tp(n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int t1 = -1, t2 = -1;
if (s.find(',') == string::npos) {
t1 = parse(s);
} else {
t1 = parse(s.substr(0, s.find(',')));
t2 = parse(s.substr(s.find(',') + 1));
}
if (t2 == -1) {
if (cnt[t1] > 0) {
ans[i] = t1;
--cnt[t1];
}
}
tp[i] = {t1, t2};
}
for (int i = 0; i < n; i++) {
if (tp[i].first == 0 && tp[i].second == 1) {
if (cnt[0] > 0) {
ans[i] = 0;
--cnt[0];
} else if (cnt[1] > 0) {
ans[i] = 1;
--cnt[1];
}
}
}
for (int i = 0; i < n; i++) {
if (tp[i].first == 1 && tp[i].second == 2) {
if (cnt[1] > 0) {
ans[i] = 1;
--cnt[1];
} else if (cnt[2] > 0) {
ans[i] = 2;
--cnt[2];
}
}
}
for (int i = 0; i < n; i++) {
if (tp[i].first == 2 && tp[i].second == 3) {
if (cnt[2] > 0) {
ans[i] = 2;
--cnt[2];
} else if (cnt[3] > 0) {
ans[i] = 3;
--cnt[3];
}
}
}
for (int i = 0; i < n; i++) {
if (tp[i].first == 3 && tp[i].second == 4) {
if (cnt[3] > 0) {
ans[i] = 3;
--cnt[3];
} else if (cnt[4] > 0) {
ans[i] = 4;
--cnt[4];
}
}
}
for (int i = 0; i < n; i++) {
if (tp[i].first == 4 && tp[i].second == 5) {
if (cnt[4] > 0) {
ans[i] = 4;
--cnt[4];
} else if (cnt[5] > 0) {
ans[i] = 5;
--cnt[5];
}
}
}
bool ok = true;
for (int i = 0; i < n; i++) {
ok &= (ans[i] != -1);
}
if (!ok) {
cout << "NO\n";
} else {
cout << "YES\n";
for (int i = 0; i < n; i++) {
cout << to(ans[i]) << '\n';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int x, y, id;
bool operator<(const node &r) const { return x < r.x; }
} e[100005];
int ans[100005];
map<string, int> mp;
int main() {
int a[6] = {0};
mp["S"] = 0, mp["M"] = 1, mp["L"] = 2, mp["XL"] = 3, mp["XXL"] = 4,
mp["XXXL"] = 5;
string s, str, s1, res[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
for (int i = 0; i < 6; i++) {
cin >> a[i];
}
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str;
s = "", s1 = "";
int m = str.size(), flag = 0;
for (int k = 0; k < m; k++) {
if (str[k] == ',') {
flag = 1;
} else if (!flag) {
s += str[k];
} else
s1 += str[k];
}
if (!flag) {
e[i].x = e[i].y = mp[s];
ans[i] = e[i].x;
a[e[i].x]--;
} else {
e[i].x = mp[s], e[i].y = mp[s1];
if (e[i].x > e[i].y) swap(e[i].x, e[i].y);
}
e[i].id = i;
}
sort(e, e + n);
for (int i = 0; i < n; i++) {
if (e[i].x == e[i].y) continue;
if (a[e[i].x] > 0)
a[e[i].x]--, ans[e[i].id] = e[i].x;
else
a[e[i].y]--, ans[e[i].id] = e[i].y;
}
for (int i = 0; i < 6; i++) {
if (a[i] < 0) {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
for (int i = 0; i < n; i++) {
cout << res[ans[i]] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 100007;
struct pula {
int x;
int y;
int poz;
};
int a, b;
vector<pula> ans;
string s;
int nr[NMAX];
int Ans[NMAX];
pula make_pula(int a, int b, int c) {
pula d;
d.x = a;
d.y = b;
d.poz = c;
return d;
}
int solve(string s, int poz) {
if (s[poz] == 'S') {
return 1;
}
if (s[poz] == 'M') {
return 2;
}
if (s[poz] == 'L') {
return 3;
}
if (s[poz] == 'X' && s[poz + 2] == ',') {
return 4;
}
if (s[poz] == 'X' && s[poz + 3] == ',') {
return 5;
}
if (s[poz] == 'X' && s[poz + 4] == ',') {
return 6;
}
}
void solve2(int c) {
if (c == 1) {
cout << "S";
}
if (c == 2) {
cout << "M";
}
if (c == 3) {
cout << "L";
}
if (c == 4) {
cout << "XL";
}
if (c == 5) {
cout << "XXL";
}
if (c == 6) {
cout << "XXXL";
}
cout << "\n";
}
int cmp(pula a, pula b) {
if (a.x != b.x) {
return a.x < b.x;
}
return a.y < b.y;
}
int main() {
for (int i = 1; i <= 6; ++i) {
cin >> nr[i];
}
int m;
cin >> m;
for (int i = 1; i <= m; ++i) {
s.clear();
cin >> s;
s += ',';
int X = solve(s, 0), Y = 0;
s.erase(s.size() - 1);
for (int j = 0; j < s.size(); ++j) {
if (s[j] == ',') {
s += ',';
Y = solve(s, j + 1);
break;
}
}
ans.push_back(make_pula(X, Y, i));
}
sort(ans.begin(), ans.end(), cmp);
for (int i = 0; i < m; ++i) {
if (ans[i].y == 0) {
Ans[ans[i].poz] = ans[i].x;
if (nr[ans[i].x] > 0) {
--nr[ans[i].x];
} else {
cout << "NO\n";
return 0;
}
} else {
if (nr[ans[i].x] > 0) {
--nr[ans[i].x];
Ans[ans[i].poz] = ans[i].x;
} else {
if (nr[ans[i].y] > 0) {
--nr[ans[i].y];
Ans[ans[i].poz] = ans[i].y;
} else {
cout << "NO\n";
return 0;
}
}
}
}
cout << "YES\n";
for (int i = 1; i <= m; ++i) {
solve2(Ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, int> MP;
int ans[100005];
string str[100005];
int cnt[8];
int n;
bool ret(string str, int x) {
str = str.substr(0, str.find(","));
if (MP[str] == x) return 1;
return 0;
}
bool solve() {
for (int i = 1; i <= 6; i++) cin >> cnt[i];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str[i];
if (str[i].find(",") != string::npos) {
ans[i] = 0;
} else {
ans[i] = MP[str[i]];
cnt[MP[str[i]]]--;
if (cnt[MP[str[i]]] < 0) return false;
}
}
for (int x = 1; x <= 6; x++) {
int i = 0;
while (cnt[x] > 0 && i < n) {
if (ans[i] == 0 && ret(str[i], x - 1)) {
ans[i] = x;
cnt[x]--;
}
i++;
}
i = 0;
while (cnt[x] > 0 && i < n) {
if (ans[i] == 0 && ret(str[i], x)) {
ans[i] = x;
cnt[x]--;
}
i++;
}
}
for (int i = 0; i < n; ++i) {
if (ans[i] == 0) return false;
}
return true;
}
int main() {
MP["S"] = 1, MP["M"] = 2, MP["L"] = 3, MP["XL"] = 4, MP["XXL"] = 5,
MP["XXXL"] = 6;
if (solve()) {
cout << "YES\n";
for (int i = 0; i < n; i++) {
if (ans[i] == 1) cout << "S\n";
if (ans[i] == 2) cout << "M\n";
if (ans[i] == 3) cout << "L\n";
if (ans[i] == 4) cout << "XL\n";
if (ans[i] == 5) cout << "XXL\n";
if (ans[i] == 6) cout << "XXXL\n";
}
} else
cout << "NO\n";
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:36777216")
using namespace std;
int main() {
vector<int> counts(6);
for (int i = 0; i < 6; ++i) {
cin >> counts[i];
}
int n;
cin >> n;
char buffer[1000];
map<string, int> size;
size["S"] = 0;
size["M"] = 1;
size["L"] = 2;
size["XL"] = 3;
size["XXL"] = 4;
size["XXXL"] = 5;
vector<string> sizes;
sizes.push_back("S");
sizes.push_back("M");
sizes.push_back("L");
sizes.push_back("XL");
sizes.push_back("XXL");
sizes.push_back("XXXL");
vector<vector<int> > indices(6);
vector<string> ans(n);
for (int i = 0; i < n; ++i) {
scanf("%s", buffer);
string s = buffer;
if (s.find(',') != string::npos) {
string min_size = s.substr(0, s.find(','));
counts[size[min_size]]--;
indices[size[min_size]].push_back(i);
ans[i] = min_size;
} else {
counts[size[s]]--;
ans[i] = s;
}
}
for (int i = 0; i < 5; ++i) {
if (counts[i] >= 0) {
continue;
}
int pos = 0;
while (counts[i] < 0 && pos < indices[i].size()) {
int index = indices[i][pos];
ans[index] = sizes[i + 1];
++counts[i];
--counts[i + 1];
++pos;
}
if (counts[i] < 0) {
printf("NO\n");
return 0;
}
}
if (counts[5] < 0) {
printf("NO\n");
return 0;
}
printf("YES\n");
for (int i = 0; i < n; ++i) {
printf("%s\n", ans[i].c_str());
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[24];
map<string, int> mp;
vector<string> rmap;
struct student {
pair<int, int> ran;
int id;
bool operator<(student other) const { return ran < other.ran; }
};
student stu[100011];
int ans[100011];
void preprocess() {
rmap = vector<string>(7, "");
mp["S"] = 1;
mp["M"] = 2;
mp["L"] = 3;
mp["XL"] = 4;
mp["XXL"] = 5;
mp["XXXL"] = 6;
rmap[1] = "S";
rmap[2] = "M";
rmap[3] = "L";
rmap[4] = "XL";
rmap[5] = "XXL";
rmap[6] = "XXXL";
}
pair<int, int> parse(char s2[]) {
int i, len = strlen(s2);
int L = 0, R = 0;
string s1 = "";
for (i = 0; i < len; ++i) {
if (s[i] == ',') {
L = mp[s1];
s1 = "";
} else {
s1 += s[i];
}
}
if (s1.size() > 0) {
R = mp[s1];
if (L == 0) L = R;
} else {
R = L;
}
return make_pair(L, R);
}
int a[7];
set<pair<int, int>> st;
int main() {
int i, j, n;
preprocess();
for (i = 1; i <= 6; ++i) {
scanf("%d", &a[i]);
}
scanf("%d", &n);
for (i = 1; i <= n; ++i) {
scanf("%s", s);
stu[i].ran = parse(s);
stu[i].id = i;
}
sort(stu + 1, stu + 1 + n);
for (i = 1, j = 1; i <= 6; ++i) {
while (j <= n && stu[j].ran.first <= i) {
st.insert(make_pair(stu[j].ran.second, stu[j].id));
j++;
}
while (!st.empty()) {
auto it = st.begin();
if (it->first < i) {
printf("NO\n");
return 0;
}
if (a[i] <= 0) break;
ans[it->second] = i;
a[i]--;
st.erase(it);
}
}
if (!st.empty()) {
printf("NO\n");
return 0;
}
printf("YES\n");
for (i = 1; i <= n; ++i) {
cout << rmap[ans[i]] << endl;
;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000000;
struct edge {
int a, b;
int cap;
int flow;
int back;
edge(int a, int b, int cap, int flow) {
this->a = a;
this->b = b;
this->cap = cap;
this->flow = flow;
back = 0;
}
};
vector<int> g[N];
vector<edge> e;
int level[N];
int ptr[N];
int kolV = 0;
void add_edge(int a, int b, int cap) {
e.push_back(edge(a, b, cap, 0));
e.push_back(edge(b, a, 0, 0));
e[e.size() - 1].back = e.size() - 2;
e[e.size() - 2].back = e.size() - 1;
g[a].push_back(e.size() - 2);
g[b].push_back(e.size() - 1);
}
bool bfs(int s, int t) {
queue<int> q;
q.push(s);
fill(level, level + kolV, 0);
level[s] = 1;
while (!q.empty()) {
int v = q.front();
q.pop();
for (int i = 0; i < g[v].size(); i++) {
if (e[g[v][i]].flow != e[g[v][i]].cap && !level[e[g[v][i]].b]) {
q.push(e[g[v][i]].b);
level[e[g[v][i]].b] = level[v] + 1;
}
}
}
return level[t];
}
int dfs(int v, int t, int flow) {
if (!flow || v == t) return flow;
for (int &i = ptr[v]; i < g[v].size(); i++) {
if (level[v] + 1 != level[e[g[v][i]].b]) continue;
int value =
dfs(e[g[v][i]].b, t, min(flow, e[g[v][i]].cap - e[g[v][i]].flow));
if (!value) continue;
e[g[v][i]].flow += value;
e[e[g[v][i]].back].flow -= value;
return value;
}
return 0;
}
int dinic(int s, int t) {
int all_flow = 0;
while (bfs(s, t)) {
fill(ptr, ptr + kolV, 0);
int cur_flow = 0;
while (cur_flow = dfs(s, t, (int)1e9)) all_flow += cur_flow;
}
return all_flow;
}
const string ss[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
map<string, int> c = {{"S", 0}, {"M", 1}, {"L", 2},
{"XL", 3}, {"XXL", 4}, {"XXXL", 5}};
int vert[N], de[N];
string answer[N];
int main() {
ios::sync_with_stdio(false);
int s = kolV++;
int t = kolV++;
for (int i = 0; i < 6; i++) {
int kol;
cin >> kol;
vert[i] = kolV++;
add_edge(s, vert[i], kol);
}
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
de[kolV] = i;
int vertex = kolV++;
if (str.find(',') != string::npos) {
int i = c[str.substr(0, str.find(','))];
int j = c[str.substr(str.find(',') + 1)];
add_edge(vert[i], vertex, 1);
add_edge(vert[j], vertex, 1);
} else {
int p = c[str];
add_edge(vert[p], vertex, 1);
}
add_edge(vertex, t, 1);
}
if (dinic(s, t) != n) {
cout << "NO\n";
} else {
cout << "YES\n";
for (int i = 0; i < 6; i++) {
for (int j = 0; j < g[vert[i]].size(); j++) {
int r = g[vert[i]][j];
if (e[r].flow == e[r].cap && e[r].flow == 1) {
answer[de[e[r].b]] = ss[i];
}
}
}
for (int i = 0; i < n; i++) {
cout << answer[i] << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
int n, a[6], r[N];
string pChar[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
map<string, int> cPos = {
{"S", 0}, {"M", 1}, {"L", 2}, {"XL", 3}, {"XXL", 4}, {"XXXL", 5},
};
bool normal(string &s) {
for (int i = 0; i < 6; i++)
if (s == pChar[i]) {
a[cPos[s]]--;
return 1;
}
return 0;
}
int main() {
ios::sync_with_stdio(false);
for (int i = 0; i < 6; i++) cin >> a[i];
vector<pair<int, int>> v;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (normal(s)) {
r[i] = cPos[s];
continue;
}
for (int j = 0; j < 5; j++)
if (s == pChar[j] + "," + pChar[j + 1]) v.push_back({j, i});
}
for (int i = 0; i < 6; i++)
if (a[i] < 0) return !(cout << "NO" << endl);
sort(v.begin(), v.end());
for (auto it : v) {
if (a[it.first]) {
a[it.first]--;
r[it.second] = it.first;
} else if (a[it.first + 1]) {
a[it.first + 1]--;
r[it.second] = it.first + 1;
} else
return !(cout << "NO" << endl);
}
cout << "YES" << endl;
for (int i = 0; i < n; i++) cout << pChar[r[i]] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T next_int() {
T x = 0, p = 1;
char ch;
do {
ch = getchar();
} while (ch <= ' ');
if (ch == '-') {
p = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
ch = getchar();
}
return p * x;
}
string next_token() {
char ch;
string ans = "";
do {
ch = getchar();
} while (ch <= ' ');
while (ch > ' ') {
ans += ch;
ch = getchar();
}
return ans;
}
const long long INF = (long long)1e18;
const int INFINT = (int)1e9 + 227 + 1;
const int MAXN = (int)1e5 + 227 + 1;
const int MOD = (int)1e9 + 7;
const long double EPS = 1e-7;
long long bin_pow(long long a, long long b) {
if (!b) return 1;
long long ans = bin_pow(a, b / 2);
ans = ans * ans;
if (b % 2) ans = ans * a;
return ans;
}
const string type[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int a[6];
int f(string a) {
for (int i = 0; i < 6; i++)
if (type[i] == a) return i;
assert(0);
}
bool used[MAXN];
vector<pair<int, int> > c[6];
int main() {
for (int i = 0; i < 6; i++) cin >> a[i];
int n = next_int<int>();
vector<string> ans(n, "-1");
for (int i = 0; i < n; i++) {
string A;
cin >> A;
int p = -1;
for (int j = 0; j < A.size(); j++) {
if (A[j] == ',') p = j;
}
if (p == -1) {
ans[i] = A;
a[f(A)]--;
} else {
int fi = f(A.substr(0, p));
int se = f(A.substr(p + 1, (A.size() - (p + 1))));
c[fi].push_back(make_pair(0, i));
c[se].push_back(make_pair(-1, i));
}
}
for (int i = 0; i < 6; i++) {
sort((c[i]).begin(), (c[i]).end());
for (int j = 0; j < c[i].size() && a[i] > 0; j++) {
if (used[c[i][j].second]) continue;
ans[c[i][j].second] = type[i];
used[c[i][j].second] = 1;
a[i]--;
}
}
bool ok = 1;
for (int i = 0; i < n; i++) ok &= (ans[i] != "-1");
for (int i = 0; i < 6; i++) ok &= (a[i] >= 0);
if (!ok) {
puts("NO");
return 0;
}
puts("YES");
for (int i = 0; i < n; i++) cout << ans[i] << "\n";
}
|
#include <bits/stdc++.h>
const char *id[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int get(const char *s) {
for (int i = 0; i < 6; i++)
if (!strcmp(id[i], s)) return i;
}
const int N = 2e5;
struct node {
int L, R;
int id;
int operator<(const node &p) const {
if (L == p.L) return R < p.R;
return L < p.L;
}
} a[N];
int c[7];
char buf[20];
int ans[N];
int main() {
for (int i = 0; i < 6; i++) scanf("%d", c + i);
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", buf);
std::string s(buf);
bool flag = false;
for (int j = 0; j < s.size(); j++) {
if (s[j] == ',') {
a[i].L = get(s.substr(0, j).c_str());
a[i].R = get(s.substr(j + 1, s.size() - j).c_str());
flag = true;
}
}
if (!flag) a[i].L = a[i].R = get(s.c_str());
a[i].id = i;
}
std::fill(ans, ans + n, -1);
std::sort(a, a + n);
int J = 0;
for (int i = 0; i < 6; i++) {
while (J < n && a[J].L <= i && i <= a[J].R) {
if (c[i] == 0) break;
c[i]--;
ans[a[J].id] = i;
J++;
}
}
if (*std::min_element(ans, ans + n) == -1) {
puts("NO");
} else {
puts("YES");
for (int i = 0; i < n; i++) printf("%s\n", id[ans[i]]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5007, M = 128, mod = 1000000007, inf = 1000000007;
const long long lmod = 1000000007, linf = 1e18 + 77;
const long double eps = 1e-9;
int k[N];
vector<int> a;
vector<pair<int, int> > b;
map<string, int> num;
void bad() {
puts("NO");
exit(0);
}
int p[N];
int l[N], r[N];
vector<pair<string, bool> > inp;
string S[N] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int main() {
ios_base::sync_with_stdio(0);
num["S"] = 0;
num["M"] = 1;
num["L"] = 2;
num["XL"] = 3;
num["XXL"] = 4;
num["XXXL"] = 5;
for (int i = 0; i < 6; i++) {
cin >> k[i];
}
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
bool flag = 0;
for (int j = 0; j < s.size(); j++) {
if (s[j] == ',') {
flag = 1;
}
}
if (flag) {
while (s.back() != ',') s.pop_back();
s.pop_back();
p[num[s]]++;
} else {
a.push_back(num[s]);
}
inp.push_back(make_pair(s, flag));
}
for (int i = 0; i < a.size(); i++) {
k[a[i]]--;
if (k[a[i]] < 0) {
bad();
}
}
for (int i = 0; i < 5; i++) {
if (p[i] > k[i] + k[i + 1]) {
bad();
} else {
int del = min(p[i], k[i]);
p[i] -= del;
k[i] -= del;
l[i] += del;
k[i + 1] -= p[i];
r[i] += p[i];
}
}
cout << "YES" << endl;
for (int i = 0; i < inp.size(); i++) {
bool flag = inp[i].second;
string s = inp[i].first;
if (flag) {
int nu = num[s];
if (l[nu]) {
cout << s << endl;
l[nu]--;
} else {
cout << S[nu + 1] << endl;
r[nu]--;
}
} else {
cout << s << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-10;
const long long MOD = 1000000007ll;
const long long mod1 = 1000000009ll;
const long long mod2 = 1100000009ll;
int INF = (int)1e9 + 5;
long long INFINF = (long long)1e18;
int n;
string sizes[] = {"S", "M", "L", "XL", "XXL", "XXXL",
"S,M", "M,L", "L,XL", "XL,XXL", "XXL,XXXL"};
int size_avail[6];
pair<int, int> req[100010];
int ans[100010];
int main() {
for (int i = 0; i < 6; i++) scanf("%d", &size_avail[i]);
scanf("%d", &n);
string x;
for (int i = 1; i <= n; i++) {
cin >> x;
for (int j = 0; j < 11; j++)
if (sizes[j] == x) {
req[i] = make_pair(j, i);
break;
}
}
sort(req + 1, req + n + 1);
for (int i = 1; i <= n; i++) {
int t_shirt = req[i].first;
int pos = req[i].second;
if (t_shirt < 6) {
if (size_avail[t_shirt] > 0) {
size_avail[t_shirt]--;
ans[pos] = t_shirt;
} else {
cout << "NO" << endl;
return 0;
}
} else {
t_shirt -= 6;
if (size_avail[t_shirt] > 0) {
size_avail[t_shirt]--;
ans[pos] = t_shirt;
} else {
t_shirt++;
if (size_avail[t_shirt] > 0) {
size_avail[t_shirt]--;
ans[pos] = t_shirt;
} else {
cout << "NO" << endl;
return 0;
}
}
}
}
cout << "YES" << endl;
for (int i = 1; i <= n; i++) cout << sizes[ans[i]] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = (int)1e9 + 7;
const int N = (int)1e6 + 7;
int n, a[N];
string str[N];
string s[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
string ss[] = {"S,M", "M,L", "L,XL", "XL,XXL", "XXL,XXXL"};
void Init() {
for (int i = (0); i < (6); ++i) cin >> a[i];
cin >> n;
for (int i = (0); i < (n); ++i) {
cin >> str[i];
for (int j = (0); j < (6); ++j)
if (str[i] == s[j]) a[j]--;
}
}
int Solve() {
for (int i = (0); i < (6); ++i)
if (a[i] < 0) {
cout << "NO" << endl;
return 0;
}
for (int i = (0); i < (5); ++i)
for (int j = (0); j < (n); ++j)
if (str[j] == ss[i]) {
if (a[i]) {
str[j] = s[i];
a[i]--;
} else {
str[j] = s[i + 1];
a[i + 1]--;
}
}
for (int i = (0); i < (6); ++i)
if (a[i] < 0) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
for (int i = (0); i < (n); ++i) cout << str[i] << endl;
return 0;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
Init();
Solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
unordered_map<string, int> mp;
string rev[6];
int cnt[6], res[100005];
vector<pair<pair<int, int>, int> > ds;
int main() {
mp["S"] = 0;
rev[0] = "S";
mp["M"] = 1;
rev[1] = "M";
mp["L"] = 2;
rev[2] = "L";
mp["XL"] = 3;
rev[3] = "XL";
mp["XXL"] = 4;
rev[4] = "XXL";
mp["XXXL"] = 5;
rev[5] = "XXXL";
for (int i = 0; i < 6; i++) cin >> cnt[i];
int n;
cin >> n;
string s;
for (int j = 0; j < n; j++) {
cin >> s;
string s1, s2;
int i = 0;
for (i = 0; i < s.size() and s[i] != ','; i++) s1 += s[i];
for (i++; i < s.size(); i++) s2 += s[i];
if (s2.size() == 0) {
if (cnt[mp[s1]] <= 0) cout << "NO", exit(0);
cnt[mp[s1]]--;
res[j] = mp[s1];
} else
ds.push_back(make_pair(make_pair(mp[s1], mp[s2]), j));
}
sort(ds.begin(), ds.end());
int l = 0, r = 1, p = 0;
if (ds.size()) l = ds[0].first.first, r = ds[0].first.second;
while (p < ds.size()) {
while (p < ds.size() and ds[p].first.first == l and
ds[p].first.second == r) {
if (cnt[l] > 0) {
cnt[l]--;
res[ds[p].second] = l;
} else if (cnt[r] > 0) {
cnt[r]--;
res[ds[p].second] = r;
} else
cout << "NO", exit(0);
p++;
}
l++;
r++;
}
cout << "YES\n";
for (int i = 0; i < n; i++) cout << rev[res[i]] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string mp[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int n;
int a[6], ansv[100010], tot0;
struct node {
int id, v;
bool operator<(const node& x) const { return v < x.v; }
} b[100010];
int idx(char* S, int len) {
if (len == 1) {
if (S[0] == 'S') return 0;
if (S[0] == 'M') return 1;
return 2;
}
if (len == 2) return 3;
if (len == 3) return 4;
return 5;
}
bool check() {
for (int i = 0; i < 6; i++)
if (a[i] < 0) return 0;
for (int i = 1; i <= tot0; i++) {
if (a[b[i].v] > 0)
a[b[i].v]--;
else if (a[b[i].v + 1] > 0) {
a[b[i].v + 1]--;
ansv[b[i].id]++;
} else
return 0;
}
puts("YES");
for (int i = 1; i <= n; i++) {
printf("%s\n", mp[ansv[i]].c_str());
}
return 1;
}
int main() {
for (int i = 0; i < 6; i++) scanf("%d", &a[i]);
scanf("%d", &n);
char ch, S[10];
int tot;
for (int i = 1; i <= n; i++) {
while (!isalpha(ch = getchar()))
;
S[0] = ch;
tot = 1;
while (isalpha(ch = getchar())) S[tot++] = ch;
ansv[i] = idx(S, tot);
if (ch != ',') {
a[ansv[i]]--;
continue;
}
b[++tot0] = (node){i, ansv[i]};
while (isalpha(ch = getchar()))
;
}
sort(b + 1, b + tot0 + 1);
if (!check()) puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class X, class Y>
void minimize(X &x, const Y &y) {
if (x > y) x = y;
}
template <class X, class Y>
void maximize(X &x, const Y &y) {
if (x < y) x = y;
}
template <class T>
T Abs(const T &x) {
return (x < 0 ? -x : x);
}
const string yes = "YES";
const string no = "NO";
const string sizeName[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
const int numSize = 6;
vector<int> singleReq[10], doubleReq[10];
string answer[100100];
int have[10], n;
void noAnswer(void) {
cout << "NO" << endl;
exit(0);
}
void process(void) {
for (int i = 0, _n = (numSize); i < _n; i = i + 1) cin >> have[i];
cin >> n;
for (int i = (1), _b = (n); i <= _b; i = i + 1) {
string req;
cin >> req;
for (int j = 0, _n = (numSize); j < _n; j = j + 1)
if (req == sizeName[j]) singleReq[j].push_back(i);
for (int j = 0, _n = (numSize - 1); j < _n; j = j + 1)
if (req == sizeName[j] + "," + sizeName[j + 1]) doubleReq[j].push_back(i);
}
for (int i = 0, _n = (numSize); i < _n; i = i + 1) {
if (have[i] < singleReq[i].size()) noAnswer();
have[i] -= singleReq[i].size();
for (__typeof((singleReq[i]).begin()) it = (singleReq[i]).begin();
it != (singleReq[i]).end(); it++)
answer[*it] = sizeName[i];
}
for (int i = 0, _n = (numSize - 1); i < _n; i = i + 1) {
if (have[i] + have[i + 1] < doubleReq[i].size()) noAnswer();
for (int j = (i), _b = (i + 1); j <= _b; j = j + 1)
while (!doubleReq[i].empty() && have[j] > 0) {
have[j]--;
answer[doubleReq[i].back()] = sizeName[j];
doubleReq[i].pop_back();
}
}
cout << yes << "\n";
for (int i = (1), _b = (n); i <= _b; i = i + 1) cout << answer[i] << "\n";
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
process();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, a[6], d[N], val[N];
string result[N];
string ids[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int getId(string s) {
for (int i = 0; i < 6; ++i)
if (s == ids[i]) return i;
return -1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
for (int i = 0; i < 6; ++i) cin >> a[i];
cin >> n;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
int pos = s.find(',');
if (pos == (int)string::npos) {
--a[getId(s)];
result[i] = s;
} else {
d[i] = true;
val[i] = getId(s.substr(0, pos));
}
}
for (int i = 0; i < 6; ++i) {
for (int j = 0; j < n; ++j) {
if (d[j] && val[j] == i) {
if (a[i] > 0) {
d[j] = false;
--a[i];
result[j] = ids[i];
} else {
--a[i + 1];
result[j] = ids[i + 1];
}
d[j] = false;
}
}
}
for (int i = 0; i < 6; ++i)
if (a[i] < 0) {
cout << "NO" << endl;
exit(0);
}
for (int i = 0; i < n; ++i)
if (d[i]) {
cout << "NO" << endl;
exit(0);
}
cout << "YES" << endl;
for (int i = 0; i < n; ++i) cout << result[i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
long B[100007][2];
long A[100007], Res[100007];
using namespace std;
long SizeToInt(string s) {
if (s == "S") return 1;
if (s == "M") return 2;
if (s == "L") return 3;
if (s == "XL") return 4;
if (s == "XXL") return 5;
if (s == "XXXL") return 6;
return 0;
}
int GetP(long player, long num) {
if (A[num] > 0) {
A[num]--;
Res[player] = num;
return 0;
} else {
return -1;
}
}
string s, s1, s2;
long N;
int main() {
cin >> A[1] >> A[2] >> A[3] >> A[4] >> A[5] >> A[6];
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> s;
int p = s.find(',');
if (p == string::npos) {
B[i][0] = SizeToInt(s);
} else {
s1 = s.substr(0, p);
s2 = s.substr(p + 1);
B[i][0] = SizeToInt(s1);
B[i][1] = SizeToInt(s2);
}
}
for (int i = 1; i <= N; i++) {
if (B[i][1] == 0) {
if (GetP(i, B[i][0]) == -1) {
cout << "NO" << endl;
return 0;
}
}
}
for (int sizes = 1; sizes <= 6; sizes++) {
for (int i = 1; i <= N; i++) {
if (Res[i] == 0) {
if (B[i][1] == sizes && A[B[i][1]] > 0) GetP(i, B[i][1]);
}
}
for (int i = 1; i <= N; i++) {
if (Res[i] == 0) {
if (B[i][0] == sizes && A[B[i][0]] > 0) GetP(i, B[i][0]);
}
}
}
for (int i = 1; i <= N; i++)
if (Res[i] == 0) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
for (int i = 1; i <= N; i++) {
if (Res[i] == 1) cout << "S" << endl;
if (Res[i] == 2) cout << "M" << endl;
if (Res[i] == 3) cout << "L" << endl;
if (Res[i] == 4) cout << "XL" << endl;
if (Res[i] == 5) cout << "XXL" << endl;
if (Res[i] == 6) cout << "XXXL" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int num[7];
char str[10];
char size[7][10] = {"1", "S", "M", "L", "XL", "XXL", "XXXL"};
int find(int st, int len) {
char s[10];
strncpy(s, str + st, len);
s[len] = 0;
if (strcmp(s, "S") == 0) return 1;
if (strcmp(s, "M") == 0) return 2;
if (strcmp(s, "L") == 0) return 3;
if (strcmp(s, "XL") == 0) return 4;
if (strcmp(s, "XXL") == 0) return 5;
if (strcmp(s, "XXXL") == 0) return 6;
}
struct Segment {
int x, y;
int id;
Segment() {}
Segment(int _x, int _y, int _id) {
x = _x;
y = _y;
id = _id;
}
friend bool operator<(const Segment &a, const Segment &b) {
return a.x < b.x;
}
} l[100100];
int cnt = 0, n;
char ans[100100][10];
int main() {
for (int i = 1; i <= 6; i++) {
scanf("%d", &num[i]);
}
scanf("%d", &n);
cnt = 0;
for (int i = 1; i <= n; i++) {
scanf("%s", str);
int len = strlen(str);
int pos = 0;
for (int j = 0; j < len; j++) {
if (str[j] == ',') {
pos = j;
break;
}
}
if (pos)
l[++cnt] = Segment(find(0, pos), find(pos + 1, len - pos - 1), i);
else {
int x = find(0, len);
if (num[x]) {
strcpy(ans[i], str);
num[x]--;
} else {
puts("NO");
return 0;
}
}
}
sort(l + 1, l + cnt + 1);
for (int i = 1; i <= cnt; i++) {
if (num[l[i].x]) {
num[l[i].x]--;
strcpy(ans[l[i].id], size[l[i].x]);
} else if (num[l[i].y]) {
num[l[i].y]--;
strcpy(ans[l[i].id], size[l[i].y]);
} else {
puts("NO");
return 0;
}
}
puts("YES");
for (int i = 1; i <= n; i++) {
puts(ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int T[6];
int C[72][72] = {0}, R[72][72] = {0}, dis[72], n, u, v, w, s, t, m;
bool BFS(int s, int t) {
for (int i = 0; i < n; ++i) dis[i] = 1e9;
queue<int> q;
q.push(s);
dis[s] = 0;
while (!q.empty()) {
int s = q.front();
q.pop();
for (int i = 0; i < n; ++i)
if (dis[i] == 1e9 && R[s][i] > 0) dis[i] = dis[s] + 1, q.push(i);
}
return dis[t] != 1e9;
}
int DFS(int s, int t, int cur_flow = 1e9) {
if (cur_flow == 0 || s == t) return cur_flow;
int aug_flow = 0, aug = 0;
for (int i = 0; i < n; ++i) {
if (R[s][i] > 0 && dis[s] + 1 == dis[i]) {
aug = DFS(i, t, min(cur_flow, R[s][i]));
R[s][i] -= aug, R[i][s] += aug;
aug_flow += aug;
if (!(cur_flow -= aug)) break;
}
}
return aug_flow;
}
int maximum(int s, int t) {
int aug_sum = 0;
while (BFS(s, t)) aug_sum += DFS(s, t);
return aug_sum;
}
int key(string s) {
if (s == "S") return 1;
if (s == "M") return 2;
if (s == "L") return 4;
if (s == "XL") return 8;
if (s == "XXL") return 16;
if (s == "XXXL") return 32;
return 0;
}
string str;
int part[100000];
string spp[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int main() {
n = 72;
for (int i = 0; i < 6; ++i) {
scanf("%d", &T[i]);
C[0][i + 65] = R[0][i + 65] = T[i];
}
int p;
scanf("%d", &p);
getline(cin, str);
for (int i = 0; i < p; ++i) {
getline(cin, str);
int k = 0;
auto it = str.begin(), it2 = it;
do {
it2 = find(it, str.end(), ',');
k += key(string(it, it2));
it = it2 + 1;
} while (it2 != str.end());
part[i] = k;
++R[k][71], ++C[k][71];
}
for (int i = 0; i < 6; ++i)
for (int j = 1; j < 64; ++j)
if (((j) >> i) % 2) C[i + 65][j] = R[i + 65][j] = 1e9;
int a = maximum(0, 71);
if (a != p)
printf("NO");
else {
printf("YES\n");
for (int i = 0; i < p; ++i) {
int k = part[i];
for (int j = 65; j < 71; ++j) {
if (R[k][j]) {
printf("%s\n", spp[j - 65].c_str());
--R[k][j];
break;
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e5 + 5, mod = 1e9 + 7, bit = 60;
long long int n;
string s, ans[N];
std::vector<pair<long long int, long long int> > q;
map<string, long long int> mp;
vector<string> v = {"S", "M", "L", "XL", "XXL", "XXXL"};
signed main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
long long int i, j, x, freq[6] = {0};
for (i = 0; i < 6; i++) {
mp[v[i]] = i;
cin >> freq[i];
}
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
long long int l = s.length();
for (j = 0; j < l; j++) {
if (s[j] == ',') {
break;
}
}
if (j < l) {
string s1 = s.substr(0, j);
x = mp[s1];
s1 = s.substr(j + 1, l - (j + 1));
x = min(x, mp[s1]);
q.push_back({x, i});
} else {
x = mp[s];
if (freq[x] <= 0) {
return cout << "NO\n", 0;
}
ans[i] = s;
freq[x]--;
}
}
sort(q.begin(), q.end());
i = 0;
j = 0;
while (i < q.size() and j < 6) {
while (j < q[i].first) {
j++;
}
while (j < 6 and freq[j] == 0) {
j++;
}
if (j > q[i].first + 1) {
break;
}
ans[q[i].second] = v[j];
i++;
freq[j]--;
}
if (i != q.size()) {
return cout << "NO\n", 0;
}
cout << "YES\n";
for (i = 0; i < n; i++) {
cout << ans[i] << '\n';
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.