A - Recovering a Small String
cpp
string solve() {
cin >> n;
s = "aaa";
n -= 3;
if (n) s[2] += min(n, 25), n -= min(n, 25);
if (n) s[1] += min(n, 25), n -= min(n, 25);
if (n) s[0] += min(n, 25), n -= min(n, 25);
return s;
}
B - Make Equal
cpp
string solve() {
cin >> n;
ll res = 0, sum = 0;
for (int i = 1; i <= n; i ++) cin >> a[i], sum += a[i];
sum /= n;
for (int i = 1; i <= n; i ++) {
res += a[i];
if (res < sum * i) return no;
}
return yes;
}
C - Make Equal Again
cpp
int solve() {
cin >> n;
for (int i = 0; i < n; i ++) cin >> a[i];
if (n == 1) return 0;
int l = 0, r = n - 1;
while (a[l] == a[l + 1] && l < n - 1) l ++;
while (a[r] == a[r - 1] && r) r --;
if (l > r) return 0;
if (a[0] == a[n - 1]) return r - l - 1;
return min(n - l - 1, r);
}
D - Divisible Pairs
cpp
ll solve() {
cin >> n >> x >> y;
for (int i = 0; i < n; i ++) {
int t; cin >> t;
a[i] = t % x, b[i] = t % y;
}
map<pii, int> mp;
ll res = 0;
for (int i = 0; i < n; i ++) {
res += mp[{(x - a[i]) % x, b[i]}];
mp[{a[i], b[i]}] ++;
}
return res;
}
E - Anna and the Valentine's Day Gift
cpp
string solve() {
cin >> n >> m;
ll res = 0, c0 = 0;
for (int i = 0; i < n; i ++) {
int x; cin >> x;
a[i] = 0;
if (!x) {
c0 ++;
res ++;
continue;
}
while (x % 10 == 0) x /= 10, a[i] ++;
while (x) x /= 10, res ++;
}
if (c0 == n) return aa;
sort(a, a + n);
reverse(a, a + n);
for (int i = 0; i < n; i ++)
if (i & 1) res += a[i];
return res > m ? bb : aa;
}
F - Chat Screenshots
题意:每个人将自己放到最前面,其他人顺序不变
不管第一个人,看后面 n − 1 n-1 n−1 个人的顺序有没有冲突,即逆序对组成了环,拓扑排序即可
cpp
string solve() {
cin >> n >> m;
vector<vector<int>> e(n + 1);
vector<int> d(n + 1);
while (m --)
for (int i = 0; i < n; i ++) {
cin >> a[i];
if (i > 1) e[a[i - 1]].emplace_back(a[i]), d[a[i]] ++;
}
queue<int> q;
for (int i = 1; i <= n; i ++)
if (!d[i]) q.push(i);
int cnt = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
cnt ++;
for (auto v : e[u])
if (-- d[v] == 0) q.push(v);
}
return cnt == n ? yes : no;
}
G - One-Dimensional Puzzle
挡板法
cpp
int qpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1) res = (ll)res * a % mod;
a = (ll)a * a % mod;
b >>= 1;
}
return res;
}
inline int inv(int x) { return qpow(x, mod - 2); }
inline int C(int a, int b) { return (ll)fac[a] * infac[b] % mod * infac[a - b] % mod; }
ll solve() {
cin >> c1 >> c2 >> c3 >> c4;
if (abs(c1 - c2) > 1) return 0;
if (c1 == 1 && !c2 || !c1 && c2 == 1) return 1;
if (!c1 && !c2) return !(c3 && c4);
if (!c3 && !c4) return (c1 == c2) + 1;
ll res = 0;
if (c1 >= c2) {
int l = c2 + 1, r = c1;
res += (ll)C(l + c4 - 1, c4) * C(r + c3 - 1, c3);
}
if (c2 >= c1) {
int l = c2, r = c1 + 1;
res += (ll)C(l + c4 - 1, c4) * C(r + c3 - 1, c3);
}
return res % mod;
}
signed main() {
FastIO
*fac = 1;
for (int i = 1; i <= M; i ++) fac[i] = (ll)fac[i - 1] * i % mod;
infac[M] = inv(fac[M]);
for (int i = M - 1; i >= 0; i --) infac[i] = (ll)infac[i + 1] * (i + 1) % mod;
Cases
cout << solve() << endl;
return 0;
}