Codeforces Round #748 (Div. 3)
快ICPC了,每天整一场Codeforces/Atcoder玩玩。
A、Elections
每个值都要成为序列中的最大值。暴力跑一下即可。
#include <bits/stdc++.h>
typedef long long ll;
int main()
{
int t; scanf("%d", &t);
while (t--)
{
int a[3];
for (int i = 0; i < 3; ++i)
scanf("%d", &a[i]);
for (int i = 0; i < 3; ++i)
{
int ans = 0;
for (int j = 0; j < 3; ++j)
if (j == i) continue;
else if (a[j] >= a[i]) ans = std::max(ans, a[j] + 1);
printf("%d ", std::max(ans - a[i], 0));
}
printf("\n");
}
return 0;
}
B、Make it Divisible by 25
发现25的倍数末两位只能为00、25、50、75。
枚举两个数位 i , j ( i < j ) i,j(i<j) i,j(i<j),若是上述四个中的一种则用 n − i − 2 n-i-2 n−i−2更新答案。
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 0x3f3f3f3f;
bool check(int x, int y)
{
return x == 2 && y == 5 || x == 5 && y == 0 || x == 7 && y == 5 || x == 0 && y == 0;
}
int main()
{
int t; scanf("%d", &t);
while (t--)
{
ll n; scanf("%lld", &n);
std::vector < int > a;
do a.push_back(n % 10); while (n /= 10);
std::reverse(a.begin(), a.end());
int ans = INF;
for (int i = 0; i < a.size(); ++i)
for (int j = i + 1; j < a.size(); ++j)
if (check(a[i], a[j])) ans = std::min(ans, int(a.size()) - i - 2);
printf("%d\n", ans);
}
return 0;
}
C、Save More Mice
没仔细想,一眼感觉算到终点的距离和。从大到小排序计算老鼠到终点的距离和,如果和大于等于 n n n则到此为止。
#include <bits/stdc++.h>
typedef long long ll;
int main()
{
int t; scanf("%d", &t);
while (t--)
{
int n, k; scanf("%d%d", &n, &k);
std::vector < int > a(k + 1);
for (int i = 1; i <= k; ++i)
scanf("%d", &a[i]);
std::sort(a.begin() + 1, a.end(), std::greater < int >());
ll ans = 0, sum = 0;
for (int i = 1; i <= k; ++i)
{
sum += n - a[i];
if (sum < n) ++ans;
else break;
}
printf("%lld\n", ans);
}
return 0;
}
D1、All are Same
设最终变为 p p p,那么有 a i − t i k = a j − t j k = p a_i-t_ik=a_j-t_jk=p ai−tik=aj−tjk=p,移项得 a i − a j = ( t i − t j ) k a_i-a_j=(t_i-t_j)k ai−aj=(ti−tj)k,即 k ∣ a i − a j k|a_i-a_j k∣ai−aj。
从小到大排序后取相邻两数gcd即可。
O ( n l o g n ) O(nlogn) O(nlogn)的算法给了 n ≤ 40 n\le 40 n≤40,麻了
#include <bits/stdc++.h>
typedef long long ll;
int main()
{
int t; scanf("%d", &t);
while (t--)
{
int n; scanf("%d", &n);
std::vector < int > a(n + 1);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
std::sort(a.begin() + 1, a.end());
int ans = 0;
for (int i = 2; i <= n; ++i)
ans = std::__gcd(ans, a[i] - a[i - 1]);
printf("%d\n", ans == 0? -1: ans);
}
return 0;
}
D2、Half of Same
原理还是和上一道题差不多,假设我们取 a i a_i ai和 a j a_j aj进行操作,那么还是有 k ∣ a i − a j k|a_i-a_j k∣ai−aj。
会发现 k k k的取值可能为任意两数的差的其中一个因数,那么先预处理出所有 k k k,之后从大到小判断是否满足即可。
因为需要取出来的数集必须要满足任意两数的差是 k k k的倍数,即任意两数模 k k k同余,所以枚举第一个数,之后扫一遍,把同余的数全部塞进去看看个数是否大于 n 2 \frac{n}{2} 2n即可。
特判一下若相同的数个数大于等于 n 2 \frac{n}{2} 2n输出-1。
#include <bits/stdc++.h>
typedef long long ll;
int main()
{
int t; scanf("%d", &t);
while (t--)
{
int n; scanf("%d", &n);
std::vector < int > a(n + 1);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
std::sort(a.begin() + 1, a.end());
std::vector < int > alls;
for (int i = 1; i <= n; ++i)
for (int j = i + 1; j <= n; ++j)
{
int u = a[j] - a[i];
for (int k = 1; k <= u / k; ++k)
if (u % k == 0)
alls.push_back(k), alls.push_back(u / k);
}
std::sort(alls.begin(), alls.end());
alls.erase(std::unique(alls.begin(), alls.end()), alls.end());
int ans = 0;
for (auto &i : alls)
{
for (int j = 1; j <= n; ++j)
{
int prv = a[j], cnt = 1;
for (int k = j + 1; k <= n; ++k)
if ((a[k] - prv) % i == 0)
prv = a[k], ++cnt;
if (cnt >= n / 2)
{
ans = i;
break;
}
}
}
std::map < int, int > cnt;
for (int i = 1; i <= n; ++i)
cnt[a[i]]++;
for (auto &i : cnt)
if (i.second >= n / 2)
{
ans = 0;
break;
}
printf("%d\n", ans == 0? -1: ans);
}
return 0;
}
跑得飞快。
E、Gardener and Tree
从叶子节点开始往上,算每个节点在第几次被拿掉就好了。
#include <bits/stdc++.h>
typedef long long ll;
int main()
{
int t; scanf("%d", &t);
while (t--)
{
int n, k; scanf("%d%d", &n, &k);
std::vector < std::vector < int > > G(n + 1, std::vector < int > ());
std::vector < int > d(n + 1, 0);
std::vector < int > rounds(n + 1, 0), vis(n + 1, 0);
for (int i = 1; i <= n - 1; ++i)
{
int u, v; scanf("%d%d", &u, &v);
G[u].push_back(v); G[v].push_back(u);
++d[u], ++d[v];
}
std::vector < int > a, b;
for (int i = 1; i <= n; ++i)
if (d[i] == 1) a.push_back(i), vis[i] = 1;
int cnt = 0;
while (!a.empty())
{
++cnt;
for (auto &i : a) rounds[i] = cnt;
std::vector < int > t;
for (auto &i : a)
for (auto &j : G[i])
--d[j], t.push_back(j);
for (auto &i : t)
if (d[i] == 1 && !vis[i])
b.push_back(i), vis[i] = 1;
a = b; b.clear();
}
++cnt;
for (auto &i : rounds)
if (i == 0) i = cnt;
int ans = 0;
for (int i = 1; i <= n; ++i)
if (rounds[i] > k) ++ans;
printf("%d\n", ans);
}
return 0;
}
F、Red-Black Number
输出方案恶心死我了。
d p [ i ] [ j ] [ r a ] [ r b ] dp[i][j][ra][rb] dp[i][j][ra][rb]:对前 i i i个数进行染色,且以第 i i i个数为结尾时,是否存在一种方案使得红色的数字有 j j j个,并且满足红色的数字模 a a a余 r a ra ra且黑色的数字模 b b b余 r b rb rb。
那么有:
d p [ i + 1 ] [ j + 1 ] [ ( r a ∗ 10 + s [ i + 1 ] ) % a ] [ r b ] ∣ = d p [ i ] [ j ] [ r a ] [ r b ] dp[i+1][j+1][(ra*10+s[i+1])\%a][rb]|=dp[i][j][ra][rb] dp[i+1][j+1][(ra∗10+s[i+1])%a][rb]∣=dp[i][j][ra][rb]
d p [ i + 1 ] [ j ] [ r a ] [ ( r b ∗ 10 + s [ i + 1 ] ) % b ] ∣ = d p [ i ] [ j ] [ r a ] [ r b ] dp[i+1][j][ra][(rb*10+s[i+1])\%b]|=dp[i][j][ra][rb] dp[i+1][j][ra][(rb∗10+s[i+1])%b]∣=dp[i][j][ra][rb]
然后把路径记下来往回推即可。
#include <bits/stdc++.h>
typedef long long ll;
const int MAXN = 50, INF = 0x3f3f3f3f;
bool dp[MAXN][MAXN][MAXN][MAXN];
std::tuple < int, int, int, int > rec[MAXN][MAXN][MAXN][MAXN];
char s[MAXN], col[MAXN];
int main()
{
int t; scanf("%d", &t);
while (t--)
{
memset(dp, 0, sizeof dp);
memset(rec, 0, sizeof rec);
int n, a, b; scanf("%d%d%d", &n, &a, &b);
scanf("%s", s + 1);
dp[0][0][0][0] = 1;
for (int i = 0; i < n; ++i)
for (int j = 0; j <= i; ++j)
for (int ra = 0; ra < a; ++ra)
for (int rb = 0; rb < b; ++rb)
if (dp[i][j][ra][rb] == 1)
{
dp[i + 1][j + 1][(ra * 10 + s[i + 1] - '0') % a][rb] |= dp[i][j][ra][rb];
rec[i + 1][j + 1][(ra * 10 + s[i + 1] - '0') % a][rb] = {i, j, ra, rb};
dp[i + 1][j][ra][(rb * 10 + s[i + 1] - '0') % b] |= dp[i][j][ra][rb];
rec[i + 1][j][ra][(rb * 10 + s[i + 1] - '0') % b] = {i, j, ra, rb};
}
int ans = INF, pos;
for (int i = 1; i < n; ++i)
if (dp[n][i][0][0])
if (std::abs(n - 2 * i) < ans)
ans = std::abs(n - 2 * i), pos = i;
if (ans == INF) printf("-1\n");
else
{
int i = n, j = pos, ra = 0, rb = 0;
while (i)
{
auto [ti, tj, tra, trb] = rec[i][j][ra][rb];
if (tj == j) col[i] = 'B';
else col[i] = 'R';
i = ti, j = tj, ra = tra, rb = trb;
}
col[n + 1] = 0;
printf("%s", col + 1);
printf("\n");
}
}
return 0;
}
今天累了,G姑且不补了,摸了。