A - Jellyfish and Undertale
ll solve() {
int a, b, n; cin >> a >> b >> n;
ll res = b;
for (int i = 1; i <= n; i ++) {
int x; cin >> x;
res += min(a - 1, x);
}
return res;
}
B - Jellyfish and Game
ll solve() {
int n, m, k; cin >> n >> m >> k;
ll res = 0;
for (int i = 1; i <= n; i ++) cin >> a[i], res += a[i];
for (int i = 1; i <= m; i ++) cin >> b[i];
sort(a + 1, a + n + 1), sort(b + 1, b + m + 1);
if (k & 1) res = max(res, res + b[m] - a[1]);
else {
if (a[1] < b[m]) res += b[m] - a[1], swap(a[1], b[m]);
res = min(res, res + min(b[1], b[m]) - max(a[1], a[n]));
}
return res;
}
C - Jellyfish and Green Apple
ll solve() {
ll n, m; cin >> n >> m;
n %= m;
ll res = 0;
int idx = 0;
while (n) {
res += n;
n <<= 1;
n %= m;
if (++ idx == 30) return -1;
}
return res;
}
D - Jellyfish and Mex
int solve() {
int n; cin >> n;
map<int, int> mp;
for (int i = 1; i <= n; i ++) {
int x; cin >> x;
mp[x] ++;
}
int mex = 0;
while (mp[mex]) mex ++;
vector<int> f(mex + 1, 1e9);
f[mex] = 0;
for (int i = mex; i; i --)
for (int j = 0; j < i; j ++)
f[j] = min(f[j], f[i] + i * (mp[j] - 1) + j);
return f[0];
}