text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
const int maxint = numeric_limits<int>::max();
const long long maxll = numeric_limits<long long>::max();
const int arr = 2e5 + 10;
const int ar = 2e3 + 10;
const long double pi = acos(-1);
const long long md = 1e9 + 7;
const long double eps = 1e-10;
vector<int> vh[10];
map<string, int> up;
map<int, string> up1;
int ukaz[arr];
bool use[arr];
int main() {
up["S"] = 0;
up["M"] = 1;
up["L"] = 2;
up["XL"] = 3;
up["XXL"] = 4;
up["XXXL"] = 5;
for (auto i : up) up1[i.second] = i.first;
vector<int> cnt;
cnt.resize(6);
for (auto &i : cnt) cin >> i;
int n;
cin >> n;
vector<string> ans;
ans.assign(n, "bleat");
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s.find(',') == -1)
cnt[up[s]]--, use[i] = true, ans[i] = s;
else {
string s1 = s.substr(0, s.find(','));
vh[up[s1]].push_back(i);
}
}
for (auto i : cnt)
if (i < 0) return cout << "NO", 0;
for (int i = 0; i < 6; i++) {
if (i != 0) {
while (cnt[i] > 0 && ukaz[i - 1] < vh[i - 1].size()) {
if (use[vh[i - 1][ukaz[i - 1]]]) {
ukaz[i - 1]++;
continue;
}
cnt[i]--;
ans[vh[i - 1][ukaz[i - 1]]] = up1[i];
use[vh[i - 1][ukaz[i - 1]]] = true;
ukaz[i - 1]++;
}
}
while (cnt[i] > 0 && ukaz[i] < vh[i].size()) {
if (use[vh[i][ukaz[i]]]) {
ukaz[i]++;
continue;
}
cnt[i]--;
ans[vh[i][ukaz[i]]] = up1[i];
use[vh[i][ukaz[i]]] = true;
ukaz[i]++;
}
}
for (auto i : ans)
if (i == "bleat") return cout << "NO", 0;
cout << "YES\n";
for (auto i : ans) cout << i << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 11;
const int MAXN = maxn;
const int oo = 0x3f3f3f3f;
long long read() {
long long x = 0, f = 1;
register char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int to[maxn << 1], nxt[maxn << 1], cap[maxn << 1], flow[maxn << 1];
int head[maxn], tot;
void init() {
memset(head, -1, sizeof head);
tot = 0;
}
void add(int u, int v, int w) {
to[tot] = v;
nxt[tot] = head[u];
cap[tot] = w;
flow[tot] = 0;
head[u] = tot++;
swap(u, v);
to[tot] = v;
nxt[tot] = head[u];
cap[tot] = 0;
flow[tot] = 0;
head[u] = tot++;
}
int n, m, s, t;
int dis[maxn], pre[maxn], cur[maxn], gap[maxn];
bool vis[maxn];
struct QUEUE {
int que[maxn];
int front, rear;
void init() { front = rear = 0; }
void push(int u) { que[rear++] = u; }
int pop() { return que[front++]; }
bool empty() { return front == rear; }
} que;
void bfs() {
memset(vis, 0, sizeof vis);
que.init();
que.push(t);
vis[t] = 1;
dis[t] = 0;
while (que.empty() ^ 1) {
int u = que.pop();
for (int i = head[u]; ~i; i = nxt[i]) {
register int v = to[i], c = cap[i ^ 1], f = flow[i ^ 1];
if (!vis[v] && c > f) {
vis[v] = 1;
dis[v] = dis[u] + 1;
que.push(v);
}
}
}
}
int aug() {
int u = t, ans = oo;
while (u != s) {
ans = min(ans, cap[pre[u]] - flow[pre[u]]);
u = to[pre[u] ^ 1];
}
u = t;
while (u != s) {
flow[pre[u]] += ans;
flow[pre[u] ^ 1] -= ans;
u = to[pre[u] ^ 1];
}
return ans;
}
int isap() {
int ans = 0;
bfs();
memset(gap, 0, sizeof gap);
memcpy(cur, head, sizeof head);
for (int i = 1; i <= n; i++) gap[dis[i]]++;
int u = s;
while (dis[s] < n) {
if (u == t) {
ans += aug();
u = s;
}
bool ok = 0;
for (int i = cur[u]; ~i; i = nxt[i]) {
int v = to[i], c = cap[i], f = flow[i];
if (c > f && dis[u] == dis[v] + 1) {
ok = 1;
pre[v] = i;
cur[u] = i;
u = v;
break;
}
}
if (!ok) {
int mn = n - 1;
for (int i = head[u]; ~i; i = nxt[i]) {
int v = to[i], c = cap[i], f = flow[i];
if (c > f) mn = min(mn, dis[v]);
}
if (--gap[dis[u]] == 0) break;
dis[u] = mn + 1;
gap[dis[u]]++;
cur[u] = head[u];
if (u != s) u = to[pre[u] ^ 1];
}
}
return ans;
}
int sz[MAXN];
map<string, int> mp;
string str;
string ss[] = {"XJB", "S", "M", "L", "XL", "XXL", "XXXL"};
int a[MAXN][2];
int check(string &str) {
int pos = -1;
for (int i = 0; i < str.length(); i++) {
if (str[i] == ',') return i;
}
return pos;
}
int main() {
for (register int i = 1; i <= 6; i++) sz[i] = read();
mp["S"] = 1;
mp["M"] = 2;
mp["L"] = 3;
mp["XL"] = 4;
mp["XXL"] = 5;
mp["XXXL"] = 6;
int v = read();
for (register int i = 1; i <= v; i++) {
cin >> str;
int pos = check(str);
if (~pos)
a[i][0] = mp[str.substr(0, pos)], a[i][1] = mp[str.substr(pos + 1)];
else
a[i][0] = mp[str];
}
init();
s = v + 6 + 1;
t = s + 1;
n = t;
for (register int i = 1; i <= 6; i++) add(i + v, t, sz[i]);
for (register int i = 1; i <= v; i++) {
add(i, v + a[i][0], 1);
if (a[i][1]) add(i, v + a[i][1], 1);
add(s, i, 1);
}
long long ans = isap();
if (ans != v) {
printf("NO\n");
return 0;
}
printf("YES\n");
for (register int i = 1; i <= v; i++) {
for (register int j = head[i]; ~j; j = nxt[j]) {
int k = to[j], f = flow[j];
if (k != s && f == 1) {
cout << ss[k - v] << endl;
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int num[10];
int vis[100005];
int change(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;
}
string change2(int s) {
if (s == 0) return "0";
if (s == 1) return "S";
if (s == 2) return "M";
if (s == 3) return "L";
if (s == 4) return "XL";
if (s == 5) return "XXL";
if (s == 6) return "XXXL";
}
struct Per {
int id;
int p1;
int p2;
string trues;
int hex;
} P[100005];
bool cmp(Per a, Per b) {
if ((a.hex == 0 && b.hex == 0) || (a.hex != 0 && b.hex != 0))
return a.p1 < b.p1;
return a.hex < b.hex;
}
bool cmp2(Per a, Per b) { return a.id < b.id; }
int main() {
for (int i = 1; i <= 6; i++) {
cin >> num[i];
}
int n;
cin >> n;
string s;
for (int i = 0; i < n; i++) {
string t1 = "", t2 = "";
P[i].id = i;
cin >> s;
int p = s.length();
for (int i = 0; i < s.length(); i++) {
if (s[i] == ',') {
p = i;
}
}
for (int i = 0; i < p; i++) {
t1 += s[i];
}
for (int i = p + 1; i < s.length(); i++) {
t2 += s[i];
}
if (p == s.length()) {
P[i].hex = 0;
P[i].p1 = change(t1);
} else {
P[i].hex = 1;
P[i].p1 = change(t1);
P[i].p2 = change(t2);
}
}
int flag = 1;
sort(P, P + n, cmp);
for (int i = 0; i < n; i++) {
if (P[i].hex == 0) {
vis[i] = 1;
if (num[P[i].p1] <= 0) {
flag = 0;
break;
}
num[P[i].p1]--;
P[i].trues = change2(P[i].p1);
} else {
if (num[P[i].p1] <= 0 && num[P[i].p2] <= 0) {
flag = 0;
break;
} else if ((num[P[i].p1]) > 0) {
num[P[i].p1]--;
P[i].trues = change2(P[i].p1);
} else if ((num[P[i].p1]) <= 0 && (num[P[i].p2] > 0)) {
num[P[i].p2]--;
P[i].trues = change2(P[i].p2);
}
}
}
if (flag == 0)
cout << "NO" << endl;
else {
cout << "YES" << endl;
sort(P, P + n, cmp2);
int t = n;
int aa = 0;
for (int i = 0; i < n; i++) {
cout << P[i].trues << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
long long res = 1;
while (b) {
if (b % 2) {
res = (res * a) % 1000000007;
}
b /= 2;
a = (a * a) % 1000000007;
}
return res;
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
string arr[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
map<string, long long> mapp;
map<long long, string> revmap;
long long cnt[10];
string ans[100005];
vector<pair<long long, long long> > one, two;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
for (long long i = 0; i < 6; ++i) {
cin >> cnt[i];
mapp[arr[i]] = i;
revmap[i] = arr[i];
}
long long n;
cin >> n;
for (long long i = 1; i <= n; ++i) {
string choices;
cin >> choices;
string temp = "";
long long in = -1;
for (long long j = 0; j < choices.size(); ++j) {
if (choices[j] == ',') {
in = j;
break;
}
}
if (in == -1) {
one.push_back({mapp[choices], i});
} else {
long long choice1, choice2;
for (long long j = 0; j < in; ++j) {
temp += choices[j];
}
choice1 = mapp[temp];
temp = "";
for (long long j = in + 1; j < choices.size(); ++j) {
temp += choices[j];
}
choice2 = mapp[temp];
two.push_back({min(choice1, choice2), i});
}
}
for (auto& elem : one) {
if (cnt[elem.first] > 0) {
cnt[elem.first] -= 1;
ans[elem.second] = revmap[elem.first];
} else {
cout << "NO\n";
return 0;
}
}
sort((two).begin(), (two).end());
for (auto& elem : two) {
if (cnt[elem.first] > 0) {
cnt[elem.first] -= 1;
ans[elem.second] = revmap[elem.first];
} else if (cnt[elem.first + 1] > 0) {
cnt[elem.first + 1] -= 1;
ans[elem.second] = revmap[elem.first + 1];
} else {
cout << "NO\n";
return 0;
}
}
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 a[100005];
int ans[100005];
string s[100005];
map<string, int> h;
vector<pair<int, int> > v;
string res[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int main() {
memset(ans, -1, sizeof(ans));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
h["S"] = 0;
h["M"] = 1;
h["L"] = 2;
h["XL"] = 3;
h["XXL"] = 4;
h["XXXL"] = 5;
for (int i = 0; i < 6; i++) cin >> a[i];
int n;
cin >> n;
bool ok = 1;
for (int i = 1; i <= n; i++) {
cin >> s[i];
string t[2];
t[0] = "";
t[1] = "";
int k = 0;
int m = s[i].length();
for (int j = 0; j < m; j++) {
if (s[i][j] == ',')
k++;
else
t[k] += s[i][j];
}
if (t[1] == "") {
ans[i] = h[t[0]];
a[h[t[0]]]--;
if (a[h[t[0]]] < 0) ok = 0;
} else
v.push_back(pair<int, int>(h[t[0]], i));
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
int j = v[i].second, x = v[i].first;
if (a[x] > 0)
ans[j] = x, a[x]--;
else
ans[j] = x + 1, a[x + 1]--;
}
for (int i = 0; i < 6; i++)
if (a[i] < 0) ok = 0;
if (!ok)
printf("NO\n");
else {
cout << "YES"
<< "\n";
for (int i = 1; i <= n; i++) cout << res[ans[i]] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, m, a[10], b[10];
int g[N];
pair<pair<int, int>, int> p[N];
pair<int, int> q[10];
pair<int, int> ans;
int sum[10];
int kind(char a[]) {
if (a[0] == 'S') return 1;
if (a[0] == 'M') return 2;
if (a[0] == 'L') return 3;
if (strlen(a) == 2) return 4;
if (strlen(a) == 3) return 5;
return 6;
}
int main() {
for (int i = 1; i <= 6; i++) cin >> a[i], b[i] = a[i];
cin >> n;
for (int i = 1; i <= n; i++) {
char ch = getchar();
char tmp[10];
int l = 0;
memset(tmp, 0, sizeof(tmp));
while (ch > 'Z' || ch < 'A') ch = getchar();
while (ch >= 'A' && ch <= 'Z') tmp[l++] = ch, ch = getchar();
if (ch == ',') {
int t1 = kind(tmp), t2;
ch = getchar(), l = 0, memset(tmp, 0, sizeof(tmp));
while (ch > 'Z' || ch < 'A') ch = getchar();
while (ch >= 'A' && ch <= 'Z') tmp[l++] = ch, ch = getchar();
t2 = kind(tmp);
if (t1 > t2) swap(t1, t2);
p[++m] = make_pair(make_pair(t1, t2), i);
} else {
a[kind(tmp)]--, b[kind(tmp)]--;
g[i] = kind(tmp);
if (a[kind(tmp)] < 0) {
puts("NO");
return 0;
}
}
}
sort(p + 1, p + m + 1);
for (int i = 1; i <= 5; i++) q[i] = make_pair(i, i + 1);
for (int i = 1; i <= m; i++)
for (int j = 1; j <= 5; j++)
if (p[i].first == q[j]) sum[j]++;
for (int i = 1; i <= 6; i++)
if (a[i] < 0) {
puts("NO");
return 0;
}
for (int i = 1; i <= 5; i++) {
if (a[i] >= sum[i])
a[i] -= sum[i];
else {
a[i + 1] -= sum[i] - a[i], a[i] = 0;
}
for (int j = 1; j <= 6; j++)
if (a[j] < 0) {
puts("NO");
return 0;
}
}
for (int i = 1; i <= 6; i++)
if (a[i] < 0) {
puts("NO");
return 0;
}
puts("YES");
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= 5; j++)
if (p[i].first == q[j]) {
if (b[j] > a[j])
g[p[i].second] = j, b[j]--;
else
g[p[i].second] = j + 1, b[j + 1]--;
}
}
for (int i = 1; i <= n; i++) {
switch (g[i]) {
case 1:
puts("S");
break;
case 2:
puts("M");
break;
case 3:
puts("L");
break;
case 4:
puts("XL");
break;
case 5:
puts("XXL");
break;
case 6:
puts("XXXL");
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const int N = (int)3e5 + 1;
const int MOD = (int)1e9 + 7;
const int INF = 2e9;
const long long BIG = 1e18;
const int P = 501;
map<string, int> val;
string shirt[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
string a[N];
bool used[N];
map<string, vector<int> > who;
int main() {
int n;
for (int i = 0; i < 6; i++) {
int x;
cin >> x;
val[shirt[i]] = x;
}
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
bool cm = 0;
for (auto x : s)
if (x == ',') cm = 1;
if (!cm) {
used[i] = 1;
a[i] = s;
val[s]--;
if (val[s] < 0) {
puts("NO");
return 0;
}
} else {
who[s].push_back(i);
}
}
for (int i = 0; i < 6; i++) {
if (val[shirt[i]] == 0) continue;
for (int t = 0; t < 2; t++) {
if (t == 0 && i == 0 || (t == 1 && i == 5)) continue;
string cur;
if (t == 0)
cur = shirt[i - 1] + ',' + shirt[i];
else
cur = shirt[i] + ',' + shirt[i + 1];
for (auto x : who[cur]) {
if (!used[x] && val[shirt[i]] > 0) {
used[x] = 1;
a[x] = shirt[i];
val[shirt[i]]--;
}
}
}
}
for (int i = 0; i < n; i++)
if (!used[i]) return puts("NO");
puts("YES");
for (int i = 0; i < n; i++) {
cout << a[i] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[6];
vector<string> sizes_list = {"S", "M", "L", "XL", "XXL", "XXXL"};
map<string, int> num = {{"S", 0}, {"M", 1}, {"L", 2},
{"XL", 3}, {"XXL", 4}, {"XXXL", 5}};
int main() {
for (int i = 0; i < 6; i++) {
cin >> cnt[i];
}
int n;
cin >> n;
vector<tuple<int, int, int>> a(n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int j = s.find(',');
if (j == s.size()) {
get<0>(a[i]) = num[s];
get<1>(a[i]) = -1;
} else {
get<0>(a[i]) = num[s.substr(0, j)];
get<1>(a[i]) = num[s.substr(j + 1, s.size() - j - 1)];
}
get<2>(a[i]) = i;
}
sort(a.begin(), a.end());
vector<int> ans(n);
for (int i = 0; i < n; i++) {
if (cnt[get<0>(a[i])] > 0) {
ans[get<2>(a[i])] = get<0>(a[i]);
--cnt[get<0>(a[i])];
} else {
if (get<1>(a[i]) == -1 || cnt[get<1>(a[i])] == 0) {
cout << "NO";
return 0;
}
ans[get<2>(a[i])] = get<1>(a[i]);
--cnt[get<1>(a[i])];
}
}
cout << "YES\n";
for (int& i : ans) {
cout << sizes_list[i] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e18;
const double eps = 1e-10;
const int inf = 0x3f3f3f3f;
const int mif = 0xcfcfcfcf;
const double PI = 3.14159265358979323846264338;
long long mul_mod(long long first, long long second) {
long long t = 0;
while (second) {
if (second & 1) t = (t + first) % mod;
first = (first + first) % mod;
second >>= 1;
}
return t;
}
long long pow_mod(long long first, long long second) {
long long t = 1;
while (second) {
if (second & 1) t = mul_mod(t, first);
first = mul_mod(first, first);
second >>= 1;
}
return t;
}
long long quick_pow(long long first, long long second) {
long long t;
for (t = 1; second; second >>= 1, first *= first)
if (second & 1) t *= first;
return t;
}
long long gcd(long long first, long long second) {
return second ? gcd(second, first % second) : first;
}
double LG(double s, double k) { return log(k) / log(s); }
long long read() {
long long c = 0, f = 1ll;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
c = c * 10 + ch - '0';
ch = getchar();
}
return c * f;
}
const int N = 1100000;
int n;
int num[6];
string a[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
string b[5] = {"S,M", "M,L", "L,XL", "XL,XXL", "XXL,XXXL"};
string s[100005];
int main() {
for (int i = 0; i < 6; ++i) {
num[i] = read();
}
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s[i];
for (int j = 0; j < 6; ++j) {
if (s[i] == a[j]) {
--num[j];
if (num[j] < 0) {
puts("NO");
return 0;
}
break;
}
}
}
for (int j = 0; j < 5; ++j) {
for (int i = 0; i < n; ++i) {
if (s[i] == b[j]) {
if (num[j] > 0) {
--num[j];
s[i] = a[j];
} else if (num[j + 1] > 0) {
--num[j + 1];
s[i] = a[j + 1];
} else {
puts("NO");
return 0;
}
}
}
}
puts("YES");
for (int i = 0; i < n; ++i) cout << s[i] << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
string s[8] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int a[8], b[8], c[1 << 17][2];
int buf[8][2];
int cal(string st) {
for (int i = 0; i < 6; ++i)
if (s[i] == st) return i;
}
int main() {
int n;
string t;
memset(c, -1, sizeof(c));
for (int i = 0; i < 6; ++i) scanf("%d", &a[i]);
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
cin >> t;
int pos = t.find(",", 0);
if (pos == string::npos) {
int id = cal(t);
if (--a[id] < 0)
return 0 * puts("NO");
else
c[i][0] = id;
} else {
int id = cal(t.substr(0, pos));
++b[id];
c[i][1] = id;
}
}
for (int i = 0; i < 5; ++i) {
if (b[i]) {
int imin = min(b[i], a[i]);
a[i] -= imin, b[i] -= imin;
buf[i][0] = imin;
imin = min(b[i], a[i + 1]);
a[i + 1] -= imin;
b[i] -= imin;
buf[i][1] = imin;
if (b[i]) return 0 * puts("NO");
}
}
puts("YES");
for (int i = 0; i < n; ++i) {
if (c[i][0] != -1)
cout << s[c[i][0]] << endl;
else {
if (buf[c[i][1]][0] > 0) {
--buf[c[i][1]][0];
cout << s[c[i][1]] << endl;
} else {
--buf[c[i][1]][1];
cout << s[c[i][1] + 1] << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[6], ans[100001];
pair<int, int> arr[100001];
bool given[100001];
string tshirt[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int match(string s) {
for (int i = 0; i < 6; i++) {
if (tshirt[i] == s) return i;
}
}
void convert(int ind, string s) {
string tmp;
bool flag = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ',') {
flag = 1;
arr[ind].first = match(tmp);
tmp.clear();
} else
tmp.push_back(s[i]);
}
if (flag) {
arr[ind].second = match(tmp);
if (arr[ind].first > arr[ind].second) swap(arr[ind].first, arr[ind].second);
} else {
arr[ind].first = match(tmp);
arr[ind].second = -1;
}
return;
}
bool cal_ans(int n) {
for (int i = 0; i < n; i++) {
if (arr[i].second == -1) {
if (cnt[arr[i].first] == 0) return false;
ans[i] = arr[i].first;
cnt[arr[i].first]--;
given[i] = 1;
}
}
for (int j = 0; j < 5; j++) {
for (int i = 0; i < n; i++) {
if (given[i] == 0 and arr[i].first == j) {
if (cnt[arr[i].first]) {
cnt[arr[i].first]--;
ans[i] = j;
} else {
if (cnt[arr[i].second]) {
cnt[arr[i].second]--;
ans[i] = arr[i].second;
} else
return false;
}
given[i] = 1;
}
}
}
return 1;
}
int main() {
ios::sync_with_stdio(false);
for (int i = 0; i < 6; i++) cin >> cnt[i];
int n;
cin >> n;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
convert(i, s);
}
if (cal_ans(n)) {
cout << "YES\n";
for (int i = 0; i < n; i++) {
cout << tshirt[ans[i]] << endl;
}
} else {
cout << "NO";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
bool p = true;
vector<int> a(6);
for (int i = 0; i < 6; ++i) cin >> a[i];
cin >> n;
vector<string> b = {"S", "M", "L", "XL", "XXL", "XXXL"};
vector<vector<int>> sh(6);
vector<string> ans(n, "#");
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
vector<string> in;
int br = 0, sz = 0;
for (int j = 0; j < s.size(); ++j) {
sz++;
if (s[j] == ',') in.push_back(s.substr(br, sz - 1)), br = j + 1, sz = 0;
}
in.push_back(s.substr(br, sz));
if (in.size() == 1) {
for (int j = 0; j < 6; ++j) {
if (in[0] == b[j]) a[j]--, ans[i] = b[j];
if (a[j] < 0) p = false;
}
} else
for (int j = 0; j < 6; ++j) {
if (in[0] == b[j]) sh[j].push_back(i);
if (in[1] == b[j]) sh[j].push_back(i);
}
}
for (int i = 0; i < 6; ++i) {
if (i > 0) {
for (int j = 0; j < sh[i - 1].size(); ++j) {
if (ans[sh[i - 1][j]] == "#") {
ans[sh[i - 1][j]] = b[i];
a[i]--;
if (a[i] < 0) p = false;
}
}
}
for (int j = 0; j < sh[i].size(); ++j) {
if (ans[sh[i][j]] == "#") {
if (i < 5 && a[i] == 0) break;
ans[sh[i][j]] = b[i];
a[i]--;
if (i == 5 && a[i] < 0) p = false;
}
}
}
if (!p)
cout << "NO";
else {
cout << "YES\n";
for (const string& k : ans) cout << k << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int arr[6], n;
vector<int> neigh[6];
string result[100001];
memset(neigh, 0, sizeof neigh);
map<string, int> m;
map<int, string> mis;
mis[0] = "S";
mis[1] = "M";
mis[2] = "L";
mis[3] = "XL";
mis[4] = "XXL";
mis[5] = "XXXL";
m["S"] = 0;
m["M"] = 1;
m["L"] = 2;
m["XL"] = 3;
m["XXL"] = 4;
m["XXXL"] = 5;
string s;
for (int i = 0; i < 6; i++) {
cin >> arr[i];
}
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
string temp1, temp2;
bool ok = false;
for (int j = 0; j < s.size(); j++) {
if (s[j] == ',') {
ok = true;
continue;
}
if (ok == false)
temp1.push_back(s[j]);
else
temp2.push_back(s[j]);
}
if (temp2.empty()) {
arr[m[temp1]]--;
result[i] = temp1;
} else {
neigh[m[temp1]].push_back(i);
}
}
for (int i = 0; i < 6; i++) {
if (arr[i] < 0) {
cout << "NO";
return 0;
}
if (neigh[i].size() <= arr[i]) {
for (int j = 0; j < neigh[i].size(); j++) {
result[neigh[i][j]] = mis[i];
}
continue;
}
if (i < 5) {
arr[i + 1] -= neigh[i].size() - arr[i];
for (int j = 0; j < arr[i]; j++) {
result[neigh[i][j]] = mis[i];
}
for (int j = arr[i]; j < neigh[i].size(); j++) {
result[neigh[i][j]] = mis[i + 1];
}
} else {
cout << "NO";
return 0;
}
}
cout << "YES\n";
for (int i = 0; i < n; i++) {
cout << result[i] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
int source, sink, NN, n, m;
int Q[200007], fin[200007], pro[200007], dist[200007], nEdge;
int flow[1000007], cap[1000007], nex[1000007], to[1000007];
void init(int _source, int _sink) {
source = _source, sink = NN = _sink, nEdge = 0;
for (int i = 0; i <= NN; i++) fin[i] = -1;
}
void addEdge(int u, int v, int c) {
to[nEdge] = v;
cap[nEdge] = c;
flow[nEdge] = 0;
nex[nEdge] = fin[u];
fin[u] = nEdge++;
to[nEdge] = u;
cap[nEdge] = 0;
flow[nEdge] = 0;
nex[nEdge] = fin[v];
fin[v] = nEdge++;
}
bool bfs() {
int st, en;
for (int i = 0; i <= NN; i++) dist[i] = -1;
dist[source] = st = en = 0;
Q[en++] = source;
while (st < en) {
int u = Q[st++];
for (int i = fin[u]; i >= 0; i = nex[i]) {
int v = to[i];
if (flow[i] < cap[i] && dist[v] == -1) {
dist[v] = dist[u] + 1;
Q[en++] = v;
}
}
}
return dist[sink] != -1;
}
int dfs(int u, int fl) {
if (u == sink) return fl;
for (int &i = pro[u]; i >= 0; i = nex[i]) {
int v = to[i];
if (flow[i] < cap[i] && dist[v] == dist[u] + 1) {
int df = dfs(v, min(cap[i] - flow[i], fl));
if (df > 0) {
flow[i] += df;
flow[i ^ 1] -= df;
return df;
}
}
}
return 0;
}
int dinic() {
int ret = 0;
for (int i = 0; i < nEdge; i++) flow[i] = 0;
while (bfs()) {
for (int i = 0; i <= NN; i++) pro[i] = fin[i];
while (true) {
int df = dfs(source, 100000000);
if (df)
ret += df;
else
break;
}
}
return ret;
}
map<string, int> mp;
int ed[100007][10];
int main() {
int x[10], l, i, j;
string ss;
char s[100];
string st[10];
st[1] = "S";
mp[st[1]] = 1;
st[2] = "M";
mp[st[2]] = 2;
st[3] = "L";
mp[st[3]] = 3;
st[4] = "XL";
mp[st[4]] = 4;
st[5] = "XXL";
mp[st[5]] = 5;
st[6] = "XXXL";
mp[st[6]] = 6;
for (i = 1; i <= 6; i++) {
scanf("%d", &x[i]);
}
scanf("%d", &n);
init(0, n + 7);
for (i = 1; i <= 6; i++) addEdge(source, i, x[i]);
for (i = 1; i <= n; i++) {
addEdge(6 + i, sink, 1);
scanf("%s", s);
l = strlen(s);
ss = "";
for (j = 0; j < l; j++) {
if (s[j] == ',') break;
ss += s[j];
}
ed[i][mp[ss]] = nEdge;
addEdge(mp[ss], 6 + i, 1);
if (j < l) {
ss = "";
for (++j; j < l; j++) {
ss += s[j];
}
ed[i][mp[ss]] = nEdge;
addEdge(mp[ss], 6 + i, 1);
}
}
if (dinic() == n) {
printf("YES\n");
for (i = 1; i <= n; i++)
for (j = 1; j <= 6; j++)
if (ed[i][j])
if (flow[ed[i][j]]) cout << st[j] << endl;
} else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int lim[55];
int n;
char s[55];
pair<int, int> v[111111];
int ans[111111];
int calc(int l, int r) {
if (r > l) return r - l + 2;
if (s[l] == 'S') return 0;
if (s[l] == 'M') return 1;
return 2;
}
void require(int pos, int x) {
ans[pos] = x;
lim[x]--;
}
void prt(int id) {
if (id == 0)
printf("S\n");
else if (id == 1)
printf("M\n");
else if (id == 2)
printf("L\n");
else if (id == 3)
printf("XL\n");
else if (id == 4)
printf("XXL\n");
else if (id == 5)
printf("XXXL\n");
}
int main() {
for (int i = 0; i < 6; i++) scanf("%d", &lim[i]);
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", s);
int p = -1, len = strlen(s);
for (int j = 0; s[j]; j++)
if (s[j] == ',') p = j;
if (p >= 0) {
int a = calc(0, p - 1);
int b = calc(p + 1, len - 1);
if (a > b) swap(a, b);
v[i] = make_pair(a, b);
} else {
int a = calc(0, len - 1);
require(i, a);
v[i] = make_pair(-1, -1);
}
}
for (int t = 0; t < 6; t++)
for (int i = 0; i < n; i++) {
int a = v[i].first, b = v[i].second;
if (a < 0 || a != t) continue;
if (lim[a] > 0)
require(i, a);
else
require(i, b);
}
bool chk = true;
for (int i = 0; i < 6; i++)
if (lim[i] < 0) chk = false;
printf("%s\n", chk ? "YES" : "NO");
if (chk)
for (int i = 0; i < n; i++) prt(ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int v[112345];
int cnt[6];
map<string, int> mapa;
map<int, string> mapa2;
int s, t;
int flow[20][20];
vector<int> g[20];
int pai[20];
bool bfs() {
queue<int> q;
q.push(s);
memset(pai, -1, sizeof pai);
pai[s] = -2;
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = 0; i < g[x].size(); i++) {
int y = g[x][i];
if (pai[y] == -1 && flow[x][y]) {
pai[y] = x;
q.push(y);
if (y == t) return true;
}
}
}
return false;
}
int maxflow() {
int total = 0;
while (bfs()) {
int f = 112345;
int x = t;
while (x != s) {
f = min(f, flow[pai[x]][x]);
x = pai[x];
}
x = t;
while (x != s) {
flow[pai[x]][x] -= f;
flow[x][pai[x]] += f;
x = pai[x];
}
total += f;
}
return total;
}
int main() {
mapa["S"] = 0;
mapa["M"] = 1;
mapa["L"] = 2;
mapa["XL"] = 3;
mapa["XXL"] = 4;
mapa["XXXL"] = 5;
mapa["S,M"] = 6;
mapa["M,L"] = 7;
mapa["L,XL"] = 8;
mapa["XL,XXL"] = 9;
mapa["XXL,XXXL"] = 10;
mapa2[0] = "S";
mapa2[1] = "M";
mapa2[2] = "L";
mapa2[3] = "XL";
mapa2[4] = "XXL";
mapa2[5] = "XXXL";
pair<int, int> ord[112345];
for (int i = 0; i < 6; i++) scanf("%d", &cnt[i]);
bool flag = true;
scanf("%d", &n);
int cntAux = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int aux = mapa[s];
if (aux < 6) {
if (cnt[aux] <= 0) {
printf("NO\n");
return 0;
} else {
cnt[aux]--;
}
cntAux++;
} else {
flow[0][aux - 5]++;
}
v[i] = aux;
ord[i] = make_pair(aux, i);
}
g[0].push_back(1);
g[0].push_back(2);
g[0].push_back(3);
g[0].push_back(4);
g[0].push_back(5);
g[1].push_back(0);
g[1].push_back(6);
g[1].push_back(7);
g[2].push_back(0);
g[2].push_back(7);
g[2].push_back(8);
g[3].push_back(0);
g[3].push_back(8);
g[3].push_back(9);
g[4].push_back(0);
g[4].push_back(9);
g[4].push_back(10);
g[5].push_back(0);
g[5].push_back(10);
g[5].push_back(11);
g[6].push_back(1);
g[6].push_back(12);
g[7].push_back(1);
g[7].push_back(2);
g[7].push_back(12);
g[8].push_back(2);
g[8].push_back(3);
g[8].push_back(12);
g[9].push_back(3);
g[9].push_back(4);
g[9].push_back(12);
g[10].push_back(4);
g[10].push_back(5);
g[10].push_back(12);
g[11].push_back(5);
g[11].push_back(12);
sort(ord, ord + n);
for (int i = 1; i <= 5; i++) {
flow[i][i + 5] = 112345;
flow[i][i + 6] = 112345;
}
for (int i = 0; i < 6; i++) {
flow[i + 6][12] = cnt[i];
}
s = 0, t = 12;
int mf = maxflow();
if (mf + cntAux == n) {
puts("YES");
for (int i = 0; i < n; i++) {
if (ord[i].first >= 6) {
int aux = ord[i].first - 6;
if (cnt[aux] > 0) {
cnt[aux]--;
v[ord[i].second] = aux;
} else {
cnt[aux + 1]--;
v[ord[i].second] = aux + 1;
}
}
}
for (int i = 0; i < n; i++) {
cout << mapa2[v[i]] << endl;
}
} else {
puts("NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, int> hah;
int ch[100002];
int main() {
ios_base::sync_with_stdio(0);
int i, j, x, n, cnt = 0, m, y, k, g, flg;
string s, cs;
string heh[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
vector<pair<int, pair<int, int> > > v;
pair<int, pair<int, int> > d;
hah["S"] = 1;
hah["M"] = 2;
hah["L"] = 3;
hah["XL"] = 4;
hah["XXL"] = 5;
hah["XXXL"] = 6;
int ns[7];
for (i = 1; i <= 6; i++) {
cin >> ns[i];
}
cin >> n;
int an[n + 1];
for (i = 1; i <= n; i++) {
cin >> s;
cs.clear();
d.first = i;
flg = 0;
for (j = 0; j <= s.size() - 1; j++) {
if (s[j] == ',') {
flg = 1;
x = hah[cs];
cs.clear();
} else
cs += s[j];
}
y = hah[cs];
if (flg) {
d.second.first = max(x, y);
d.second.second = min(x, y);
v.push_back(d);
} else {
ns[y]--;
an[i] = y;
ch[i] = 1;
}
}
for (i = 6; i >= 1; i--) {
if (ns[i] < 0) {
cout << "NO";
return 0;
}
if (v.size() == 0) continue;
for (j = 0; j <= v.size() - 1; j++) {
if (ns[i] == 0) break;
if (ch[v[j].first]) continue;
if (v[j].second.second == i) {
an[v[j].first] = i;
ns[i]--;
ch[v[j].first] = 1;
}
}
for (j = 0; j <= v.size() - 1; j++) {
if (ns[i] == 0) break;
if (ch[v[j].first]) continue;
if (v[j].second.first == i) {
an[v[j].first] = i;
ns[i]--;
ch[v[j].first] = 1;
}
}
}
for (i = 1; i <= n; i++) {
if (!ch[i]) {
cout << "NO";
return 0;
}
}
cout << "YES\n";
for (i = 1; i <= n; i++) {
cout << heh[an[i] - 1] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, int> m;
pair<pair<long long, long long>, int> A[100000];
int ans[100000];
int main() {
ios_base::sync_with_stdio(0);
int T[7];
T[0] = 0;
for (int i = 1; i < 7; ++i) cin >> T[i];
int n;
cin >> n;
m["S"] = 1;
m["M"] = 2;
m["L"] = 3;
m["XL"] = 4;
m["XXL"] = 5;
m["XXXL"] = 6;
string s;
int tmp;
for (int i = 0; i < n; ++i) {
cin >> s;
if (s.find(',') == -1)
A[i] = pair<pair<long long, long long>, int>(
pair<long long, long long>(0, m[s]), i);
else {
tmp = m[s.substr(0, s.find(','))];
A[i] = pair<pair<long long, long long>, int>(
pair<long long, long long>(tmp, tmp + 1), i);
}
}
sort(A, A + n);
for (int i = 0; i < n; ++i) {
if (T[A[i].first.first]) {
--T[A[i].first.first];
ans[A[i].second] = A[i].first.first;
} else if (T[A[i].first.second]) {
--T[A[i].first.second];
ans[A[i].second] = A[i].first.second;
} else
return cout << "NO", 0;
}
string K[7] = {"", "S", "M", "L", "XL", "XXL", "XXXL"};
cout << "YES\n";
for (int i = 0; i < n; ++i) {
cout << K[ans[i]] << '\n';
}
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 {
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;
const int adj[8][2] = {{-1, 0}, {0, -1}, {1, 0}, {0, 1},
{-1, -1}, {-1, 1}, {1, 1}, {1, -1}};
const long long int LLINF = 9e18;
const int INF = 2e9;
const int MOD = 1e9 + 7;
const double EPS = 1e-10;
const double PI = acos(-1);
const int SIZE = 100011;
int N;
int cnt[SIZE];
map<string, int> Mp;
string ts[8] = {"S", "M", "L", "XL", "XXL", "XXXL"};
string s;
struct edge {
int v, f, c, u;
};
vector<edge> E[SIZE];
int st[SIZE], lvl[SIZE];
void init() {
for (int i = 0; i < SIZE; i++) {
cnt[i] = 0;
E[i].clear();
}
}
void addedge(int a, int b, int ca, int cb) {
edge A = {a, 0, ca, (int)E[a].size()};
edge B = {b, 0, cb, (int)E[b].size()};
E[a].push_back(B);
E[b].push_back(A);
}
bool BFS(int S, int T) {
memset(lvl, -1, sizeof(lvl));
queue<int> q;
q.push(S);
lvl[S] = 0;
while (!q.empty()) {
int indx = q.front();
q.pop();
for (unsigned int i = 0; i < E[indx].size(); i++) {
edge &t = E[indx][i];
int idx = t.v;
if (lvl[idx] < 0 && t.c > t.f) {
lvl[idx] = lvl[indx] + 1;
q.push(idx);
}
}
}
return lvl[T] >= 0;
}
int DFS(int indx, int T, int flow) {
if (indx == T) return flow;
for (int &i = st[indx]; i < (int)E[indx].size(); i++) {
edge &t = E[indx][i];
int idx = t.v;
if (lvl[idx] == lvl[indx] + 1 && t.c > t.f) {
int cur = min(flow, t.c - t.f);
int ret = DFS(idx, T, cur);
if (ret > 0) {
t.f += ret;
E[t.v][t.u].f -= ret;
return ret;
}
}
}
return 0;
}
int Dinic(int S, int T) {
int ret = 0;
while (BFS(S, T)) {
memset(st, 0, sizeof(st));
while (int flow = DFS(S, T, INF)) {
ret += flow;
}
}
return ret;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int S = 0, T = SIZE - 1, a;
init();
for (int i = 1; i <= 6; i++) {
cin >> a;
Mp[ts[i - 1]] = i;
addedge(i, T, 0, a);
}
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> s;
s += ",";
string temp = "";
for (unsigned int j = 0; j < s.size(); j++) {
if (s[j] == ',') {
addedge(i + 6, Mp[temp], 0, 1);
temp.clear();
cnt[i + 6]++;
} else
temp.push_back(s[j]);
}
addedge(S, i + 6, 0, 1);
}
int ans = Dinic(S, T);
if (ans != N)
cout << "NO" << endl;
else {
cout << "YES" << endl;
for (int i = 1; i <= N; i++) {
edge t1, t2;
if (cnt[i + 6] == 1) {
t1 = E[i + 6][0];
cout << ts[t1.v - 1] << endl;
} else {
t1 = E[i + 6][0];
t2 = E[i + 6][1];
if (t1.f == 1)
cout << ts[t1.v - 1] << endl;
else if (t2.f == 1)
cout << ts[t2.v - 1] << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
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;
int vis[10000] = {0};
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;
}
void dfs2(int s) {
vis[s] = 1;
for (int id : adj[s]) {
int u = edges[id].u;
if (!vis[u] && edges[id].flow < edges[id].cap) dfs2(u);
}
}
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;
}
};
const int inf = 9999999;
int main() {
vector<int> shirts;
vector<string> ans(100001);
int x, n;
for (int i = 0; i < 6; i++) {
cin >> x;
shirts.push_back(x);
}
cin >> n;
int manda = 0, chega = 7 + n;
Dinic d(chega + 1, manda, chega);
for (int i = 0; i < n; i++) {
string s;
int flag = 0;
cin >> s;
string s1, s2;
for (int j = 0; j < s.size(); j++) {
if (s[j] != ',' && flag == 0)
s1.push_back(s[j]);
else if (s[j] != ',' && flag == 1)
s2.push_back(s[j]);
else {
flag = 1;
}
}
vector<string> vt;
if (flag == 1) {
vt.push_back(s1);
vt.push_back(s2);
} else
vt.push_back(s1);
for (int j = 0; j < vt.size(); j++) {
if (vt[j] == "S")
d.add_edge(1, 7 + i, inf);
else if (vt[j] == "M")
d.add_edge(2, 7 + i, inf);
else if (vt[j] == "L")
d.add_edge(3, 7 + i, inf);
else if (vt[j] == "XL")
d.add_edge(4, 7 + i, inf);
else if (vt[j] == "XXL")
d.add_edge(5, 7 + i, inf);
else
d.add_edge(6, 7 + i, inf);
}
}
for (int i = 0; i < 6; i++) d.add_edge(manda, i + 1, shirts[i]);
for (int i = 0; i < n; i++) d.add_edge(7 + i, chega, 1);
int flx = d.flow();
if (flx == n) {
cout << "YES" << endl;
for (int i = 0; i < d.edges.size(); i += 2) {
if (d.edges[i].v >= 1 && d.edges[i].v <= 6 && d.edges[i].flow == 1) {
if (d.edges[i].v == 1)
ans[d.edges[i].u - 7] = "S";
else if (d.edges[i].v == 2)
ans[d.edges[i].u - 7] = "M";
else if (d.edges[i].v == 3)
ans[d.edges[i].u - 7] = "L";
else if (d.edges[i].v == 4)
ans[d.edges[i].u - 7] = "XL";
else if (d.edges[i].v == 5)
ans[d.edges[i].u - 7] = "XXL";
else
ans[d.edges[i].u - 7] = "XXXL";
}
}
for (int i = 0; i < n; i++) cout << ans[i] << endl;
} else
cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, cnt[6];
string s[100001], r[5] = {"S,M", "M,L", "L,XL", "XL,XXL", "XXL,XXXL"},
re[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int main() {
for (int i = 0; i < 6; i++) cin >> cnt[i];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
if (s[i] == "S") cnt[0]--;
if (s[i] == "M") cnt[1]--;
if (s[i] == "L") cnt[2]--;
if (s[i] == "XL") cnt[3]--;
if (s[i] == "XXL") cnt[4]--;
if (s[i] == "XXXL") cnt[5]--;
}
for (int i = 0; i < 6; i++)
if (cnt[i] < 0) cout << "NO", exit(0);
for (int t = 0; t < 5; t++) {
for (int i = 0; i < n; i++) {
if (s[i] != r[t]) continue;
if (cnt[t] > 0) {
cnt[t]--;
s[i] = re[t];
continue;
}
if (cnt[t + 1] > 0) {
cnt[t + 1]--;
s[i] = re[t + 1];
continue;
}
cout << "NO";
exit(0);
}
}
cout << "YES" << endl;
for (int i = 0; i < n; i++) cout << s[i] << endl;
}
|
#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>
using namespace std;
const int inf = 1e9 + 7;
const int N = 1e6 + 5;
map<string, int> mp;
int b[N], c[N], ans[N];
int main() {
mp["S"] = 1;
mp["M"] = 2;
mp["L"] = 3;
mp["XL"] = 4;
mp["XXL"] = 5;
mp["XXXL"] = 6;
int n, a[10];
for (int i = 1; i <= 6; i++) cin >> a[i];
cin >> n;
string r;
getline(cin, r);
for (int i = 1; i <= n; i++) {
string t, p = "";
getline(cin, t);
bool f = false;
for (int j = 0; j < t.size(); j++) {
if (t[j] == ',') {
b[i] = mp[p];
p = "";
f = true;
continue;
}
p += t[j];
if (j + 1 == t.size()) {
if (!f)
b[i] = mp[p];
else
c[i] = mp[p];
}
}
}
for (int i = 1; i <= n; i++) {
if (c[i] == 0) {
int d = --a[b[i]];
ans[i] = b[i];
b[i] = 0;
if (d < 0) {
cout << "NO" << endl;
return 0;
}
}
}
for (int i = 1; i < 6; i++) {
for (int j = 1; j <= n; j++) {
if (b[j] == 0) continue;
if (b[j] == i) {
if (a[i] > 0)
a[i]--, ans[j] = i;
else if (a[i + 1] > 0)
a[i + 1]--, ans[j] = i + 1;
else {
cout << "NO" << endl;
return 0;
}
b[j] = 0;
c[j] = 0;
}
}
}
cout << "YES" << endl;
for (int i = 1; i <= n; i++) {
if (ans[i] == 1)
cout << "S" << endl;
else if (ans[i] == 2)
cout << "M" << endl;
else if (ans[i] == 3)
cout << "L" << endl;
else if (ans[i] == 4)
cout << "XL" << endl;
else if (ans[i] == 5)
cout << "XXL" << endl;
else if (ans[i] == 6)
cout << "XXXL" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[6];
int n;
char s[1010];
unordered_map<string, int> m;
string ans[101010];
string rev[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int main() {
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", a + i);
}
vector<pair<int, pair<int, int> > > v;
bool can = true;
scanf("%d", &n);
for (int i = 0; can && i < n; ++i) {
scanf("%s", s);
string tmp = "";
bool comma = false;
for (int j = 0; s[j]; ++j) {
if (s[j] == ',') {
v.push_back({m[tmp], {0, i}});
tmp = "";
comma = true;
} else
tmp = tmp + s[j];
}
if (!comma) {
if (--a[m[tmp]] < 0)
can = false;
else {
ans[i] = tmp;
}
} else {
v.push_back({m[tmp], {-1, i}});
}
}
sort(v.begin(), v.end());
for (int i = 0; can && i < v.size(); ++i) {
if (a[v[i].first] > 0 && ans[v[i].second.second] == "") {
ans[v[i].second.second] = rev[v[i].first];
--a[v[i].first];
}
}
for (int i = 0; can && i < n; ++i) {
if (ans[i] == "") {
can = false;
}
}
if (!can)
printf("NO\n");
else {
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;
vector<int> v[100001];
int give(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;
}
int a[6];
int main() {
int N, i, j;
for (i = 0; i < 6; i++) cin >> a[i];
cin >> N;
int c = 1;
for (j = 1; j <= N; j++) {
string s;
cin >> s;
string t;
for (i = 0; i < s.length(); i++) {
if (s[i] != ',')
t.push_back(s[i]);
else {
v[c].push_back(give(t));
t.clear();
}
}
v[c].push_back(give(t));
c++;
}
for (i = 0; i < 6; i++) {
for (j = 1; j <= N; j++) {
if (v[j][0] == i && v[j].size() == 1) a[i]--;
}
if (a[i] < 0) {
cout << "NO\n";
return 0;
}
for (j = 1; j <= N && a[i] > 0; j++) {
if (v[j][0] == i && v[j].size() == 2) {
v[j].pop_back();
a[i]--;
}
}
for (j = 1; j <= N; j++) {
if (v[j][0] == i && v[j].size() == 2) {
v[j][0] = v[j][1];
v[j].pop_back();
}
}
}
cout << "YES\n";
for (i = 1; i <= N; i++) {
switch (v[i][0]) {
case 0:
cout << "S\n";
break;
case 1:
cout << "M\n";
break;
case 2:
cout << "L\n";
break;
case 3:
cout << "XL\n";
break;
case 4:
cout << "XXL\n";
break;
case 5:
cout << "XXXL\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INFTY = 20000000;
const int MAX = 500100;
const int MOD = 10000000;
void coutTab(int* tab, int n) {
for (int i = 0; i < n; i++) {
cout << tab[i] << " ";
}
cout << "\n";
}
template <class T>
void coutVec(vector<T> tab) {
for (T t : tab) {
cout << t << " ";
}
cout << "\n";
}
vector<pair<int, int> > ek_bfs(vector<vector<int> >& G,
vector<vector<int> >& capacity,
vector<vector<int> >& flow, int n, int source,
int sink) {
vector<pair<int, int> > p(n);
vector<int> visited(n);
for (int i = 0; i < n; i++) {
visited[i] = false;
p[i] = {-1, -1};
}
queue<int> Q;
Q.push(source);
while (!Q.empty()) {
int v = Q.front();
Q.pop();
for (int i = 0; i < G[v].size(); i++) {
if (!visited[G[v][i]]) {
if (capacity[v][G[v][i]] - flow[v][G[v][i]] > 0) {
visited[G[v][i]] = true;
p[G[v][i]] = {v, capacity[v][G[v][i]] - flow[v][G[v][i]]};
Q.push(G[v][i]);
} else if (flow[G[v][i]][v] > 0) {
visited[G[v][i]] = true;
p[G[v][i]] = {v, flow[G[v][i]][v]};
Q.push(G[v][i]);
}
}
}
}
vector<pair<int, int> > path;
path.push_back({sink, 0});
pair<int, int> v = p[sink];
while (v.first != -1) {
path.push_back(v);
v = p[v.first];
}
reverse((path).begin(), (path).end());
return path;
}
int find_min(vector<pair<int, int> > path) {
int mini = INFTY;
for (int i = 0; i < path.size() - 1; i++) {
mini = min(mini, path[i].second);
}
return mini;
}
vector<vector<int> > edmonds_karp(vector<vector<int> >& G,
vector<vector<int> >& capacity, int n,
int source, int sink) {
vector<vector<int> > flow(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
flow[i][j] = 0;
}
}
vector<pair<int, int> > path;
while ((path = ek_bfs(G, capacity, flow, n, source, sink)).size() > 1) {
int mini = find_min(path);
for (int i = 0; i < path.size() - 1; i++) {
int v = path[i].first;
int u = path[i + 1].first;
flow[v][u] += mini;
}
}
return flow;
}
string sizes[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
const int sizes_count = 6;
int toNum(string s) {
for (int i = 0; i < sizes_count; i++)
if (s == sizes[i]) return i;
for (int i = 0; i < sizes_count; i++)
if (s.find(sizes[i], 0) == 0) return i + sizes_count;
return -1;
}
string fromNum(int i) { return sizes[i]; }
int c_siz[sizes_count];
int c_tsh[2 * sizes_count - 1];
vector<vector<int> > G(4 * sizes_count);
vector<vector<int> > C(4 * sizes_count, vector<int>(4 * sizes_count));
void build_graph() {
for (int i = 1; i < 2 * sizes_count; i++) {
G[0].push_back(i);
C[0][i] = c_tsh[i - 1];
}
const int sink = 3 * sizes_count;
for (int i = 2 * sizes_count; i < sink; i++) {
G[i].push_back(sink);
C[i][sink] = c_siz[i - 2 * sizes_count];
}
for (int i = 1; i < sizes_count + 1; i++) {
G[i].push_back(2 * sizes_count + i - 1);
C[i][2 * sizes_count + i - 1] = INFTY;
}
for (int i = sizes_count + 1; i < 2 * sizes_count; i++) {
G[i].push_back(i + sizes_count - 1);
C[i][i + sizes_count - 1] = INFTY;
G[i].push_back(i + sizes_count);
C[i][i + sizes_count] = INFTY;
}
}
int main() {
ios_base::sync_with_stdio(0);
for (int i = 0; i < sizes_count; i++) {
cin >> c_siz[i];
}
int n;
string s;
vector<int> qs;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
int num = toNum(s);
c_tsh[num]++;
qs.push_back(num);
}
build_graph();
vector<vector<int> > flow =
edmonds_karp(G, C, 3 * sizes_count + 1, 0, 3 * sizes_count);
int max_flow = 0;
for (int i = 0; i < 3 * sizes_count; i++)
max_flow += flow[i][3 * sizes_count];
if (max_flow != n) {
cout << "NO"
<< "\n";
} else {
cout << "YES"
<< "\n";
for (int i = 0; i < n; i++) {
if (qs[i] < sizes_count) {
cout << fromNum(qs[i]) << "\n";
} else {
if (flow[qs[i] + 1][qs[i] + sizes_count] > 0) {
flow[qs[i] + 1][qs[i] + sizes_count]--;
cout << fromNum(qs[i] - sizes_count) << "\n";
} else {
cout << fromNum(qs[i] - sizes_count + 1) << "\n";
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[7], t[100005];
list<int> mlist[7];
char s[105];
bool ok = true;
int main() {
for (int i = 0; i < 6; i++) scanf("%d", &a[i]);
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", s);
if (strcmp(s, "S") == 0) a[0]--, t[i] = 0;
if (strcmp(s, "M") == 0) a[1]--, t[i] = 1;
if (strcmp(s, "L") == 0) a[2]--, t[i] = 2;
if (strcmp(s, "XL") == 0) a[3]--, t[i] = 3;
if (strcmp(s, "XXL") == 0) a[4]--, t[i] = 4;
if (strcmp(s, "XXXL") == 0) a[5]--, t[i] = 5;
if (strcmp(s, "S,M") == 0) mlist[0].push_back(i);
if (strcmp(s, "M,L") == 0) mlist[1].push_back(i);
if (strcmp(s, "L,XL") == 0) mlist[2].push_back(i);
if (strcmp(s, "XL,XXL") == 0) mlist[3].push_back(i);
if (strcmp(s, "XXL,XXXL") == 0) mlist[4].push_back(i);
}
for (int i = 0; i < 5; i++) {
while (!mlist[i].empty() && a[i] != 0) {
t[mlist[i].front()] = i;
a[i]--;
mlist[i].pop_front();
}
while (!mlist[i].empty() && a[i + 1] != 0) {
t[mlist[i].front()] = i + 1;
a[i + 1]--;
mlist[i].pop_front();
}
if (!mlist[i].empty() && a[i + 1] == 0) {
ok = false;
break;
}
}
for (int i = 0; i < 6; i++) {
if (a[i] < 0) ok = false;
}
if (!ok)
printf("NO");
else {
printf("YES\n");
for (int i = 0; i < n; i++) {
if (t[i] == 0) printf("S\n");
if (t[i] == 1) printf("M\n");
if (t[i] == 2) printf("L\n");
if (t[i] == 3) printf("XL\n");
if (t[i] == 4) printf("XXL\n");
if (t[i] == 5) printf("XXXL\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int iinf = 1e9 + 7;
const long long linf = 1ll << 60;
const double dinf = 1e10;
inline long long read() {
bool f = 0;
long long x = 0;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') c = getchar();
if (c == '-') {
f = 1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
if (f) x = -x;
return x;
}
inline void scf(int &x) {
bool f = 0;
x = 0;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') c = getchar();
if (c == '-') {
f = 1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
if (f) x = -x;
return;
}
void scf(int &x, int &y) {
scf(x);
return scf(y);
}
void scf(int &x, int &y, int &z) {
scf(x);
scf(y);
return scf(z);
}
const int N = 1e5 + 100;
int n;
string ans[N];
vector<pair<pair<int, int>, int> > tsh;
map<string, int> _hash;
int cnt[N];
const string out[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int main() {
for (int i = 0; i < (6); i++) cin >> cnt[i];
cin >> n;
_hash["S"] = 0;
_hash["M"] = 1;
_hash["L"] = 2;
_hash["XL"] = 3;
_hash["XXL"] = 4;
_hash["XXXL"] = 5;
for (int i = 0; i < (n); i++) {
string s;
cin >> s;
int j = 0;
while (j < (int)s.size() && s[j] != ',') j++;
if (j == (int)s.size()) {
ans[i] = s;
cnt[_hash[s]]--;
continue;
}
string s1 = s.substr(0, j), s2 = s.substr(j + 1);
int i1 = _hash[s1], i2 = _hash[s2];
if (i1 > i2) swap(i1, i2);
tsh.push_back(make_pair(make_pair(i1, i2), i));
}
for (int i = 0; i < (6); i++)
if (cnt[i] < 0) {
puts("NO");
return 0;
}
sort(tsh.begin(), tsh.end());
for (auto x : tsh) {
int i1 = x.first.first, i2 = x.first.second, i = x.second;
if (cnt[i1] > 0)
cnt[i1]--, ans[i] = out[i1];
else
cnt[i2]--, ans[i] = out[i2];
}
for (int i = 0; i < (6); i++)
if (cnt[i] < 0) {
puts("NO");
return 0;
}
puts("YES");
for (int i = 0; i < (n); i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string pta[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int32_t main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
long long a[6];
for (long long i = 0; i < 6; i++) cin >> a[i];
map<string, long long> m{{"S", 0}, {"M", 1}, {"L", 2},
{"XL", 3}, {"XXL", 4}, {"XXXL", 5}};
long long n;
cin >> n;
string ans[n];
vector<long long> cnt[5];
for (long long i = 0; i < n; i++) {
string s, aa;
cin >> s;
vector<string> just;
for (long long i = 0; i < s.size(); i++) {
if (s[i] == ',') {
just.push_back(aa);
aa.clear();
} else
aa += s[i];
}
just.push_back(aa);
if (just.size() == 1) {
a[m[aa]]--;
ans[i] = aa;
} else {
cnt[m[aa] - 1].push_back(i);
}
}
for (long long i = 0; i < 6; i++) {
if (a[i] < 0) {
cout << "NO";
exit(0);
}
}
for (long long i = 0; i < 5; i++) {
while (a[i] && cnt[i].size()) {
ans[cnt[i].back()] = pta[i];
cnt[i].pop_back();
a[i]--;
}
while (a[i + 1] && cnt[i].size()) {
ans[cnt[i].back()] = pta[i + 1];
cnt[i].pop_back();
a[i + 1]--;
}
if (cnt[i].size()) {
cout << "NO";
exit(0);
}
}
cout << "YES\n";
for (long long i = 0; i < n; i++) cout << ans[i] << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
struct Dinic {
static const int MAXN = 100015;
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];
int chosen[MAXN];
void init() {
memset(chosen, 0, sizeof(chosen));
edges.clear();
for (int i = 0; i < MAXN; i++) G[i].clear();
}
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) {
if (u <= 6 && u >= 1) {
chosen[e.v] = u;
}
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;
int main(void) {
ios_base::sync_with_stdio(false);
long long int tshirt[7];
while (cin >> tshirt[1]) {
for (int i = 2; i <= 6; i++) {
cin >> tshirt[i];
}
dinic.init();
for (int i = 1; i <= 6; i++) {
dinic.add_edge(0, i, tshirt[i]);
}
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
string sz;
cin >> sz;
string temp;
for (auto j : sz) {
if (j != ',') {
temp.push_back(j);
} else {
int type;
if (temp == "S") {
type = 1;
}
if (temp == "M") {
type = 2;
}
if (temp == "L") {
type = 3;
}
if (temp == "XL") {
type = 4;
}
if (temp == "XXL") {
type = 5;
}
if (temp == "XXXL") {
type = 6;
}
dinic.add_edge(type, i + 6, 1);
temp.clear();
}
}
int type;
if (temp == "S") {
type = 1;
}
if (temp == "M") {
type = 2;
}
if (temp == "L") {
type = 3;
}
if (temp == "XL") {
type = 4;
}
if (temp == "XXL") {
type = 5;
}
if (temp == "XXXL") {
type = 6;
}
dinic.add_edge(type, i + 6, 1);
temp.clear();
dinic.add_edge(i + 6, 6 + n + 1, 1);
}
long long int total = dinic.maxflow(0, 6 + n + 1);
if (total < n) {
cout << "NO\n";
} else {
cout << "YES\n";
for (int i = 1; i <= n; i++) {
int type = dinic.chosen[i + 6];
if (type == 1) {
cout << "S\n";
}
if (type == 2) {
cout << "M\n";
}
if (type == 3) {
cout << "L\n";
}
if (type == 4) {
cout << "XL\n";
}
if (type == 5) {
cout << "XXL\n";
}
if (type == 6) {
cout << "XXXL\n";
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
enum sizes { S = 0, M, L, XL, XXL, XXXL };
inline int str_to_sizes(char str[]) {
if (str[0] == 'S')
return S;
else if (str[0] == 'M')
return M;
else if (str[0] == 'L')
return L;
else if (str[1] == 'L')
return XL;
else if (str[2] == 'L')
return XXL;
return XXXL;
}
inline void getTshirSize(int &a, int &b) {
char str[10];
fgets(str, sizeof(str), stdin);
a = str_to_sizes(str);
b = -1;
int upto = strlen(str) - 1;
for (int i = 1; i < upto; ++i) {
if (str[i] == ',') {
b = str_to_sizes(&str[i + 1]);
break;
}
}
}
int main() {
int tshirts[6], n;
for (int i = 0; i < 6; ++i) scanf("%d", tshirts + i);
scanf("%d\n", &n);
if (n > accumulate(tshirts, tshirts + 6, 0)) {
puts("NO");
return 0;
}
int s1, s2;
vector<int> allocatedTshirts(n);
vector<pair<pair<int, int>, int> > choices;
for (int i = 0; i < n; ++i) {
getTshirSize(s1, s2);
if (s2 == -1) {
allocatedTshirts[i] = s1;
--tshirts[s1];
} else {
choices.push_back(pair<pair<int, int>, int>(pair<int, int>(s1, s2), i));
}
}
for (int i = 0; i < 6; ++i) {
if (tshirts[i] < 0) {
puts("NO");
return 0;
}
}
sort(choices.begin(), choices.end());
vector<int> choiceCnt(5, 0);
for (auto &pr : choices) ++choiceCnt[pr.first.first];
int j = 0;
for (int i = 0; i < 5; ++i) {
int upto;
if (tshirts[i] >= choiceCnt[i]) {
upto = j + choiceCnt[i];
while (j < upto) allocatedTshirts[choices[j++].second] = i;
tshirts[i] -= choiceCnt[i];
} else if (tshirts[i] + tshirts[i + 1] >= choiceCnt[i]) {
upto = j + tshirts[i];
while (j < upto) allocatedTshirts[choices[j++].second] = i;
upto = j + (choiceCnt[i] - tshirts[i]);
while (j < upto) allocatedTshirts[choices[j++].second] = i + 1;
tshirts[i + 1] -= choiceCnt[i] - tshirts[i];
tshirts[i] = 0;
} else {
puts("NO");
return 0;
}
}
puts("YES");
for (auto &x : allocatedTshirts) {
if (x == S)
puts("S");
else if (x == M)
puts("M");
else if (x == L)
puts("L");
else if (x == XL)
puts("XL");
else if (x == XXL)
puts("XXL");
else
puts("XXXL");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[11];
long long b[11];
long long c[11];
long long n;
int dec(string x) {
if (x == "S") return 0;
if (x == "M") return 1;
if (x == "L") return 2;
if (x == "XL") return 3;
if (x == "XXL") return 4;
if (x == "XXXL") return 5;
return 6 + dec(x.substr(0, x.find(',')));
}
string enc(int x) {
if (x == 0) return "S";
if (x == 1) return "M";
if (x == 2) return "L";
if (x == 3) return "XL";
if (x == 4) return "XXL";
if (x == 5) return "XXXL";
}
int main() {
for (int i = 0; i < 6; ++i) {
cin >> a[i];
b[i] = a[i];
}
cin >> n;
vector<int> x(n);
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
int d = dec(s);
x[i] = d;
}
for (int i = 0; i < n; ++i) {
if (x[i] < 6) {
if (a[x[i]] <= 0) {
cout << "NO" << endl;
return 0;
}
a[x[i]]--;
}
}
for (int i = 6; i < 10; ++i) a[i] = a[i - 6] + a[i - 5];
a[10] = a[4] + a[5];
for (int i = 0; i < n; ++i) {
if (x[i] < 6) continue;
if (a[x[i]] <= 0) {
cout << "NO" << endl;
return 0;
}
a[x[i]]--;
b[x[i]]++;
}
if (b[6] <= a[0]) {
c[6] = b[6];
a[0] -= b[6];
b[6] = 0;
} else {
c[6] = a[0];
b[6] -= a[0];
a[0] = 0;
a[1] -= b[6];
b[6] = 0;
}
for (int i = 7; i < 11; ++i) {
if (b[i] <= a[i - 6]) {
c[i] = b[i];
a[i - 6] -= b[i];
b[i] = 0;
} else {
c[i] = a[i - 6];
b[i] -= a[i - 6];
a[i - 6] = 0;
if (b[i] <= a[i - 5]) {
a[i - 5] -= b[i];
b[i] = 0;
} else {
cout << "NO" << endl;
return 0;
}
}
}
cout << "YES" << endl;
for (int i = 0; i < n; ++i) {
if (x[i] < 6)
cout << enc(x[i]) << endl;
else {
if (c[x[i]] > 0) {
cout << enc(x[i] - 6) << endl;
c[x[i]]--;
} else {
cout << enc(x[i] - 5) << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INFint = 2e9;
const long long INF = 2e18;
const int MOD = 1e9 + 7;
vector<vector<pair<int, int> > > g;
vector<int> used;
int get(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;
}
string back(int x) {
if (x == 0) return "S";
if (x == 1) return "M";
if (x == 2) return "L";
if (x == 3) return "XL";
if (x == 4) return "XXL";
return "XXXL";
}
void bad() {
cout << "NO";
exit(0);
}
int main() {
ios_base::sync_with_stdio(0);
int n = 6;
vector<int> cnt(n);
for (auto &x : cnt) cin >> x;
g.resize(n);
int k;
cin >> k;
vector<string> ans(k, "kek");
for (int i = 0; i < k; i++) {
string s;
cin >> s;
if (s.find(',') != -1) {
int a = get(s.substr(0, s.find(',')));
int b = get(s.substr(s.find(',') + 1));
g[a].push_back({0, i});
g[b].push_back({1, i});
} else {
int cur = get(s);
cnt[cur]--;
if (cnt[cur] < 0) bad();
ans[i] = s;
}
}
for (int c = 5; c > -1; c--) {
if (!cnt[c]) continue;
sort(g[c].begin(), g[c].end());
for (auto cur : g[c]) {
int to = cur.second;
if (!cnt[c]) break;
if (ans[to] != "kek") continue;
ans[to] = back(c);
cnt[c]--;
}
}
for (auto x : ans) {
if (x == "kek") bad();
}
cout << "YES\n";
for (auto x : ans) cout << x << endl;
fprintf(stderr, "\nTIME = %lf\n", 1.0 * clock() / CLOCKS_PER_SEC);
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, int> f;
struct pii {
int first, second, id;
};
pii a[111111];
bool cmp(pii t1, pii t2) {
if (t1.first != t2.first)
return t1.first < t2.first;
else
return t1.second < t2.second;
}
int b[11];
char s[55];
char s1[11], s2[11];
int c[111111];
char ff[11][7] = {"", "S", "M", "L", "XL", "XXL", "XXXL"};
int main() {
f["S"] = 1, f["M"] = 2, f["L"] = 3;
f["XL"] = 4, f["XXL"] = 5, f["XXXL"] = 6;
int i, j, n, len, k;
int p1, p2;
for (i = 1; i <= 6; i++) scanf("%d", &b[i]);
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%s", s);
len = strlen(s);
for (j = 0; j < len; j++)
if (s[j] == ',') break;
if (j == len) {
a[i].first = 0;
a[i].second = f[s];
a[i].id = i;
} else {
for (j = 0;; j++) {
if (s[j] == ',') break;
s1[j] = s[j];
}
k = j + 1;
s1[j] = '\0';
for (; k < len; k++) {
s2[k - j - 1] = s[k];
}
s2[k - j - 1] = '\0';
p1 = f[s1];
p2 = f[s2];
if (p1 > p2) swap(p1, p2);
a[i].first = 1;
a[i].second = p1;
a[i].id = i;
}
}
sort(a + 1, a + 1 + n, cmp);
for (i = 1; i <= n; i++) {
if (a[i].first) {
p1 = a[i].second;
p2 = p1 + 1;
if (b[p1] <= 0 && b[p2] <= 0) break;
if (b[p1] > 0) {
b[p1]--;
c[a[i].id] = p1;
} else {
b[p2]--;
c[a[i].id] = p2;
}
} else {
p1 = a[i].second;
if (b[p1] > 0) {
b[p1]--;
c[a[i].id] = p1;
} else
break;
}
}
if (i > n) {
printf("YES\n");
for (i = 1; i <= n; i++) printf("%s\n", ff[c[i]]);
} else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
map<string, int> mp;
vector<int> cnt(6, 0);
mp["S"] = 0;
mp["M"] = 1;
mp["L"] = 2;
mp["XL"] = 3;
mp["XXL"] = 4;
mp["XXXL"] = 5;
vector<string> out{"S", "M", "L", "XL", "XXL", "XXXL"};
for (int i = 0; i < 6; ++i) {
cin >> cnt[i];
}
cin >> n;
vector<string> v(n);
vector<pair<pair<int, int>, int> > p;
for (int i = 0; i < n; ++i) {
cin >> v[i];
size_t j = v[i].find(',');
if (j != std::string::npos) {
v[i][j] = ' ';
stringstream ss(v[i]);
string t;
ss >> v[i] >> t;
p.push_back({{mp[v[i]], mp[t]}, i});
} else if (cnt[mp[v[i]]]) {
--cnt[mp[v[i]]];
} else {
cout << "NO\n";
return 0;
}
}
sort(p.begin(), p.end());
for (int i = 0; i < (int)p.size(); ++i) {
if (cnt[p[i].first.first]) {
--cnt[p[i].first.first];
v[p[i].second] = out[p[i].first.first];
} else if (cnt[p[i].first.second]) {
--cnt[p[i].first.second];
v[p[i].second] = out[p[i].first.second];
} else {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
for (int i = 0; i < n; ++i) {
cout << v[i] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int compareup(const void *a, const void *b) { return (*(int *)a > *(int *)b); }
int comparedown(const void *a, const void *b) {
return (*(int *)a < *(int *)b);
}
void printArr(const vector<string> &a) {
for (int i = 0; i < a.size(); i++) cout << a[i] << endl;
cout << endl;
}
void printArr(const vector<int> &a) {
for (int o = 0; o < a.size(); o++) cout << a[o] << ' ';
cout << endl << endl;
}
void printArr(const vector<vector<int> > &a) {
for (int i = 0; i < a.size(); i++) {
for (int o = 0; o < a[i].size(); o++) cout << a[i][o] << ' ';
cout << endl;
}
cout << endl;
}
void printArr(const vector<vector<bool> > &a) {
for (int i = 0; i < a.size(); i++) {
for (int o = 0; o < a[i].size(); o++) cout << a[i][o] << ' ';
cout << endl;
}
cout << endl;
}
void printArr(const vector<long long int> &a) {
for (int o = 0; o < a.size(); o++) cout << a[o] << ' ';
cout << endl << endl;
}
void printArr(const vector<bool> &a) {
for (int i = 0; i < a.size(); i++) cout << a[i] << ' ';
cout << endl << endl;
}
void printArr(const int a[], const int &i) {
for (int o = 0; o < i; o++) cout << a[o] << ' ';
cout << endl << endl;
}
void printArr(const vector<pair<int, int> > &a) {
cout << "###vec_pair###" << endl;
for (int i = 0; i < a.size(); i++)
cout << i << ' ' << a[i].first << ' ' << a[i].second << endl;
cout << "###vec_pair###" << endl << endl;
}
int pcti(const char c) {
stringstream ss;
ss << c;
int ans;
ss >> ans;
ss.str("");
ss.clear();
return ans;
}
char pitc(const int i) {
stringstream ss;
ss << i;
char ans;
ss >> ans;
ss.str("");
ss.clear();
return ans;
}
int main() {
int TEST;
ifstream FPROVMAKHOME("mak.home");
if (FPROVMAKHOME.is_open())
TEST = 1;
else
TEST = 0;
FPROVMAKHOME.close();
int timeBeg;
ios::sync_with_stdio(false);
if (TEST) {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
timeBeg = clock();
}
int n;
vector<int> c(6), var(5), ansi(6);
for (int i = 0; i < 6; i++) cin >> c[i];
cin >> n;
vector<string> anss(n), v(n);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s.find(',') == -1) {
anss[i] = s;
if (s == "S")
c[0]--;
else if (s == "M")
c[1]--;
else if (s == "L")
c[2]--;
else if (s == "XL")
c[3]--;
else if (s == "XXL")
c[4]--;
else if (s == "XXXL")
c[5]--;
} else {
anss[i] = s;
if (s == "S,M")
var[0]++;
else if (s == "M,L")
var[1]++;
else if (s == "L,XL")
var[2]++;
else if (s == "XL,XXL")
var[3]++;
else if (s == "XXL,XXXL")
var[4]++;
}
}
for (int i = 0; i < 5; i++) {
string p;
switch (i) {
case 0:
p = "S,M";
break;
case 1:
p = "M,L";
break;
case 2:
p = "L,XL";
break;
case 3:
p = "XL,XXL";
break;
case 4:
p = "XXL,XXXL";
break;
}
for (int j = 0; j < anss.size(); j++) {
if (anss[j] == p) {
if (c[i] > 0) {
c[i]--;
switch (i) {
case 0:
anss[j] = "S";
break;
case 1:
anss[j] = "M";
break;
case 2:
anss[j] = "L";
break;
case 3:
anss[j] = "XL";
break;
case 4:
anss[j] = "XXL";
break;
}
} else {
c[i + 1]--;
switch (i) {
case 0:
anss[j] = "M";
break;
case 1:
anss[j] = "L";
break;
case 2:
anss[j] = "XL";
break;
case 3:
anss[j] = "XXL";
break;
case 4:
anss[j] = "XXXL";
break;
}
}
}
}
}
if (*min_element(c.begin(), c.end()) >= 0) {
cout << "YES" << endl;
for (int i = 0; i < n; i++) cout << anss[i] << endl;
} else
cout << "NO" << endl;
if (TEST) {
int timeEnd = clock();
cout << endl
<< fixed << setprecision(3) << double(timeEnd - timeBeg) / 1000
<< endl;
fclose(stdout);
fclose(stdin);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s1[6][5] = {"S", "M", "L", "XL", "XXL", "XXXL"},
s2[5][10] = {"S,M", "M,L", "L,XL", "XL,XXL", "XXL,XXXL"}, s[100000][10];
int a[6], i, j, n;
for (i = 0; i < 6; i++) cin >> a[i];
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
for (j = 0; j < 6; j++)
if (strcmp(s[i], s1[j]) == 0) a[j]--;
}
for (i = 0; i < 6; i++)
if (a[i] < 0) {
printf("NO\n");
return 0;
} else {
for (i = 0; i < 5; i++) {
for (j = 0; j < n; j++) {
if (strcmp(s2[i], s[j]) == 0) {
if (a[i] > 0) {
a[i]--;
strcpy(s[j], s1[i]);
} else {
a[i + 1]--;
strcpy(s[j], s1[i + 1]);
}
}
}
}
for (i = 0; i < 6; i++)
if (a[i] < 0) {
printf("NO\n");
return 0;
}
printf("YES\n");
for (i = 0; i < n; i++) printf("%s\n", s[i]);
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int G[35][35];
bool visit[35];
int rute[35];
map<string, int> isi, jum, conv;
string nama[35];
vector<int> arah[35], adj[35];
string hasil[100005];
queue<int> pos;
void connect(int u, int v, int flow) {
adj[u].push_back(v);
G[u][v] += flow;
}
int augment(int u, int minflow, int &source) {
if (u == source) return minflow;
int v = rute[u];
if (v == -1) return -1;
int h = augment(v, min(minflow, G[v][u]), source);
G[v][u] -= h;
G[u][v] += h;
return h;
}
int mf(int S, int T) {
int ret = 0;
while (1) {
memset(visit, 0, sizeof(visit));
memset(rute, -1, sizeof(rute));
while (!pos.empty()) pos.pop();
pos.push(S);
while (!pos.empty()) {
int u = pos.front();
pos.pop();
for (int z = 0; z < adj[u].size(); z++) {
int v = adj[u][z];
if (G[u][v] <= 0) continue;
if (visit[v]) continue;
visit[v] = 1;
rute[v] = u;
pos.push(v);
if (v == T) {
u = T;
break;
}
}
if (u == T) break;
}
int h = augment(T, 1e9, S);
if (h == -1) break;
ret += h;
}
return ret;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
isi["S"] = 20;
nama[20] = "S";
isi["M"] = 21;
nama[21] = "M";
isi["L"] = 22;
nama[22] = "L";
isi["XL"] = 23;
nama[23] = "XL";
isi["XXL"] = 24;
nama[24] = "XXL";
isi["XXXL"] = 25;
nama[25] = "XXXL";
for (int a = 20; a <= 25; a++) {
int inp;
cin >> inp;
connect(a, 30, inp);
connect(30, a, 0);
}
int n;
cin >> n;
string S;
int ix = 1;
for (int a = 0; a < n; a++) {
cin >> S;
if (conv.count(S) == 0) conv[S] = ix++;
arah[conv[S]].push_back(a);
jum[S]++;
}
for (map<string, int>::iterator it = jum.begin(); it != jum.end(); it++) {
string tmp = "";
connect(0, conv[it->first], it->second);
connect(conv[it->first], 0, 0);
for (int a = 0; a < (it->first).size(); a++) {
if (isalpha((it->first)[a])) {
tmp.push_back((it->first)[a]);
} else {
connect(conv[it->first], isi[tmp], it->second);
connect(isi[tmp], conv[it->first], 0);
tmp = "";
}
}
connect(conv[it->first], isi[tmp], it->second);
connect(isi[tmp], conv[it->first], 0);
}
int out = mf(0, 30);
if (out != n) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
for (int a = 20; a <= 25; a++) {
for (int b = 1; b < ix; b++) {
for (int c = 0; c < G[a][b]; c++) {
hasil[(int)arah[b].back()] = nama[a];
arah[b].pop_back();
}
}
}
for (int a = 0; a < n; a++) {
cout << hasil[a] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct MaxFlowDinic {
struct Edge {
int next;
int inv;
long long res;
};
int n;
vector<vector<Edge>> graph;
vector<unsigned> q, l, start;
void Init(int _n) {
n = _n;
graph.resize(n);
for (int i = 0; i < n; i++) graph[i].clear();
}
void AddNodes(int count) {
n += count;
graph.resize(n);
}
void AddEdge(int s, int e, long long cap, long long caprev = 0) {
Edge forward = {e, (int)graph[e].size(), cap};
Edge reverse = {s, (int)graph[s].size(), caprev};
graph[s].push_back(forward);
graph[e].push_back(reverse);
}
bool AssignLevel(int source, int sink) {
int t = 0;
memset(&l[0], 0, sizeof(l[0]) * l.size());
l[source] = 1;
q[t++] = source;
for (int h = 0; h < t && !l[sink]; h++) {
int cur = q[h];
for (unsigned i = 0; i < graph[cur].size(); i++) {
int next = graph[cur][i].next;
if (l[next]) continue;
if (graph[cur][i].res > 0) {
l[next] = l[cur] + 1;
q[t++] = next;
}
}
}
return l[sink] != 0;
}
long long BlockFlow(int cur, int sink, long long currentFlow) {
if (cur == sink) return currentFlow;
for (unsigned &i = start[cur]; i < graph[cur].size(); i++) {
int next = graph[cur][i].next;
if (graph[cur][i].res == 0 || l[next] != l[cur] + 1) continue;
if (long long res =
BlockFlow(next, sink, min(graph[cur][i].res, currentFlow))) {
int inv = graph[cur][i].inv;
graph[cur][i].res -= res;
graph[next][inv].res += res;
return res;
}
}
return 0;
}
long long Solve(int source, int sink) {
q.resize(n);
l.resize(n);
start.resize(n);
long long ans = 0;
while (AssignLevel(source, sink)) {
memset(&start[0], 0, sizeof(start[0]) * n);
while (long long flow =
BlockFlow(source, sink, numeric_limits<long long>::max())) {
ans += flow;
}
}
return ans;
}
};
const int k_max_n = 100111;
char k_str[6][11] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int stocks[6];
int n;
char input[k_max_n][22];
int main(void) {
for (int i = 0; i < 6; ++i) scanf("%d", &stocks[i]);
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%s", input[i]);
MaxFlowDinic mf;
mf.Init(2 + n + 6 + 10);
for (int i = 0; i < n; ++i) {
mf.AddEdge(0, 2 + i, 1);
int len = strlen(input[i]);
bool flag = false;
for (int j = 0; j < len; ++j) {
if (input[i][j] == ',') {
flag = true;
break;
}
}
if (!flag) {
for (int j = 0; j < 6; ++j) {
if (strcmp(input[i], k_str[j]) == 0) {
mf.AddEdge(2 + i, 2 + n + j, 1);
break;
}
}
} else {
char input1[111], input2[111];
sscanf(input[i], "%[^,],%s", input1, input2);
for (int j = 0; j < 6; ++j) {
if (strcmp(input1, k_str[j]) == 0) {
mf.AddEdge(2 + i, 2 + n + j, 1);
break;
}
}
for (int j = 0; j < 6; ++j) {
if (strcmp(input2, k_str[j]) == 0) {
mf.AddEdge(2 + i, 2 + n + j, 1);
break;
}
}
}
}
for (int i = 0; i < 6; ++i) mf.AddEdge(2 + n + i, 1, stocks[i]);
int inter = mf.Solve(0, 1);
if (inter < n)
printf("NO\n");
else {
printf("YES\n");
for (int i = 0; i < n; ++i) {
if (mf.graph[2 + i].size() == 2)
printf("%s\n", input[i]);
else {
char input1[111], input2[111];
sscanf(input[i], "%[^,],%s", input1, input2);
if (mf.graph[2 + i][1].res == 0) {
printf("%s\n", input1);
} else
printf("%s\n", input2);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXINT = 100010;
struct need {
int n1, n2;
};
string size[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
map<string, int> lk;
int cnt[6] = {}, n, cross[5] = {}, bkcnt[6], bkcrs[5], coc[5][2] = {};
need nd[MAXINT];
int main() {
string tmp, tmp1;
for (int i = 0; i < 6; i++) {
lk[size[i]] = i;
scanf("%d", cnt + i);
}
scanf("%d", &n);
for (int i = 0; i < n; i++) {
cin >> tmp;
if (tmp.find(',') != string::npos) {
tmp1 = tmp.substr(0, tmp.find(','));
nd[i].n1 = lk[tmp1];
tmp1 = tmp.substr(tmp.find(',') + 1, tmp.length() - (tmp.find(',') + 1));
nd[i].n2 = lk[tmp1];
cross[nd[i].n1]++;
} else {
nd[i].n1 = lk[tmp];
cnt[lk[tmp]]--;
nd[i].n2 = -1;
}
}
memcpy(bkcnt, cnt, sizeof(cnt));
memcpy(bkcrs, cross, sizeof(cross));
for (int i = 0; i < 5; i++) {
coc[i][0] = min(cross[i], cnt[i]);
cross[i] -= coc[i][0];
coc[i][1] = cross[i];
cnt[i + 1] -= cross[i];
}
for (int i = 0; i < 6; i++) {
if (cnt[i] < 0) {
printf("NO\n");
return 0;
}
}
printf("YES\n");
for (int i = 0; i < n; i++) {
if (nd[i].n2 == -1) {
cout << size[nd[i].n1] << endl;
} else {
if (coc[nd[i].n1][0] > 0) {
coc[nd[i].n1][0]--;
cout << size[nd[i].n1] << endl;
} else {
coc[nd[i].n1][1]--;
cout << size[nd[i].n2] << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int MSIZE = 5001;
int get_type(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;
}
string backt(int val) {
if (val == 0)
return "S";
else if (val == 1)
return "M";
else if (val == 2)
return "L";
else if (val == 3)
return "XL";
else if (val == 4)
return "XXL";
else if (val == 5)
return "XXXL";
}
int main() {
ios_base::sync_with_stdio(0);
vector<int> v;
for (int i = 0; i < 6; ++i) {
int a;
cin >> a;
v.push_back(a);
}
int n;
cin >> n;
vector<int> output(n, -1);
vector<vector<int> > add(5);
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
if (s.find(',') == string::npos) {
int id = get_type(s);
v[id]--;
output[i] = id;
} else {
string t;
for (int j = 0; j < s.length() && s[j] != ','; ++j) t += s[j];
add[get_type(t)].push_back(i);
}
}
for (int i = 0; i < 5; ++i) {
while (add[i].size() != 0 && v[i] != 0) {
output[add[i].back()] = i;
v[i]--;
add[i].pop_back();
}
while (add[i].size() != 0 && v[i + 1] != 0) {
output[add[i].back()] = i + 1;
v[i + 1]--;
add[i].pop_back();
}
}
for (int i = 0; i < 6; ++i)
if (v[i] < 0) {
cout << "NO";
return 0;
}
for (int i = 0; i < n; ++i) {
if (output[i] == -1) {
cout << "NO";
return 0;
}
}
cout << "YES\n";
for (int i = 0; i < n; ++i) cout << backt(output[i]) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double PI = 3.14159265358979323846264338;
string s[5] = {"S,M", "M,L", "L,XL", "XL,XXL", "XXL,XXXL"};
string ss[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int cnt[6];
string p[500005];
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
for (int i = 0; i < 6; i++) cin >> cnt[i];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
for (int j = 0; j < 6; j++) {
if (p[i] == ss[j]) {
cnt[j]--;
break;
}
}
}
for (int i = 0; i < 6; i++) {
if (cnt[i] < 0) {
cout << "NO"
<< "\n";
return 0;
}
}
for (int i = 0; i < 5; i++) {
for (int j = 0; j < n; j++) {
if (p[j] == s[i]) {
if (cnt[i] > 0) {
cnt[i]--;
p[j] = ss[i];
} else if (cnt[i + 1] > 0) {
cnt[i + 1]--;
p[j] = ss[i + 1];
} else {
cout << "NO"
<< "\n";
return 0;
}
}
}
}
cout << "YES"
<< "\n";
for (int i = 0; i < n; i++) cout << p[i] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Mass = (int)1e5 + 5;
const int inf = (int)1e9 + 5;
int M[8], n, M1[8], e[8], q[8], w[8];
vector<pair<string, string> > v;
string s, ans[Mass], ans1[Mass];
map<int, bool> u;
map<string, int> a;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
srand(time(NULL));
for (int i = 1; i <= 6; ++i) {
cin >> M[i];
M1[i] = M[i];
e[i] = M[i];
ans[i] = "";
ans1[i] = "";
}
a["S"] = 1;
a["M"] = 2;
a["L"] = 3;
a["XL"] = 4;
a["XXL"] = 5;
a["XXXL"] = 6;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> s;
string s1 = "";
string s2 = "";
bool ok = 0;
for (int j = 0; j < ((int)(s.size())); ++j) {
if (s[j] == ',') {
ok = 1;
continue;
}
if (!ok) {
s1 += s[j];
} else {
s2 += s[j];
}
}
v.push_back(make_pair(s1, s2));
}
for (int i = 0; i < ((int)(v.size())); ++i) {
if (v[i].second == "") {
if (M[a[v[i].first]] == 0) {
cout << "NO";
return 0;
} else {
ans[i] = (v[i].first);
ans1[i] = (v[i].first);
M[a[v[i].first]]--;
M1[a[v[i].first]]--;
}
}
}
for (int i = 1; i <= 6; ++i) {
if (M[i] < 0) {
cout << "NO";
return 0;
}
}
for (int i = 1; i <= 6; ++i) {
if (M[i] == 0) continue;
for (int j = 0; j < ((int)(v.size())); ++j) {
if (ans[j] != "") continue;
if (i == a[v[j].second]) {
M[i]--;
ans[j] = v[j].second;
}
}
for (int j = 0; j < ((int)(v.size())); ++j) {
if (M[i] == 0) continue;
if (ans[j] != "") continue;
if (i == a[v[j].first]) {
M[i]--;
ans[j] = v[j].first;
}
}
}
for (int i = 1; i <= 6; ++i) {
if (M1[i] == 0) continue;
for (int j = 0; j < ((int)(v.size())); ++j) {
if (ans1[j] != "") continue;
if (i == a[v[j].second]) {
M1[i]--;
ans1[j] = v[j].second;
}
}
for (int j = 0; j < ((int)(v.size())); ++j) {
if (M1[i] == 0) continue;
if (ans1[j] != "") continue;
if (i == a[v[j].first]) {
M1[i]--;
ans1[j] = v[j].first;
}
}
}
for (int i = 1; i < ((int)(v.size())); ++i)
if (ans[i] == "") {
cout << "NO";
return 0;
}
for (int i = 0; i < ((int)(v.size())); ++i) {
q[a[ans[i]]]++;
w[a[ans1[i]]]++;
}
int ok1 = 1, ok2 = 1;
for (int i = 1; i <= 6; ++i) {
if (e[i] < q[i]) ok1 = 0;
if (e[i] < w[i]) ok2 = 0;
}
if (ok2 == 1) {
cout << "YES\n";
for (int i = 0; i < ((int)(v.size())); ++i) {
cout << ans1[i] << '\n';
}
} else if (ok1 == 1) {
cout << "YES\n";
for (int i = 0; i < ((int)(v.size())); ++i) {
cout << ans[i] << '\n';
}
} else {
cout << "NO";
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
inline int Rand() { return (rand() << 16) | rand(); }
using namespace std;
const int N = 200005;
const double eps = 1e-9;
map<string, int> col;
string s[N], S[] = {"S", "M", "L", "XL", "XXL", "XXXL"}, ans[N];
map<string, string> w, SS, A;
set<pair<string, pair<int, int> > > q;
int main() {
ios_base::sync_with_stdio(false);
SS["S"] = "a";
SS["M"] = "b";
SS["L"] = "c";
SS["XL"] = "d";
SS["XXL"] = "e";
SS["XXXL"] = "f";
for (int i = 0; i < 6; ++i) {
int x;
cin >> x;
col[SS[S[i]]] = x;
if (i != 5) w[SS[S[i]]] = SS[S[i + 1]];
A[SS[S[i]]] = S[i];
}
int n;
cin >> n;
int m = n;
for (int i = 1; i <= n; ++i) {
cin >> s[i];
bool o = false;
string x = "", y = "";
for (auto j : s[i]) {
if (j == ',') {
o = true;
continue;
}
if (o)
y += j;
else
x += j;
}
x = SS[x];
y = SS[y];
if (y == "") {
if (col[x] <= 0) cout << "NO", exit(0);
m--;
col[x]--;
ans[i] = x;
} else
q.insert({x, {-1, i}}), q.insert({y, {-2, i}});
}
for (auto j : q) {
if (m <= 0) break;
if (col[j.first] == 0) continue;
col[j.first]--;
ans[j.second.second] = j.first;
if (j.second.first == -1) q.erase({w[j.first], {-2, j.second.second}});
m--;
}
if (m) printf("NO"), exit(0);
cout << "YES\n";
for (int i = 1; i <= n; ++i) cout << A[ans[i]] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s1[5][10] = {"S,M", "M,L", "L,XL", "XL,XXL", "XXL,XXXL"};
char s2[6][10] = {"S", "M", "L", "XL", "XXL", "XXXL"};
char s3[100005][10];
int cnt[6];
int main() {
for (int i = 0; i < 6; i++) scanf("%d", cnt + i);
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", s3[i]);
for (int j = 0; j < 6; j++) {
if (strcmp(s3[i], s2[j]) == 0) {
cnt[j]--;
break;
}
}
}
for (int i = 0; i < 6; i++) {
if (cnt[i] < 0) {
puts("NO");
return 0;
}
}
for (int i = 0; i < 5; i++) {
for (int j = 0; j < n; j++) {
if (strcmp(s1[i], s3[j]) == 0) {
if (cnt[i] > 0) {
cnt[i]--;
strcpy(s3[j], s2[i]);
} else if (cnt[i + 1] > 0) {
cnt[i + 1]--;
strcpy(s3[j], s2[i + 1]);
} else {
puts("NO");
return 0;
}
}
}
}
puts("YES");
for (int i = 0; i < n; i++) puts(s3[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, int> num_shirt;
map<int, string> name_shirt;
pair<int, int> f(string s) {
if (s == "S") return make_pair(0, 0);
if (s == "M") return make_pair(1, 1);
if (s == "L") return make_pair(2, 2);
if (s == "XL") return make_pair(3, 3);
if (s == "XXL") return make_pair(4, 4);
if (s == "XXXL") return make_pair(5, 5);
if (s == "S,M") return make_pair(0, 1);
if (s == "M,L") return make_pair(1, 2);
if (s == "L,XL") return make_pair(2, 3);
if (s == "XL,XXL") return make_pair(3, 4);
if (s == "XXL,XXXL") return make_pair(4, 5);
}
bool sol() {
num_shirt["S"] = 0;
num_shirt["M"] = 1;
num_shirt["L"] = 2;
num_shirt["XL"] = 3;
num_shirt["XXL"] = 4;
num_shirt["XXXL"] = 5;
for (auto k : num_shirt) {
name_shirt[k.second] = k.first;
}
vector<int> cnt(6);
vector<int> strt(6);
for (int i = 0; i < 6; i++) {
cin >> cnt[i];
strt[i] = cnt[i];
}
int n;
map<string, int> need;
vector<pair<int, int> > q;
cin >> n;
for (int i = 0; i < n; i++) {
string t;
cin >> t;
q.push_back(f(t));
if (need[t] == 0)
need[t] = 1;
else
need[t]++;
}
cnt[0] -= need["S"];
if (cnt[0] < 0) return false;
int taken_S = min(cnt[0], need["S,M"]);
cnt[0] -= taken_S;
need["S,M"] -= taken_S;
cnt[1] -= (need["M"] + need["S,M"]);
if (cnt[1] < 0) return false;
int taken_M = min(cnt[1], need["M,L"]);
cnt[1] -= taken_M;
need["M,L"] -= taken_M;
cnt[2] -= (need["L"] + need["M,L"]);
if (cnt[2] < 0) return false;
int taken_L = min(cnt[2], need["L,XL"]);
cnt[2] -= taken_L;
need["L,XL"] -= taken_L;
cnt[3] -= (need["XL"] + need["L,XL"]);
if (cnt[3] < 0) return false;
int taken_XL = min(cnt[3], need["XL,XXL"]);
cnt[3] -= taken_XL;
need["XL,XXL"] -= taken_XL;
cnt[4] -= (need["XXL"] + need["XL,XXL"]);
if (cnt[4] < 0) return false;
int taken_XXL = min(cnt[4], need["XXL,XXXL"]);
cnt[4] -= taken_XXL;
need["XXL,XXXL"] -= taken_XXL;
cnt[5] -= (need["XXXL"] + need["XXL,XXXL"]);
if (cnt[5] < 0) return false;
vector<int> answer(6);
for (int i = 0; i < 6; i++) {
answer[i] = strt[i] - cnt[i];
}
cout << "YES\n";
vector<string> ans(n);
for (int i = 0; i < n; i++) {
auto k = q[i];
if (k.first == k.second) {
ans[i] = name_shirt[k.first];
answer[k.first] -= 1;
}
}
for (int j = 0; j < 5; j++)
for (int i = 0; i < n; i++) {
auto k = q[i];
if (k == make_pair(j, j + 1)) {
if (answer[k.first] > 0) {
ans[i] = name_shirt[k.first];
answer[k.first] -= 1;
} else {
ans[i] = name_shirt[k.second];
answer[k.second] -= 1;
}
}
}
for (int i = 0; i < n; i++) {
cout << ans[i] << endl;
}
return true;
}
int main() {
if (sol()) {
return 0;
} else {
cout << "NO";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long cnt[6] = {0};
string ans[100000 + 5];
map<string, long long> M = {{"S", 0}, {"M", 1}, {"L", 2},
{"XL", 3}, {"XXL", 4}, {"XXXL", 5}};
string give(long long x) {
for (auto it = M.begin(); it != M.end(); ++it) {
if (it->second == x) return it->first;
}
}
struct par {
long long c1, c2, id;
par() {
c1 = -1;
c2 = -1;
}
} P[100000 + 5];
bool cmp(par a, par b) {
if (a.c1 != b.c1)
return a.c1 < b.c1;
else
return a.c2 < b.c2;
}
int main() {
for (long long i = 0; i < 6; ++i) cin >> cnt[i];
long long n;
cin >> n;
for (long long i = 0; i < n; ++i) {
string S, A, B;
cin >> S;
for (long long j = 0; j < S.size(); ++j) {
if (S[j] == ',') {
A = S.substr(0, j);
B = S.substr(j + 1, S.size() - j - 1);
}
}
if (A.size() > 0) {
P[i].c1 = M[A];
P[i].c2 = M[B];
} else
P[i].c1 = M[S];
P[i].id = i;
}
sort(P, P + n, cmp);
bool flag = 1;
for (long long i = 0; i < n; ++i) {
if (cnt[P[i].c1]) {
--cnt[P[i].c1];
ans[P[i].id] = give(P[i].c1);
} else if (cnt[P[i].c2]) {
--cnt[P[i].c2];
ans[P[i].id] = give(P[i].c2);
} else {
flag = 0;
break;
}
}
if (flag) {
cout << "YES\n";
for (long long i = 0; i < n; ++i) cout << ans[i] << "\n";
} else
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
inline void gmax(T1 &a, T2 b) {
if (b > a) a = b;
}
template <class T1, class T2>
inline void gmin(T1 &a, T2 b) {
if (b < a) a = b;
}
const int N = 1e5 + 10;
const int inf = 0x3f3f3f3f;
int a[8];
map<string, int> mop;
char s[100];
pair<int, int> b[N];
string ans[N];
int n;
string S[8];
bool solve() {
scanf("%d", &n);
int g = 0;
for (int i = 1; i <= n; ++i) {
scanf("%s", s);
int p = -1;
for (int i = 0; s[i]; ++i)
if (s[i] == ',') {
p = i;
break;
}
if (p == -1) {
if (--a[mop[s]] == -1)
return 0;
else
ans[i] = s;
} else {
s[p] = 0;
b[++g] = {mop[s], i};
}
}
sort(b + 1, b + g + 1);
for (int i = 1; i <= g; ++i) {
int x = b[i].first;
int o = b[i].second;
if (a[x] == 0 && a[x + 1] == 0) return 0;
if (a[x]) {
--a[x];
ans[o] = S[x];
} else {
--a[x + 1];
ans[o] = S[x + 1];
}
}
puts("YES");
for (int i = 1; i <= n; ++i) cout << ans[i] << endl;
return 1;
}
int main() {
S[1] = "S";
S[2] = "M";
S[3] = "L";
S[4] = "XL";
S[5] = "XXL";
S[6] = "XXXL";
mop["S"] = 1;
mop["M"] = 2;
mop["L"] = 3;
mop["XL"] = 4;
mop["XXL"] = 5;
mop["XXXL"] = 6;
for (int i = 1; i <= 6; ++i) scanf("%d", &a[i]);
if (!solve()) puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
vector<vector<int> > array2_int(int N, int M, int def = 0) {
return vector<vector<int> >(N, vector<int>(M, def));
}
vector<vector<vector<int> > > array3_int(int N, int M, int K, int def = 0) {
return vector<vector<vector<int> > >(
N, vector<vector<int> >(M, vector<int>(K, def)));
}
vector<vector<long long> > array2_ll(int N, int M, long long def = 0) {
return vector<vector<long long> >(N, vector<long long>(M, def));
}
vector<vector<vector<long long> > > array3_ll(int N, int M, int K,
long long def = 0) {
return vector<vector<vector<long long> > >(
N, vector<vector<long long> >(M, vector<long long>(K, def)));
}
template <class T>
void printImpl(const vector<T>& coll) {
copy(coll.begin(), coll.end(), ostream_iterator<T>(cout, " "));
cout << endl;
}
template <class T, int N>
void printImpl(T (&coll)[N]) {
copy(coll, coll + N, ostream_iterator<T>(cout, " "));
cout << endl;
}
template <class Key, class Value>
void printImpl(const map<Key, Value>& data) {
typename map<Key, Value>::const_iterator it;
for (it = data.begin(); it != data.end(); ++it) {
cout << it->first << ":" << it->second << endl;
}
}
template <class T>
void printImpl(const T& data) {
cout << data << endl;
}
int size2int(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;
}
int main() {
vector<int> total(6);
for (int i = 0; i < (6); ++i) {
cin >> total[i];
}
int N;
cin >> N;
vector<int> res(N, -1);
vector<int> sizemin(N, -1);
for (int i = 0; i < (N); ++i) {
string s;
cin >> s;
if (s.find(',') == string::npos) {
res[i] = size2int(s);
total[res[i]]--;
} else {
sizemin[i] = size2int(s.substr(0, s.find(',')));
}
}
for (int i = 0; i < (6); ++i) {
if (total[i] < 0) {
cout << "NO" << endl;
return 0;
}
}
for (int mm = 0; mm < (5); ++mm) {
for (int i = 0; i < (N); ++i) {
if (res[i] == -1 && sizemin[i] == mm && total[mm] > 0) {
res[i] = mm;
total[mm]--;
} else if (res[i] == -1 && sizemin[i] == mm && total[mm] == 0 &&
total[mm + 1] > 0) {
res[i] = mm + 1;
total[mm + 1]--;
}
}
}
for (int i = 0; i < (N); ++i) {
if (res[i] == -1 && sizemin[i] == 4 && total[5] > 0) {
res[i] = 5;
total[5]--;
}
}
for (int i = 0; i < (N); ++i) {
if (res[i] == -1) {
cout << "NO" << endl;
return 0;
}
}
vector<string> sss = {"S", "M", "L", "XL", "XXL", "XXXL"};
cout << "YES" << endl;
for (int i = 0; i < (N); ++i) {
cout << sss[res[i]] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, int> types;
struct man {
bool two;
int f, s, num, ans;
void read(int x) {
num = x;
string str, cur;
cin >> str;
two = false;
for (int i(0); i < str.size(); ++i)
if (str[i] == ',') {
two = true;
s = types[cur];
cur.clear();
} else
cur += str[i];
f = types[cur];
}
};
bool Compare(const man &a, const man &b) {
if (a.two == b.two) return a.f < b.f;
return !a.two;
}
bool C2(const man &a, const man &b) { return a.num < b.num; }
int k[6];
string t[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int main() {
ios_base::sync_with_stdio(false);
types["S"] = 0;
types["M"] = 1;
types["L"] = 2;
types["XL"] = 3;
types["XXL"] = 4;
types["XXXL"] = 5;
for (int i(0); i < 6; ++i) cin >> k[i];
int n;
cin >> n;
man a[n];
for (int i(0); i < n; ++i) a[i].read(i);
sort(a, a + n, Compare);
for (int i(0); i < n; ++i)
if (a[i].two) {
if (k[a[i].s]) {
--k[a[i].s];
a[i].ans = a[i].s;
} else if (k[a[i].f]) {
--k[a[i].f];
a[i].ans = a[i].f;
} else {
cout << "NO";
return 0;
};
} else if (k[a[i].f]) {
a[i].ans = a[i].f;
--k[a[i].f];
} else {
cout << "NO";
return 0;
};
cout << "YES\n";
sort(a, a + n, C2);
for (int i(0); i < n; ++i) cout << t[a[i].ans] << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, a[6], ty[N], sz[N], ut1[6], ut2[6];
string f[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int code(string s) {
for (auto i = 0; i <= 5; i++)
if (s == f[i]) return i;
}
void solve(int id) {
string s;
getline(cin, s);
int ok = 1;
for (auto i = 0; i <= s.size() - 1; i++)
if (s[i] == ',') ok = 0;
if (ok) {
ty[id] = 1;
sz[id] = code(s);
return;
}
int i = 0;
while (s[i] != ',') i++;
s.erase(i, s.size() - i);
ty[id] = 2;
sz[id] = code(s);
}
int main() {
for (auto i = 0; i <= 5; i++) scanf("%d", &a[i]);
scanf("%d\n", &n);
for (auto i = 1; i <= n; i++) solve(i);
for (auto i = 1; i <= n; i++)
if (ty[i] == 1) {
if (a[sz[i]] == 0) return puts("NO");
a[sz[i]]--;
} else {
ut2[sz[i]]++;
}
for (auto i = 0; i <= 5; i++) {
if (a[i] < ut1[i]) return puts("NO");
a[i] -= ut1[i];
if (a[i] >= ut2[i]) continue;
ut1[i + 1] = ut2[i] - a[i];
ut2[i] = a[i];
}
puts("YES");
for (auto i = 1; i <= n; i++)
if (ty[i] == 1)
cout << f[sz[i]] << endl;
else {
if (ut2[sz[i]] > 0) {
ut2[sz[i]]--;
cout << f[sz[i]] << endl;
} else
cout << f[sz[i] + 1] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
const int MAX_N = (int)2e5 + 123;
const int inf = (int)1e9 + 123;
using namespace std;
int cnt[6];
struct edge {
int from, to;
int cp, flow;
edge() {}
edge(int from, int to, int cp) : from(from), to(to), cp(cp), flow(0) {}
};
vector<edge> q;
vector<int> g[MAX_N];
void add_edge(int u, int v, int cp) {
g[u].push_back(int((q).size()));
q.push_back(edge(u, v, cp));
g[v].push_back(int((q).size()));
q.push_back(edge(v, u, 0));
}
int d[MAX_N], ptr[MAX_N];
queue<int> Q;
bool bfs(int st, int fn) {
for (int i = 0; i <= fn; i++) d[i] = inf;
d[st] = 0;
Q.push(st);
while (!Q.empty()) {
int v = Q.front();
Q.pop();
for (auto i : g[v])
if (q[i].flow < q[i].cp && d[q[i].to] > d[q[i].from] + 1) {
d[q[i].to] = d[q[i].from] + 1;
Q.push(q[i].to);
}
}
return d[fn] != inf;
}
int dfs(int v, int target, int cur_min = inf) {
if (v == target) return cur_min;
while (ptr[v] < int((g[v]).size())) {
int i = g[v][ptr[v]];
if (d[q[i].to] == d[q[i].from] + 1 && q[i].flow < q[i].cp) {
int now = dfs(q[i].to, target, min(cur_min, q[i].cp - q[i].flow));
if (now) {
q[i].flow += now;
q[i ^ 1].flow -= now;
return now;
}
}
ptr[v]++;
}
return 0;
}
int max_flow(int st, int fn) {
int res = 0;
while (bfs(st, fn)) {
memset(ptr, 0, sizeof ptr);
while (1) {
int now = dfs(st, fn);
if (!now) break;
res += now;
}
}
return res;
}
int n;
int ans[MAX_N];
int to(const string &second) {
if (second == "S")
return 1;
else if (second == "M")
return 2;
else if (second == "L")
return 3;
else if (second == "XL")
return 4;
else if (second == "XXL")
return 5;
return 6;
}
string h[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
void out(int x) { cout << h[x - 1] << '\n'; }
void go(int id, const string &second) {
int now = -1;
for (int i = 0; i < int((second).size()); i++)
if (second[i] == ',') {
now = i;
break;
}
if (now == -1)
add_edge(id, n + to(second), 1);
else {
add_edge(id, n + to(second.substr(0, now)), 1),
add_edge(id,
n + to(second.substr(now + 1, int((second).size()) - now - 1)),
1);
}
}
int main() {
ios_base ::sync_with_stdio(NULL), cin.tie(NULL), cout.tie(NULL);
for (int i = 0; i < 6; i++) cin >> cnt[i];
cin >> n;
for (int i = 1; i <= n; i++) add_edge(0, i, 1);
string second;
for (int i = 1; i <= n; i++) {
cin >> second;
go(i, second);
}
for (int i = 0; i < 6; i++) add_edge(n + i + 1, n + 7, cnt[i]);
if (max_flow(0, n + 7) != n) {
cout << "NO";
return 0;
}
cout << "YES\n";
for (auto i : q)
if (i.from < i.to && i.from > 0 && i.from <= n && i.flow > 0)
ans[i.from] = i.to - n;
for (int i = 1; i <= n; i++) out(ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353LL;
const long long N = 110;
struct FlowEdge {
long long v, u;
long long cap, flow = 0;
FlowEdge(long long v, long long u, long long cap) : v(v), u(u), cap(cap) {}
};
struct Dinic {
const long long flow_inf = 1e18;
vector<FlowEdge> edges;
vector<vector<long long>> adj;
long long n, m = 0;
long long s, t;
vector<long long> level, ptr;
queue<long long> q;
Dinic(long long n, long long s, long long t) : n(n), s(s), t(t) {
adj.resize(n);
level.resize(n);
ptr.resize(n);
}
void add_edge(long long v, long long 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()) {
long long v = q.front();
q.pop();
for (long long 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(long long v, long long pushed) {
if (pushed == 0) return 0;
if (v == t) return pushed;
for (long long& cid = ptr[v]; cid < (long long)adj[v].size(); cid++) {
long long id = adj[v][cid];
long long 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;
}
};
map<string, long long> mp;
map<long long, string> rmp;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
mp["S"] = 3;
mp["M"] = 4;
mp["L"] = 5;
mp["XL"] = 6;
mp["XXL"] = 7;
mp["XXXL"] = 8;
rmp[3] = "S";
rmp[4] = "M";
rmp[5] = "L";
rmp[6] = "XL";
rmp[7] = "XXL";
rmp[8] = "XXXL";
long long n, m, p;
Dinic dinic(2e5 + 10, 1, 2);
for (long long i = 3; i < 9; ++i) {
cin >> p;
dinic.add_edge(i, 2, p);
}
cin >> n;
string s;
for (long long i = 0; i < n; ++i) {
dinic.add_edge(1, i + 10, 1);
cin >> s;
string t, t1;
bool pass = false;
for (auto c : s) {
if (c == ',') {
pass = true;
continue;
}
if (!pass)
t += c;
else
t1 += c;
}
dinic.add_edge(i + 10, mp[t], 1);
if (pass) dinic.add_edge(i + 10, mp[t1], 1);
}
long long x = dinic.flow();
if (x == n) {
cout << "YES\n";
for (auto ed : dinic.edges) {
if (ed.flow == 1 && ed.v >= 10) cout << rmp[ed.u] << "\n";
}
} else {
cout << "NO\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr int N = 1e5 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
vector<string> sizes{"S", "M", "L", "XL", "XXL", "XXXL"};
map<string, int> mp;
map<int, string> mp2;
for (int i = 0; i < 6; i++) {
mp[sizes[i]] = i;
mp2[i] = sizes[i];
}
vector<int> have(6);
for (int i = 0; i < 6; i++) cin >> have[i];
int n;
cin >> n;
vector<vector<int>> in(n);
vector<int> ans(n, -1);
for (int i = 0; i < n; i++) {
string x;
cin >> x;
for (char &c : x) {
if (c == ',') c = ' ';
}
stringstream ss(x);
while (ss >> x) {
in[i].push_back(mp[x]);
}
if (in[i].size() == 1) {
if (have[in[i][0]] == 0) {
cout << "NO\n";
return 0;
}
ans[i] = in[i][0];
have[in[i][0]]--;
}
}
auto check = [&](int now, int also) -> void {
for (int i = 0; i < n; i++) {
if (ans[i] != -1) continue;
if ((in[i][0] == now && in[i][1] == also) ||
(in[i][1] == now && in[i][0] == also)) {
if (have[now] > 0) {
ans[i] = now;
have[now]--;
}
}
}
};
for (int i = 0; i < 6; i++) {
if (i - 1 >= 0) {
check(i, i - 1);
}
if (i + 1 < 6) {
check(i, i + 1);
}
}
for (int i = 0; i < n; i++)
if (ans[i] == -1) return cout << "NO", 0;
cout << "YES\n";
for (int x : ans) cout << mp2[x] << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, int> aids = {{"S", 0}, {"M", 1}, {"L", 2},
{"XL", 3}, {"XXL", 4}, {"XXXL", 5}};
map<int, string> aids4 = {{0, "S"}, {1, "M"}, {2, "L"},
{3, "XL"}, {4, "XXL"}, {5, "XXXL"}};
map<string, int> aids2 = {
{"S,M", 0}, {"M,L", 1}, {"L,XL", 2}, {"XL,XXL", 3}, {"XXL,XXXL", 4}};
map<int, string> aids5 = {
{0, "S,M"}, {1, "M,L"}, {2, "L,XL"}, {3, "XL,XXL"}, {4, "XXL,XXXL"}};
int ct[6];
int nq[5];
vector<int> aids3[5];
string ans[100005];
int main() {
ios::sync_with_stdio(false);
for (int i = 0; i < 6; i++) {
int x;
cin >> x;
ct[i] = x;
}
int N;
cin >> N;
for (int i = 0; i < N; i++) {
string st;
cin >> st;
for (int j = 0; j < 6; j++) {
if (aids4[j] == st) {
if (ct[aids[st]] == 0) {
cout << "NO" << endl;
return 0;
}
ct[aids[st]]--;
ans[i] = st;
}
}
for (int j = 0; j < 5; j++) {
if (aids5[j] == st) {
nq[aids2[st]]++;
aids3[j].push_back(i);
}
}
}
int rp = 0;
for (int i = 0; i < 5; i++) {
if (ct[i] - rp < 0) {
cout << "NO" << endl;
return 0;
}
for (int j = 0; j < rp; j++) {
ans[aids3[i - 1][j]] = aids4[i];
}
ct[i] -= rp;
rp = abs(min(0, ct[i] - nq[i]));
for (int j = 0; j < min(ct[i], nq[i]); j++) {
ans[aids3[i][aids3[i].size() - j - 1]] = aids4[i];
}
for (int j = 0; j < min(ct[i], nq[i]); j++) {
aids3[i].erase(aids3[i].end() - 1);
}
}
if (rp > ct[5]) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
for (int i = 0; i < N; i++) {
if (ans[i] == "") {
cout << "XXXL" << endl;
continue;
}
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
const int INF = 0x3f3f3f3f;
char s[20];
char _s[20];
int tot;
int ty(char x[]) {
if (x[0] == 'S')
return 1;
else if (x[0] == 'M')
return 2;
else if (x[0] == 'L')
return 3;
else if (x[1] == 'L')
return 4;
else if (x[2] == 'L')
return 5;
else
return 6;
}
void pr(int x) {
if (x == 1)
printf("S\n");
else if (x == 2)
printf("M\n");
else if (x == 3)
printf("L\n");
else if (x == 4)
printf("XL\n");
else if (x == 5)
printf("XXL\n");
else
printf("XXXL\n");
}
int sz[10];
int ch[10];
struct Edge {
int to, cap, flow;
};
struct Dinic {
int s, t;
vector<Edge> edges;
vector<int> G[MAXN];
int vis[MAXN];
int d[MAXN];
int cur[MAXN];
vector<int> ans;
void Init() {
edges.clear();
for (int i = 0; i < MAXN; ++i) G[i].clear();
}
void addedge(int from, int to, int cap) {
edges.push_back(Edge{to, cap, 0});
edges.push_back(Edge{from, 0, 0});
int 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);
d[s] = 0;
vis[s] = 1;
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;
}
} din;
int num[10];
int ans[100005];
int main() {
int n;
while (~scanf("%d", &sz[1])) {
din.Init();
memset(num, 0, sizeof(num));
memset(ch, 0, sizeof(ch));
for (int i = 2; i <= 6; ++i) scanf("%d", &sz[i]);
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%s", s);
int len = strlen(s);
s[len] = ',';
tot = 0;
int cc = 0;
int t1;
for (int j = 0; j <= len; ++j) {
if (s[j] == ',') {
_s[tot] = 0;
cc++;
t1 = ty(_s);
tot = 0;
} else
_s[tot++] = s[j];
}
if (cc == 1) {
sz[t1]--;
ans[i] = t1;
} else {
num[t1]++;
ans[i] = -t1;
}
}
int fl = 0;
for (int i = 1; i <= 6; ++i) {
if (sz[i] < 0) {
fl = 1;
break;
}
}
if (fl) {
printf("NO\n");
continue;
}
int tol = 0;
int s = 0;
int t = 13;
for (int i = 2; i <= 6; ++i) {
if (num[i]) {
tol += num[i];
din.addedge(s, i, num[i]);
din.addedge(i, 6 + i - 1, num[i]);
din.addedge(i, 6 + i, num[i]);
}
}
for (int i = 1; i <= 6; ++i) {
din.addedge(6 + i, t, sz[i]);
}
int flow = din.Maxflow(s, t);
if (flow != tol) {
printf("NO\n");
} else {
printf("YES\n");
for (int j = 2; j <= 6; ++j)
for (int i = 0; i < ((int)din.G[j].size()); ++i) {
Edge& e = din.edges[din.G[j][i]];
if (e.to == 6 + j - 1) {
ch[j] = e.flow;
}
}
for (int i = 1; i <= n; ++i) {
if (ans[i] > 0)
pr(ans[i]);
else {
ans[i] = -ans[i];
if (ch[ans[i]])
ch[ans[i]]--, pr(ans[i] - 1);
else
pr(ans[i]);
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using min_queue = priority_queue<T, vector<T>, greater<T>>;
const long long MOD = 1e9 + 7;
int N;
int cnt[6];
int res[100100];
vector<int> v[6];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
const vector<string> sizes = {"S", "M", "L", "XL", "XXL", "XXXL"};
map<string, int> inv;
{
int k = 0;
for (auto s : sizes) inv[s] = k++;
}
for (int i = 0; i < 6; i++) {
cin >> cnt[i];
}
cin >> N;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
string t;
for (char c : s) {
if (c == ',') break;
t += c;
}
int k = inv[t];
if (s == t) {
cnt[k]--;
res[i] = k;
} else {
v[k].push_back(i);
}
}
bool good = 1;
for (int i = 0; i < 5; i++) {
if (cnt[i] < 0) {
good = 0;
break;
}
while (!v[i].empty() && cnt[i] > 0) {
cnt[i]--;
res[v[i].back()] = i;
v[i].pop_back();
}
while (!v[i].empty() && cnt[i + 1] > 0) {
cnt[i + 1]--;
res[v[i].back()] = i + 1;
v[i].pop_back();
}
if (!v[i].empty() || cnt[i + 1] < 0) {
good = 0;
break;
}
}
if (!good) {
cout << "NO\n";
return 0;
}
cout << "YES\n";
for (int i = 0; i < N; i++) cout << sizes[res[i]] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)1e5 + 5, mod = (int)1e9 + 7;
string tshirt[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
vector<int> lis[10];
int sz[10];
int avail[10];
string ans[maxn];
bool is[maxn];
int find(string arg) {
int ind;
for (ind = 0; ind < 6; ind++)
if (arg == tshirt[ind]) break;
return ind;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m, i, j, k, l, u, v;
for (i = 0; i < 6; i++) cin >> avail[i];
cin >> n;
for (i = 1; i <= n; i++) {
string t;
cin >> t;
for (j = 0; j < t.length(); j++)
if (t[j] == ',') break;
if (j < t.length()) {
is[i] = 1;
string smll = "";
for (k = 0; k < j; k++) smll += t[k];
u = find(smll);
lis[u].emplace_back(i);
sz[u]++;
} else {
u = find(t);
if (avail[u])
ans[i] = t;
else {
cout << "NO";
return 0;
}
avail[u]--;
}
}
for (i = 0; i < 5; i++) {
for (auto it : lis[i]) {
if (avail[i]) {
avail[i]--;
ans[it] = tshirt[i];
} else if (avail[i + 1]) {
avail[i + 1]--;
ans[it] = tshirt[i + 1];
} else {
cout << "NO";
return 0;
}
}
}
cout << "YES\n";
for (i = 1; i <= n; i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const long long INF = 1e17;
int main() {
ios::sync_with_stdio(0);
cin.tie(nullptr);
cout.tie(nullptr);
const string sizes[6] = {"S", "M", "L", "XL", "XXL", "XXXL"};
map<string, int> nums;
vector<int> cnt(6);
for (int i = 0; i < 6; i++) {
nums[sizes[i]] = i;
cin >> cnt[i];
}
int n;
cin >> n;
vector<set<pair<int, int> > > needs(6);
vector<string> ans(n, "-");
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int sl = -1;
for (int j = 0; j < (int)s.size(); j++) {
if (s[j] == ',') {
sl = j;
break;
}
}
if (sl == -1) {
ans[i] = s;
cnt[nums[s]]--;
if (cnt[nums[s]] < 0) {
cout << "NO\n";
return 0;
}
} else {
needs[nums[s.substr(0, sl)]].insert({1, i});
needs[nums[s.substr(sl + 1, (int)s.size() - sl - 1)]].insert({0, i});
}
}
for (int i = 0; i < 6; i++) {
while (cnt[i] > 0 && !needs[i].empty()) {
if (ans[needs[i].begin()->second] == "-") {
ans[needs[i].begin()->second] = sizes[i];
cnt[i]--;
}
needs[i].erase(needs[i].begin());
}
}
for (int i = 0; i < 6; i++) {
if (cnt[i] < 0) {
cout << "NO\n";
return 0;
}
}
for (int i = 0; i < n; i++) {
if (ans[i] == "-") {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
for (auto t : ans) {
cout << t << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool check[200006];
long long sz[200006];
int main() {
long long frq[7];
map<string, long long> mp;
vector<long long> keep[7];
string str[7];
str[1] = "S";
str[2] = "M";
str[3] = "L";
str[4] = "XL";
str[5] = "XXL";
str[6] = "XXXL";
mp["S"] = 1;
mp["M"] = 2;
mp["L"] = 3;
mp["XL"] = 4;
mp["XXL"] = 5;
mp["XXXL"] = 6;
for (long long i = 1; i <= 6; i++) scanf("%lld", &frq[i]);
long long n;
cin >> n;
bool no = false;
for (long long i = 1; i <= n; i++) {
string A;
cin >> A;
bool ys = false;
string B = "", C = "";
for (long long j = 0; j < A.size(); j++) {
if (A[j] == ',') {
ys = true;
continue;
}
if (!ys)
B += A[j];
else
C += A[j];
}
if (!ys) {
if (frq[mp[A]] == 0) no = true;
frq[mp[A]]--;
sz[i] = mp[A];
continue;
}
keep[mp[B]].push_back(i);
keep[mp[C]].push_back(i);
}
stack<long long> st;
for (long long i = 1; i <= 6; i++) {
while (!st.empty()) {
if (frq[i] == 0) {
no = true;
break;
}
check[st.top()] = true;
sz[st.top()] = i;
frq[i]--;
st.pop();
}
if (no) break;
for (long long j = 0; j < keep[i].size(); j++) {
if (check[keep[i][j]]) continue;
if (frq[i]) {
check[keep[i][j]] = true;
sz[keep[i][j]] = i;
frq[i]--;
continue;
}
st.push(keep[i][j]);
}
}
if (no)
puts("NO");
else {
puts("YES");
for (long long i = 1; i <= n; i++) cout << str[sz[i]] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long PR = 1000000009;
long long avail[6] = {0};
struct person {
int ch1, noc;
int allot;
person() { allot = -1; }
} Ppl[100009];
int n;
int main() {
ios::sync_with_stdio(false);
for (int i = 0; i < 6; i++) cin >> avail[i];
cin >> n;
char choic[20];
for (int i = 0; i < n; i++) {
cin >> choic;
int fl = 0;
for (int j = 0; choic[j] != '\0'; j++)
if (choic[j] == ',') fl = 1;
if (fl)
Ppl[i].noc = 2;
else
Ppl[i].noc = 1;
if (choic[0] == 'S') {
Ppl[i].ch1 = 0;
continue;
}
if (choic[0] == 'M') {
Ppl[i].ch1 = 1;
continue;
}
if (choic[0] == 'L') {
Ppl[i].ch1 = 2;
continue;
}
if (choic[1] == 'L') {
Ppl[i].ch1 = 3;
continue;
}
if (choic[2] == 'L') {
Ppl[i].ch1 = 4;
continue;
}
if (choic[3] == 'L') {
Ppl[i].ch1 = 5;
continue;
}
}
for (int i = 0; i < 6; i++) {
for (int j = 0; j < n; j++) {
if (Ppl[j].ch1 == i && Ppl[j].allot == -1 && Ppl[j].noc == 1) {
avail[i]--;
Ppl[j].allot = i;
if (avail[i] < 0) {
cout << "NO" << endl;
return 0;
}
}
}
for (int j = 0; j < n; j++) {
if (Ppl[j].ch1 == i && Ppl[j].allot == -1 && Ppl[j].noc == 2) {
if (avail[i]) {
avail[i]--;
Ppl[j].allot = i;
} else {
Ppl[j].ch1++;
Ppl[j].noc = 1;
}
}
}
}
cout << "YES" << endl;
map<int, string> M;
M[0] = string("S");
M[1] = string("M");
M[2] = string("L");
M[3] = string("XL");
M[4] = string("XXL");
M[5] = string("XXXL");
for (int i = 0; i < n; i++) {
cout << M[Ppl[i].allot] << endl;
}
return 0;
};
|
#include <bits/stdc++.h>
const bool debug = false;
using namespace std;
long long powmod(long long a, long long b, long long MOD) {
long long res = 1;
a %= MOD;
for (; b; b >>= 1) {
if (b & 1) res = res * a % MOD;
a = a * a % MOD;
}
return res;
}
void buginfo(const char* f, ...) {
if (!debug) return;
va_list al;
va_start(al, f);
vprintf(f, al);
va_end(al);
}
struct Edge {
int from, to, cap, flow;
};
const int maxn = 1e5 + 10;
const long long inf = 1e9 + 10;
vector<int> sids;
struct Dinic {
int n, m, s, t;
vector<Edge> edges;
vector<int> G[maxn];
int vis[maxn], cur[maxn], d[maxn];
void init(int n, int s, int t) {
this->n = n;
for (int i = 0; i < n; ++i) G[i].clear();
edges.clear();
this->s = s, this->t = t;
}
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);
if (from <= 6 && from >= 1 && to > 6) sids.push_back(m - 2);
}
bool bfs() {
memset(vis, 0, sizeof(vis));
d[s] = 0;
vis[s] = 1;
queue<int> Q;
Q.push(s);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
for (int i = 0; i < G[u].size(); ++i) {
Edge& e = edges[G[u][i]];
if (!vis[e.to] && e.cap > e.flow) {
Q.push(e.to);
vis[e.to] = 1;
d[e.to] = d[u] + 1;
}
}
}
return vis[t];
}
int dfs(int u, int a) {
if (u == t || a == 0) return a;
int flow = 0, f;
for (int& i = cur[u]; i < G[u].size(); ++i) {
Edge& e = edges[G[u][i]];
if (d[e.to] == d[u] + 1 && (f = dfs(e.to, min(a, e.cap - e.flow))) > 0) {
flow += f;
e.flow += f;
edges[G[u][i] ^ 1].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;
}
};
Dinic dinic;
int n, sz_num[10];
char s[20];
int get_sz(char* s) {
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;
assert(strcmp(s, "XXXL") == 0);
return 6;
}
void print_sz(int c) {
switch (c) {
case 1:
printf("S");
break;
case 2:
printf("M");
break;
case 3:
printf("L");
break;
case 4:
printf("XL");
break;
case 5:
printf("XXL");
break;
case 6:
printf("XXXL");
break;
default:
printf("Error");
}
}
void add_participant(int x) {
memset(s, 0, sizeof(s));
scanf("%s", s);
int len = strlen(s);
int p = find(s, s + len, ',') - s;
s[p] = 0;
int a = get_sz(s);
dinic.addEdge(a, x, 1);
if (p != len) {
int b = get_sz(s + p + 1);
dinic.addEdge(b, x, 1);
}
}
int main() {
sids.clear();
sz_num[0] = 0;
for (int i = 1; i < 7; ++i) scanf("%d", sz_num + i);
scanf("%d\n", &n);
dinic.init(n + 8, 0, n + 7);
for (int i = 7; i < 7 + n; ++i) add_participant(i);
for (int i = 1; i < 7; ++i)
if (sz_num[i] > 0) dinic.addEdge(0, i, sz_num[i]);
for (int i = 7; i < 7 + n; ++i) dinic.addEdge(i, 7 + n, 1);
int ans = dinic.maxflow(0, 7 + n);
if (ans != n) {
printf("NO\n");
return 0;
}
vector<Edge> ve;
for (int c : sids) ve.push_back(dinic.edges[c]);
printf("YES\n");
sort((ve).begin(), (ve).end(),
[](const Edge& e1, const Edge& e2) { return e1.to < e2.to; });
for (Edge& e : ve) {
if (e.flow != 1) continue;
print_sz(e.from);
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX_BUF_SIZE = 16384;
char BUFOR[MAX_BUF_SIZE];
int BUF_SIZE, BUF_POS;
char ZZZ;
const int MXN = 1000010;
const int C = 262144;
const int INF = 1000000001;
const int L = 6;
string s[10] = {".", "S", "M", "L", "XL", "XXL", "XXXL"};
int cnt[10];
int res[MXN];
int n;
vector<int> tr[10];
void test() {
for (int i = (1); i <= (L); i++) cin >> cnt[i];
cin >> n;
for (int i = (1); i <= (n); i++) {
string tmp;
cin >> tmp;
bool dec = 0;
for (int j = (1); j <= (L); j++) {
if (s[j] == tmp) {
res[i] = j;
cnt[j]--;
dec = 1;
}
}
if (!dec) {
int iter = 0;
while (tmp[iter] != ',') iter++;
string t1 = tmp.substr(0, iter);
string t2 = tmp.substr(iter + 1, tmp.length());
int a1 = 0, a2 = 0;
for (int j = (1); j <= (L); j++)
if (t1 == s[j]) a1 = j;
for (int j = (1); j <= (L); j++)
if (t2 == s[j]) a2 = j;
if (a1 < a2)
tr[a1].push_back(i);
else
tr[a2].push_back(i);
}
}
for (int i = (1); i <= (L); i++)
if (cnt[i] < 0) {
printf("NO\n");
return;
}
for (int i = (1); i <= (L); i++) {
if (cnt[i] < 0) {
printf("NO\n");
return;
}
while ((int)(tr[i]).size()) {
int w = tr[i].back();
tr[i].pop_back();
if (cnt[i] > 0) {
res[w] = i;
cnt[i]--;
} else {
if (i == L) {
printf("NO\n");
return;
}
res[w] = i + 1;
cnt[i + 1]--;
}
}
}
cout << "YES\n";
for (int i = (1); i <= (n); i++) cout << s[res[i]] << "\n";
}
int main() {
int te = 1;
while (te--) test();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, int> shrts;
string keys[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
struct keka {
int i;
int c;
};
int ari[200000];
bool lessa(keka const& a, keka const& b) { return a.c < b.c; }
int main() {
int a[11];
cin >> a[0];
cin >> a[1];
cin >> a[2];
cin >> a[3];
cin >> a[4];
cin >> a[5];
int n;
cin >> n;
shrts["S"] = 0;
shrts["M"] = 1;
shrts["L"] = 2;
shrts["XL"] = 3;
shrts["XXL"] = 4;
shrts["XXXL"] = 5;
shrts["S,M"] = 6;
shrts["M,L"] = 7;
shrts["L,XL"] = 8;
shrts["XL,XXL"] = 9;
shrts["XXL,XXXL"] = 10;
vector<keka> partis;
for (int i = 0; i < n; ++i) {
string t;
cin >> t;
a[shrts[t]]--;
keka d = {i, shrts[t]};
partis.push_back(d);
}
sort(partis.begin(), partis.end(), lessa);
for (int i = 0; i < 6; ++i) {
if (a[i] < 0) {
cout << "NO";
return 0;
}
}
for (int i = 0; i < n; ++i) {
if (partis[i].c < 6) {
ari[partis[i].i] = partis[i].c;
continue;
}
int a1 = partis[i].c - 6;
int a2 = partis[i].c - 5;
if (a[a1] > 0) {
a[a1]--;
ari[partis[i].i] = a1;
} else {
ari[partis[i].i] = a2;
a[a2]--;
}
}
for (int i = 0; i < 6; ++i) {
if (a[i] < 0) {
cout << "NO";
return 0;
}
}
cout << "YES" << endl;
for (int i = 0; i < n; ++i) {
cout << keys[ari[i]] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
auto tshirts = array<int, 6>();
for (auto& x : tshirts) cin >> x;
const auto size_names = array<string, 6>{"S", "M", "L", "XL", "XXL", "XXXL"};
int N;
cin >> N;
auto assignments = vector<int>(N);
auto either = array<vector<int>, 5>();
for (auto i = 0; i < N; i++) {
string preference;
cin >> preference;
if (preference.find(',') == string::npos) {
const auto size = find(begin(size_names), end(size_names), preference) -
begin(size_names);
tshirts[size]--;
assignments[i] = int(size);
} else {
const auto lower = preference.substr(0, preference.find(','));
const auto index =
find(begin(size_names), end(size_names), lower) - begin(size_names);
either[index].push_back(i);
}
}
for (const auto x : tshirts)
if (x < 0) {
cout << "NO" << endl;
return 0;
}
for (auto i = 0; i < 5; i++) {
for (const auto id : either[i]) {
if (tshirts[i] > 0) {
tshirts[i]--;
assignments[id] = i;
} else if (tshirts[i + 1] > 0) {
tshirts[i + 1]--;
assignments[id] = i + 1;
} else {
cout << "NO" << endl;
return 0;
}
}
}
cout << "YES"
<< "\n";
for (const auto x : assignments) cout << size_names[x] << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int dif(string may) {
if (may == "S") return 0;
if (may == "M") return 1;
if (may == "L") return 2;
if (may == "XL") return 3;
if (may == "XXL") return 4;
if (may == "XXXL") return 5;
}
string obr(int type) {
if (type == 0) return "S";
if (type == 1) return "M";
if (type == 2) return "L";
if (type == 3) return "XL";
if (type == 4) return "XXL";
if (type == 5) return "XXXL";
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
vector<int> Have(6, 0);
for (int i = 0; i < 6; i++) {
cin >> Have[i];
}
cin >> n;
vector<pair<int, int>> Want(n);
vector<int> Res(n, -1);
for (int i = 0; i < n; i++) {
string may, res1 = "", res2 = "";
cin >> may;
bool coma = 0;
for (auto q : may) {
if (q == ',') {
coma = 1;
continue;
}
if (!coma) {
res1 += q;
} else {
res2 += q;
}
}
if (coma) {
Want[i] = {dif(res1), dif(res2)};
} else {
int cur = dif(may);
Want[i] = {-1, -1};
Res[i] = cur;
Have[cur]--;
if (Have[cur] < 0) {
cout << "NO";
return 0;
}
}
}
for (int t = 0; t < 6; t++) {
for (int i = 0; i < n && Have[t] > 0; i++) {
if (Want[i].second == t) {
Res[i] = t;
Want[i] = {-1, -1};
Have[t]--;
}
}
for (int i = 0; i < n && Have[t] > 0; i++) {
if (Want[i].first == t) {
Res[i] = t;
Want[i] = {-1, -1};
Have[t]--;
}
}
}
bool ok = 1;
for (int i = 0; i < n; i++) {
if (Res[i] == -1) {
ok = 0;
break;
}
}
if (!ok) {
cout << "NO";
return 0;
}
cout << "YES\n";
for (int i = 0; i < n; i++) {
cout << obr(Res[i]) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, int> m;
int main() {
int n;
cin >> m["S"];
cin >> m["M"];
cin >> m["L"];
cin >> m["XL"];
cin >> m["XXL"];
cin >> m["XXXL"];
cin >> n;
vector<string> p;
for (int i = 1; i <= n; i++) {
string t;
cin >> t;
p.push_back(t);
}
vector<string> ans(200000);
for (int i = 0; i < p.size(); i++) {
if (p[i].find(',') == string::npos) {
m[p[i]]--;
ans[i] = p[i];
}
}
for (int i = 0; i < p.size(); i++) {
if (p[i].find(',') != string::npos) {
if (p[i] == "S,M") {
ans[i] = (m["S"] > 0 ? "S" : "M");
m[(m["S"] > 0 ? "S" : "M")]--;
}
}
}
for (int i = 0; i < p.size(); i++) {
if (p[i].find(',') != string::npos) {
if (p[i] == "M,L") {
ans[i] = (m["M"] > 0 ? "M" : "L");
m[(m["M"] > 0 ? "M" : "L")]--;
}
}
}
for (int i = 0; i < p.size(); i++) {
if (p[i].find(',') != string::npos) {
if (p[i] == "XXL,XXXL") {
ans[i] = (m["XXXL"] > 0 ? "XXXL" : "XXL");
m[(m["XXXL"] > 0 ? "XXXL" : "XXL")]--;
}
}
}
for (int i = 0; i < p.size(); i++) {
if (p[i].find(',') != string::npos) {
if (p[i] == "XL,XXL") {
ans[i] = (m["XXL"] > 0 ? "XXL" : "XL");
m[(m["XXL"] > 0 ? "XXL" : "XL")]--;
}
}
}
for (int i = 0; i < n; i++) {
if (p[i] == "L,XL") {
ans[i] = (m["L"] > m["XL"] ? "L" : "XL");
m[(m["L"] > m["XL"] ? "L" : "XL")]--;
}
}
for (auto i : m) {
if (i.second < 0) {
cout << "NO";
return 0;
}
}
cout << "YES\n";
for (int i = 0; i < n; i++) {
cout << ans[i] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long linf = 1e18 + 7;
int a[6], n;
string ans[100001];
string f[6]{"S", "M", "L", "XL", "XXL", "XXXL"};
map<string, int> m1;
int main() {
m1["S"] = 0;
m1["M"] = 1;
m1["L"] = 2;
m1["XL"] = 3;
m1["XXL"] = 4;
m1["XXXL"] = 5;
m1[""] = -1;
for (int i = 0; i < 6; i++) cin >> a[i];
cin >> n;
bool b = true;
vector<pair<int, int> > v;
for (int i = 0; i < n; i++) {
string s, s1 = "", s2 = "";
cin >> s;
int j = 0;
while (j < (int)s.size() && s[j] != ',') {
s1 += s[j];
j++;
}
j++;
while (j < (int)s.size()) {
s2 += s[j];
j++;
}
if (s2 == "") {
a[m1[s1]]--;
if (a[m1[s1]] < 0) b = false;
ans[i] = s1;
} else {
v.push_back(make_pair(m1[s1], i));
}
}
sort(v.begin(), v.end());
for (int i = 0; i < (int)v.size(); i++) {
int t1 = v[i].first, t2 = v[i].second;
if (a[t1] > 0) {
a[t1]--;
ans[t2] = f[t1];
} else {
if (a[t1 + 1] <= 0) b = false;
a[t1 + 1]--;
ans[t2] = f[t1 + 1];
}
}
if (!b) {
cout << "NO\n";
return 0;
}
cout << "YES\n";
for (int i = 0; i < n; i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 5e5 + 10;
int eq[N];
vector<int> pp[10];
int ans[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s[] = {"S", "M", "L", "XL", "XXL", "XXXL"};
int arr[7];
for (int i = 0; i < 6; i++) cin >> arr[i];
int n;
cin >> n;
int lag = 0;
for (int i = 0; i < n; i++) {
string ss;
cin >> ss;
string tmp;
int flag = 0;
for (int j = 0; j < (int)ss.size(); j++) {
if (ss[j] == ',') {
flag = 1;
break;
}
tmp += ss[j];
}
for (int k = 0; k < 6; k++) {
if (s[k] == tmp) {
if (flag) {
eq[k]++;
pp[k].push_back(i);
} else if (arr[k] <= 0) {
lag = 1;
} else {
arr[k]--;
ans[i] = k;
}
break;
}
}
}
for (int i = 0; i < 5; i++) {
int baki = max(0, eq[i] - arr[i]);
if (baki > arr[i + 1]) {
lag = 1;
break;
}
arr[i + 1] -= baki;
for (int j = 0; j < (int)pp[i].size(); j++) {
if (j < baki)
ans[pp[i][j]] = i + 1;
else
ans[pp[i][j]] = i;
}
}
if (lag) {
cout << "NO\n";
} else {
cout << "YES\n";
for (int i = 0; i < n; i++) cout << s[ans[i]] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[int(1e7 + 100)];
void aum(int i) {
if (i % 2) {
arr[i / 2 + 1] += arr[i];
arr[i / 2] += arr[i];
} else
arr[i / 2] += 2 * arr[i];
}
int main() {
ios_base::sync_with_stdio(0);
set<int> conj;
memset(arr, 0, sizeof arr);
int n, m, l, ans = int(2 * 1e9 + 100), ptr = 0;
cin >> n >> m;
long long cnt = n, carry = 0, slices = m;
for (int i = 0; i < n; ++i) {
cin >> l;
carry += l;
++arr[l];
}
if (carry < m) {
cout << "-1\n";
return 0;
}
for (int i = int(1e7 + 100); cnt < m; --i) {
if (arr[i]) {
aum(i);
cnt += arr[i];
arr[i] = 0;
}
}
long long aux = 0;
for (int i = int(1e7 + 100); i >= 1; --i) {
if (arr[i]) {
conj.insert(i);
aux += arr[i];
if (aux >= m) {
ans = i;
break;
}
}
}
for (int i = int(1e7 + 100); i >= 1; --i) {
if (arr[i]) {
int go = (i % 2 == 1 ? 1 : 0);
if (i / 2 + go <= *(conj.begin())) {
break;
} else {
aum(i);
if (i % 2) conj.insert(i / 2 + 1);
conj.insert(i / 2);
conj.erase(i);
aux += arr[i];
while (1) {
int val = (*conj.begin());
if (aux - arr[val] < m) break;
aux -= arr[val];
conj.erase(conj.begin());
}
}
}
}
cout << max(1, *(conj.begin())) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[2000000];
int dem;
int maxa;
int dp[10000001];
void mmax(int &a, int b) { a = max(a, b); }
bool ok(int len) {
for (int i = 0; i <= maxa; i++) dp[i] = 0;
dp[len] = 1;
for (int i = len + 1; i <= maxa; i++) {
mmax(dp[i], dp[i - 1]);
mmax(dp[i], dp[i >> 1] + dp[(i + 1) >> 1]);
}
long long sum = 0;
for (int i = 1; i <= n; i++) sum += dp[a[i]];
return sum >= k;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i], maxa = max(maxa, a[i]);
int d = 1, c = 10000000, g, fin = -1;
while (d <= c) {
g = (d + c) / 2;
if (ok(g)) {
fin = g;
d = g + 1;
} else
c = g - 1;
}
cout << fin;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 10000005;
long long cnt[N];
int main() {
std::ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
long long n, k;
cin >> n >> k;
memset(cnt, 0, sizeof(cnt));
long long sim = 0;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
sim += x;
cnt[x]++;
}
if (sim < k) {
cout << -1;
return 0;
}
long long sum = 0;
for (int i = N - 1; i > 1; --i) {
sum += cnt[i];
if (2 * i - 1 < N) {
sum -= cnt[2 * i - 1];
cnt[2 * i - 1] = 0;
}
if (2 * i < N) {
sum -= cnt[2 * i];
cnt[2 * i] = 0;
}
if (2 * i + 1 < N) {
sum -= cnt[2 * i + 1];
cnt[2 * i + 1] = 0;
}
if (sum >= k) {
cout << i;
return 0;
}
cnt[i / 2] += cnt[i];
cnt[i - i / 2] += cnt[i];
}
cout << 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> a;
long long dp[10000005];
long long solve(int ele, int n) {
if (ele < n) return 0;
if (dp[ele] != -1) return dp[ele];
long long ans = 1;
ans = max(ans, solve(ele / 2, n) + solve((ele + 1) / 2, n));
return dp[ele] = ans;
}
bool check(long long n, long long k) {
long long ans = 0;
memset(dp, -1, sizeof dp);
for (auto ele : a) {
if (ele < n) break;
ans += solve((int)ele, (int)n);
if (ans >= k) return true;
}
return false;
}
int main() {
int n, k;
scanf("%d %d", &n, &k);
long long s = 0;
for (int i = 0; i < n; i++) {
int cur;
scanf("%d", &cur);
a.push_back(cur);
s += cur;
}
sort(a.rbegin(), a.rend());
if (s < k) {
puts("-1");
} else {
long long start = 1, end = a[0] + 1;
while (end - start > 1) {
long long mid = (start + end) / 2;
if (check(mid, (long long)k)) {
start = mid;
} else {
end = mid;
}
}
cout << start;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int k, n, a[1000010];
int f[10000010], ha[10000010], tim;
long long sum;
int cal(int x, int t) {
if (ha[x] == tim) return f[x];
ha[x] = tim;
if (x < t) return f[x] = 0;
if (x / 2 < t) return f[x] = 1;
if (x & 1) return f[x] = cal(x / 2, t) + cal(x / 2 + 1, t);
return f[x] = 2 * cal(x / 2, t);
}
bool check(int x) {
tim++;
long long all = 0;
for (int i = 1; i <= n; i++) {
all += cal(a[i], x);
if (all >= k) return 1;
}
return 0;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), sum += a[i];
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
if (sum < k) return puts("-1"), 0;
int l = 1, r = 1e7, ans = 1;
while (l <= r) {
int mid = l + r >> 1;
if (check(mid))
ans = mid, l = mid + 1;
else
r = mid - 1;
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000000;
const int MOD = 1000000007;
int n;
long long k;
vector<int> tang;
bool verify(int c) {
if (c == 0) return true;
if (c == 1) {
long long sum = 0;
for (int v : tang) {
sum += v;
if (sum >= k) return true;
}
return false;
}
long long sat = 0;
long long num = 1;
for (int v : tang) {
if (v < c) continue;
while (v >= 2 * num * c) num *= 2;
long long add = num;
if (v / num == 2 * c - 1) add = max(add, v % (2 * num));
sat += add;
if (sat >= k) return true;
}
return false;
}
int main() {
iostream::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) {
long long v;
cin >> v;
tang.push_back(v);
}
sort(tang.begin(), tang.end());
int l = 0, r = 10000000;
while (l <= r) {
int mid = (l + r) / 2;
if (verify(mid)) {
l = mid + 1;
} else
r = mid - 1;
}
if (l <= 1)
cout << -1 << endl;
else
cout << l - 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n, k, j, i;
long long int num = 0;
int a[10000002] = {0};
int b[10000002] = {0};
int main() {
scanf("%I64d%I64d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &j);
a[j]++;
}
for (i = 10000000; i > 0; i--) {
num += a[i];
a[i / 2] += a[i] + b[i];
b[i - i / 2] += a[i] + b[i];
if (num >= k) {
printf("%d", i);
return 0;
}
}
printf("-1");
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000 + 10;
const int maxv = 20000000 + 10;
inline int read() {
int ret = 0;
char ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
for (; ch >= '0' && ch <= '9'; ch = getchar()) ret = ret * 10 + ch - '0';
return ret;
}
long long cnt[maxv];
int n, k, pos, a[maxn];
int main() {
n = read(), k = read(), pos = 0;
int m = 100000000;
for (int i = 1, x; i <= n; ++i) {
x = read();
++cnt[x];
pos = max(x, pos);
m = min(x, m);
a[i] = x;
}
long long sum = 0;
for (int i = pos; i >= 1; --i) {
sum += cnt[i];
sum += cnt[i * 2] + cnt[i * 2 + 1];
if (sum >= k) {
printf("%d", i);
return 0;
}
cnt[i] += cnt[i * 2] * 2 + cnt[i * 2 + 1];
cnt[i + 1] += cnt[i * 2 + 1];
cnt[i * 2] = cnt[i * 2 + 1] = 0;
}
sum = 0;
for (int i = 1; i <= n; ++i) sum += a[i];
if (sum >= k)
printf("1\n");
else
printf("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double sn = 1e-6;
int n, k;
int arr[10000007];
int main() {
scanf("%d%d", &n, &k);
int max = 0;
long long tot = 0;
for (int i = 0; i < n; i++) {
int t = 0;
scanf("%d", &t);
arr[t]++;
if (t > max) {
max = t;
}
tot += t;
}
if (tot < k) {
printf("-1\n");
return 0;
}
int mini = 1;
int newn = n;
int t = 0;
if (newn >= k) {
for (int j = mini;; j++) {
t += arr[j];
if (newn - t < k) {
mini = j;
t -= arr[j];
break;
}
}
}
for (int i = max; i >= 0; i--) {
newn += arr[i];
if (i % 2 == 0) {
arr[i / 2] += 2 * arr[i];
} else {
arr[i / 2] += arr[i];
arr[i / 2 + 1] += arr[i];
}
arr[i] = 0;
if (newn >= k) {
if (newn - arr[i] >= k) {
if (!((i % 2 == 0 && i / 2 > mini) ||
(i % 2 == 1 && i / 2 + 1 > mini))) {
break;
}
if (i / 2 < mini) {
t += arr[i];
}
}
for (int j = mini;; j++) {
t += arr[j];
if (newn - t < k) {
mini = j;
t -= arr[j];
break;
}
}
}
}
printf("%d\n", mini);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
ifstream fin("moocast.in");
ofstream fout("moocast.out");
int n, k, x, first[10000002], a[10000002];
long long sum;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> x;
first[x]++;
}
for (int i = 10000000; i >= 1; i--) {
sum += first[i];
first[i / 2] += first[i] + a[i];
a[i - i / 2] += first[i] + a[i];
if (sum >= k) {
cout << i;
return 0;
}
}
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const long long LLINF = 0x3f3f3f3f3f3f3f3f;
const int maxn = 1e2 + 10;
const int maxm = 1e7 + 10;
int n, m, luna[maxm], saika[maxm];
long long tot;
int maxa = 0;
namespace FastIO {
bool IOError = 0;
inline char NextChar() {
static char buf[10000000], *p1 = buf + 10000000, *pend = buf + 10000000;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, 10000000, stdin);
if (pend == p1) {
IOError = 1;
return -1;
}
}
return *p1++;
}
inline bool Blank(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
template <class T>
inline bool Read(T &x) {
char ch;
while (Blank(ch = NextChar()))
;
if (IOError) return false;
for (x = 0; '0' <= ch && ch <= '9'; ch = NextChar())
x = (x << 3) + (x << 1) + ch - '0';
return true;
}
}; // namespace FastIO
using namespace FastIO;
bool check(int x) {
long long cnt = 0;
for (int i = 1; i <= maxa; i++) saika[i] = luna[i];
for (int i = maxa; i > 0; i--) {
if (i >= 2 * x) {
saika[i / 2] += saika[i];
saika[i / 2 + i % 2] += saika[i];
continue;
}
if (i >= x) cnt += saika[i];
}
return cnt >= m;
}
int main(int argc, char const *argv[]) {
cin >> n >> m;
long long ans = 0;
for (int i = 1; i <= n; i++) {
int x;
Read(x);
ans += x;
luna[x]++;
maxa = max(maxa, x);
}
if (ans < m) {
cout << -1;
return 0;
}
int le = 0, ri = maxa;
while (le < ri) {
int mid = (le + ri + 1) >> 1;
if (check(mid))
le = mid;
else
ri = mid - 1;
}
if (le == 0) le++;
cout << le << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, m, A[1000000 + 5];
long long sum, Q[1000000 + 5];
inline int getint() {
char ch = '\n';
for (; ch > '9' || ch < '0'; ch = getchar())
;
int res = ch - '0';
for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar())
res = res * 10 + ch - '0';
return res;
}
inline bool Check(long long x) {
long long res = 0;
for (Q[m = 0] = x; Q[m] < 1234567890987654321LL; m++) Q[m + 1] = Q[m] * 2;
for (int i = 1, t = 0; i <= n; i++) {
for (; Q[t] <= A[i]; t++)
;
res += t ? max(1LL << t - 1, (1LL << t) - (Q[t] - A[i])) : 0;
}
return res >= k;
}
int main() {
n = getint(), k = getint();
for (int i = 1; i <= n; i++) sum += (A[i] = getint());
sort(A + 1, A + n + 1);
long long l = 0, r = sum / k;
while (l < r) {
long long mid = l + r + 1 >> 1;
if (Check(mid))
l = mid;
else
r = mid - 1;
}
printf("%I64d\n", l ? l : -1LL);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
using ld = long double;
mt19937 rnd(time(nullptr));
const int SZ = 1e7;
int n = 0, k = 0;
vector<int> data;
lli buffer[SZ + 1];
lli GetValue(int a, int m) {
if (buffer[a] != -1) return buffer[a];
int b = a / 2;
if (b < m)
buffer[a] = 1;
else if (b * 2 == a)
buffer[a] = 2LL * GetValue(b, m);
else
buffer[a] = GetValue(b + 1, m) + GetValue(b, m);
return buffer[a];
}
bool Check(int m) {
if (m == 0) return true;
if (m == 1) {
lli sum = 0;
for (auto it : data) sum += it;
return (sum >= k);
}
if (m >= SZ + 1) return false;
memset(buffer, 0, sizeof(buffer));
buffer[m] = 1;
for (int i = m + 1; i <= SZ; i++) {
buffer[i] = max(1LL, buffer[i / 2] + buffer[i / 2 + i % 2]);
}
lli counter = 0;
for (auto it : data) {
counter += buffer[it];
}
return (counter >= k);
}
inline void Solve() {
cin >> n >> k;
data.resize(n);
for (auto &it : data) cin >> it;
int l = 0, r = 1e7 + 100;
while (r - l > 1) {
int m = l + (r - l) / 2;
if (Check(m))
l = m;
else
r = m;
}
if (l == 0)
cout << -1;
else
cout << l;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << fixed << setprecision(20);
Solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, a[1000009], dp[10000009];
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
int low = 0;
for (int i = 23; i >= 0; i--) {
int x = low + (1 << i);
fill(dp, dp + min(x, 10000001), 0);
for (int j = x; j <= 10000000; j++) {
if (j >= 2 * x)
dp[j] = dp[j / 2] + dp[j - j / 2];
else
dp[j] = 1;
}
long long sum = 0;
for (int j = 0; j < n; j++) sum += dp[a[j]];
if (sum >= m) low += 1 << i;
}
cout << (low ? low : -1) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n, e, a[1000100], l, m, r = 1e13;
;
bool ok(long long int x) {
long long int sum = 0, y, z, k;
for (int i = 0; i < n; ++i) {
y = a[i];
z = y >= x;
k = (y + 1) / 2;
while (k > x) z *= 2, y = k, k = (y + 1) / 2;
if (k == x) z *= 2, z = max(z + a[i] - k * z, z / 2);
sum += z;
}
return sum >= e;
}
int main() {
scanf("%lld%lld", &n, &e);
for (int i = 0; i < n; ++i) scanf("%lld", &a[i]);
while (l < r) {
m = (l + r + 1) / 2;
if (ok(m))
l = m;
else
r = m - 1;
}
printf("%lld", (l ? l : -1));
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int a[N];
int dp[10 * N];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
sort(a, a + n);
int lb = 0, rb = a[n - 1] + 1;
while (rb - lb > 1) {
int mb = (lb + rb) / 2;
for (int i = 0; i < 10 * N; ++i)
if (i <= mb)
dp[i] = (i < mb ? 0 : 1);
else
dp[i] = max(dp[i - 1], dp[i / 2] + dp[(i + 1) / 2]);
int cur = 0;
for (int i = 0; i < n && cur < k; ++i) cur += dp[a[i]];
if (cur >= k)
lb = mb;
else
rb = mb;
}
printf("%d", lb ? lb : -1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[10000001];
signed main() {
long long sum = 0, n, m, ma = -0x7f7f7f;
cin >> n >> m;
for (long long x = 1; x <= n; x++) {
long long y;
cin >> y;
a[y]++;
sum += y;
ma = max(ma, y);
}
if (sum < m) return puts("-1") * 0;
sum = 0;
for (long long x = ma; x >= 1; x--) {
sum += a[x];
if (x * 2 <= ma) sum -= a[x * 2];
if (x * 2 - 1 <= ma && (x != 1)) sum -= a[x * 2 - 1];
if (sum >= m) {
cout << x << endl;
return 0;
}
a[x / 2] += a[x];
a[(x + 1) / 2] += a[x];
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 2;
long long v[N], m[N];
int main() {
long long n, k, t;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> t;
++v[t];
}
long long cnt = 0;
for (int i = N - 2; i; --i) {
cnt += v[i];
cnt -= m[i];
if (!v[i]) continue;
if (i & 1) {
m[(i >> 1) + 1] += v[i];
v[i >> 1] += v[i];
v[(i >> 1) + 1] += v[i];
} else {
m[i >> 1] += v[i];
v[i >> 1] += 2 * v[i];
}
if (cnt >= k) {
cout << i;
return 0;
}
}
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int len = 1000000;
long long n, k, m, cnt, l, r;
int i;
long long a[len], dp[len * 10 + 10];
long long s;
int main() {
scanf("%lld", &n);
scanf("%lld", &k);
for (i = 0; i < n; i++) {
scanf("%lld", &a[i]);
s += a[i];
}
if (s < k) {
printf("%lld", -1ll);
return 0;
}
l = 0;
r = len * 10 + 1;
while (r > l + 1) {
m = (l + r) / 2;
long long cnt = 0;
for (i = 1; i <= len * 10; i++) dp[i] = 0;
for (i = m; i <= len * 10; i++) dp[i] = 1;
for (i = 2; i <= len * 10; i++)
dp[i] = max(dp[i], dp[i / 2] + dp[i / 2 + (i % 2)]);
for (i = 0; i < n; i++) {
cnt += dp[a[i]];
}
if (cnt >= k)
l = m;
else
r = m;
}
printf("%lld", l);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e7 + 5;
long long a[maxn] = {0};
int main() {
int n;
cin >> n;
long long k;
cin >> k;
int x, l = maxn, r = -1;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
++a[x];
if (l > x) l = x;
if (r < x) r = x;
}
long long cnt = n;
while (cnt - a[l] >= k) {
cnt -= a[l];
l++;
}
while (cnt < k) {
if (r == 1) break;
a[r / 2] += a[r];
a[r - r / 2] += a[r];
cnt += a[r];
if (l > r / 2) l = r / 2;
r--;
}
if (cnt < k) return puts("-1"), 0;
while (r / 2 > l) {
a[r / 2] += a[r];
a[r - r / 2] += a[r];
cnt += a[r];
while (cnt - a[l] >= k) {
cnt -= a[l];
l++;
}
r--;
}
cout << l << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
if (a == 0) return b;
return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1) ans = ((ans % m) * (a % m)) % m;
b /= 2;
a = ((a % m) * (a % m)) % m;
}
return ans % m;
}
long long n, k;
long long a[1000006];
long long dp[10000007];
bool check(long long mid) {
long long ans = 0;
for (int i = mid; i <= 10000000; i++) {
long long half = i / 2;
if (half >= mid)
dp[i] = dp[half] + dp[i - half];
else
dp[i] = 1;
}
for (int i = 1; i <= n; i++) {
if (a[i] >= mid) ans += dp[a[i]];
}
return ans >= k;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
long long lo = 1;
long long hi = 1000000000;
long long ans = -1;
while (lo <= hi) {
long long mid = (lo + hi) / 2;
if (check(mid)) {
ans = mid;
lo = mid + 1;
} else {
hi = mid - 1;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e7 + 5;
long long n, k;
long long a[1000005];
long long cnt[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (long long(i) = (1); (i) <= (n); ++(i)) {
cin >> a[i];
cnt[a[i]]++;
}
long long maxVal = 1e7;
long long ans = n;
while (ans < k && maxVal > 1) {
if (cnt[maxVal]) {
ans += cnt[maxVal];
cnt[maxVal / 2] += cnt[maxVal];
cnt[(maxVal + 1) / 2] += cnt[maxVal];
}
maxVal--;
}
if (ans < k)
cout << -1;
else {
long long minVal = 0;
while (ans >= k) {
if (ans - cnt[minVal] >= k) {
ans -= cnt[minVal++];
} else {
cnt[minVal] -= (ans - k);
break;
}
}
while (maxVal >= 2 * minVal) {
while (!cnt[minVal]) minVal++;
cnt[maxVal / 2] += cnt[maxVal];
cnt[(maxVal + 1) / 2] += cnt[maxVal];
long long delete_num = cnt[maxVal--];
while (cnt[minVal] <= delete_num && delete_num)
delete_num -= cnt[minVal++];
cnt[minVal] -= delete_num;
}
cout << minVal;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e10 + 10;
const int maxn = 1e7 + 100;
int n, x, Max;
long long k, tot;
int num[maxn], tmp[maxn];
long long judge(int mid) {
if (mid == 0) {
return INF;
}
long long ret = 0;
memcpy(tmp, num, sizeof(num));
for (int i = Max; i >= mid; --i) {
if (i / 2 >= mid) {
tmp[i / 2] += tmp[i];
tmp[(i + 1) / 2] += tmp[i];
} else {
ret += tmp[i];
}
}
return ret;
}
int main() {
ios::sync_with_stdio(false);
while (scanf("%d%I64d", &n, &k) != EOF) {
Max = 0;
tot = 0;
memset(num, 0, sizeof(num));
for (int i = 0; i < n; ++i) {
scanf("%d", &x);
Max = max(Max, x);
++num[x];
tot += x;
}
if (tot < k) {
printf("-1\n");
continue;
}
int low = 1, high = maxn;
int mid;
while (high - low > 1) {
mid = (low + high) >> 1;
if (judge(mid) >= k) {
low = mid;
} else {
high = mid;
}
}
printf("%d\n", low);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e7;
int N, K;
long long v[10000005], v2[10000005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> K;
for (int i = 1, x; i <= N; i++) {
cin >> x;
v[x]++;
v2[x]++;
}
for (int i = 10000000; i >= 1; i--) {
v[i] += v[i + 1];
if (2 * i <= 10000000) {
v[i] += v2[2 * i];
v2[i] += 2 * v2[2 * i];
}
if (2 * i - 1 <= 10000000) {
v2[i] += v2[2 * i - 1];
v2[i - 1] += v2[2 * i - 1];
v[i - 1] += v2[2 * i - 1];
}
if (v[i] >= K) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
register int c = getchar();
x = 0;
int neg = 0;
for (; ((c < 48 || c > 57) && c != '-'); c = getchar())
;
if (c == '-') {
neg = 1;
c = getchar();
}
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
if (neg) x = -x;
}
inline void writeln(int x) {
char buffor[21];
register int i = 0;
int neg = 0;
if (x < 0) {
neg = 1;
x = -x;
}
do {
buffor[i++] = (x % 10) + '0';
x /= 10;
} while (x);
i--;
if (neg) putchar('-');
while (i >= 0) putchar(buffor[i--]);
putchar('\n');
}
const int A = (int)1e7 + 1;
long long dem[2 * A];
int n;
long long k;
void input() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
dem[a]++;
}
}
void solve() {
long long all = 0;
for (int i = (int)1e7; i >= 1; i--) {
all += dem[i];
all -= dem[i * 2] + dem[i * 2 - 1];
if (i == 1) all += dem[1];
if (all >= k) {
cout << i;
return;
}
if (i % 2 == 0)
dem[i / 2] += dem[i] * 2;
else {
dem[i / 2] += dem[i];
dem[i / 2 + 1] += dem[i];
}
}
cout << -1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
input();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long cnt[10000001];
long long sum = 0;
int main() {
ios_base::sync_with_stdio(0);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
cnt[x]++;
sum += x;
}
if (sum < k) {
cout << -1;
return 0;
}
int pt = 10000000;
long long currSum = 0;
while (currSum + cnt[pt] < k) {
currSum += cnt[pt];
pt--;
}
currSum += cnt[pt];
for (int i = 10000000; i >= 1; i--) {
if (cnt[i] == 0) continue;
if (i / 2 < pt) {
cout << pt;
return 0;
}
currSum += cnt[i];
if (i % 2 == 0) {
cnt[i / 2] += cnt[i] * 2;
} else {
cnt[i / 2 + (i & 1)] += cnt[i];
cnt[i / 2] += cnt[i];
}
cnt[i] = 0;
while (currSum - cnt[pt] >= k) {
currSum -= cnt[pt];
pt++;
}
}
cout << pt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
long long n, k, arr[N];
bool ok(long long mid) {
long long pp = 0;
long long bb = mid;
long long cnt = 1ll;
int i = 0;
while (i < n) {
if (arr[i] < mid) {
i++;
continue;
}
int indx = i;
while (i < n && arr[i] <= bb * 2ll - cnt) {
pp += bb / mid;
i++;
}
while (i < n && arr[i] < bb * 2ll) {
pp += (bb * 2ll) / mid - (bb * 2ll - arr[i]);
i++;
}
while (i < n && arr[i] == bb * 2ll) {
pp += (bb * 2ll) / mid;
i++;
}
if (pp >= k) return true;
bb = bb * 2ll;
cnt = cnt * 2ll;
}
if (pp >= k)
return true;
else
return false;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
long long low = 1, high = 1e12, mid;
while (low < high) {
mid = (low + high + 1ll) / 2ll;
if (ok(mid))
low = mid;
else
high = mid - 1;
}
if (!ok(low)) low = -1;
cout << low << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 5;
int n, k, Max, a[N], F[N];
void Input() {
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
Max = *max_element(a + 1, a + n + 1);
}
bool ok(int c_min) {
memset(F, 0, sizeof(F));
for (int i = c_min; i <= Max; i++) {
if (i / 2 >= c_min)
F[i] += F[i / 2] + F[i / 2 + i % 2];
else
F[i] = 1;
}
long long sum = 0;
for (int i = 1; i <= n; i++)
if (a[i] >= c_min) sum += F[a[i]];
return (sum >= k);
}
void Solve() {
int res = -1, l = 1, r = Max;
while (l <= r) {
int mid = (l + r) / 2;
if (ok(mid) == true)
res = mid, l = mid + 1;
else
r = mid - 1;
}
cout << res << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
Input();
Solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 6;
const int MAX = 1e7 + 7;
int n, k;
int a[N];
int dp[MAX];
bool can(int x) {
memset(dp, 0, sizeof(dp));
for (int i = x; i <= MAX; i++) {
dp[i] = max(1, dp[i / 2] + dp[(i + 1) / 2]);
}
int kk = k;
for (int i = 0; i < n; i++) {
kk -= a[i] < x ? 0 : dp[a[i]];
if (kk <= 0) {
return true;
}
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int lo = 0, hi = 1e7 + 100;
while (lo + 1 < hi) {
int mid = (lo + hi) / 2;
if (!can(mid)) {
hi = mid;
} else {
lo = mid;
}
}
cout << (lo == 0 ? -1 : lo) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int tange[1000000];
int n, k;
int dp[10000001];
int a;
int get(int b) {
int &r = dp[b];
if (r != -1) return r;
if (b < a) return r = 0;
r = 1;
if ((b >> 1) < a) return r;
r = get((b >> 1)) + get((b >> 1) + (b & 1));
return r;
}
bool check() {
memset(dp, -1, sizeof dp);
int nbr = 0;
for (int i = n - 1; i >= 0; i--) {
nbr += get(tange[i]);
if (nbr >= k) return 1;
}
return 0;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d", tange + i);
int l = 1, r = 10000000;
int ans = -1;
sort(tange, tange + n);
while (l <= r) {
int m = (l + r) >> 1;
a = m;
if (check())
ans = m, l = m + 1;
else
r = m - 1;
}
cout << ans;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.