Toyota Programming Contest 2023#7(AtCoder Beginner Contest 328) - AtCoder
很好的场,使我顺开上分
今年icpc俩铜,得加训备战明年的xcpc了
A - Not Too Hard
题意:
给出n个数,求出他们之中小于等于x的所有数的和
题解:
void solve()
{
int n, x, ans = 0;
scanf("%d%d", &n, &x);
for (int i = 1, a; i <= n; ++i)
{
scanf("%d", &a);
if (a <= x)ans += a;
}
printf("%d\n", ans);
}
B - 11/11
题意:
一年N个月,每个月Di天,为有多少天他们月份和日的十进制位上的数全部相同(如11.11)
题解:
做法很多,直接暴力枚举check了
int check(int a, int b)
{
set<int>st;
while (a)st.insert(a % 10), a /= 10;
while (b)st.insert(b % 10), b /= 10;
return st.size() == 1;
}
void solve()
{
int n, ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
{
int m;
scanf("%d", &m);
for (int j = 1; j <= m; ++j)
ans += check(i, j);
}
printf("%d\n", ans);
}
C - Consecutive
题意:
给出一个字符串S,有Q个询问,每个询问问子串Sli,Sli+1,...,Sri中存在多少个连续两个字符相同的情况
题解:
预处理前缀和即可
char ch[N];
int s[N];
void solve()
{
int n, q;
scanf("%d%d%s", &n, &q, ch + 1);
for (int i = 2; i <= n; ++i)
{
if (ch[i] == ch[i - 1])
++s[i];
s[i] += s[i - 1];
}
while (q--)
{
int l, r;
scanf("%d%d", &l, &r);
printf("%d\n", s[r] - s[l]);
}
}
D - Take ABC
题意:
给出一个仅由字符'A'、'B'、'C'构成的字符串,当字符串中存在一个连续的"ABC"时,你将其删除,求在删到找不到"ABC"后的字符串
题解:
用栈存字符,当栈尾部的三个元素依次分别为'A'、'B'、'C',pop掉栈尾的三个元素
char ch[N];
vector<char>ans;
void solve()
{
scanf("%s", ch + 1);
for (int i = 1; ch[i]; ++i)
{
ans.push_back(ch[i]);
while (ans.size() >= 3)
{
int n = ans.size();
if (ans[n - 3] != 'A')break;
if (ans[n - 2] != 'B')break;
if (ans[n - 1] != 'C')break;
ans.pop_back();
ans.pop_back();
ans.pop_back();
}
}
for (auto i : ans)printf("%c", i);
}
E - Modulo MST
题意:
给定一个N点M边的有权简单联通无向图,问一个最小生成树在取模K意义下的最小花费
题解:
因为是最小生成树,边的数量一定为N-1,N<=8,M<=n*(n-1)/2=28,枚举C(M,N-1)种情况然后check选这N-1条边是否使图联通,若联通与答案取min即可
int n, m, u[40], v[40], f[10], p[10];
LL k, w[40], ans = 1e18;
int find(int x)
{
if (p[x] != x)
p[x] = find(p[x]);
return p[x];
}
void check()
{
LL cost = 0;
for (int i = 1; i <= n; ++i)
p[i] = i;
for (int i = 1; i < n; ++i)
{
p[find(u[f[i]])] = find(v[f[i]]);
cost = (cost + w[f[i]]) % k;
}
int flag = 0;
for (int i = 1; i <= n; ++i)
flag += (i == find(i));
if (flag == 1)ans = min(ans, cost);
}
void dfs(int step, int t)
{
if (step == n)
{
check();
return;
}
for (; t <= m; ++t)
{
f[step] = t;
dfs(step + 1, t + 1);
}
}
void solve()
{
scanf("%d%d%lld", &n, &m, &k);
for (int i = 1; i <= m; ++i)
scanf("%d%d%lld", &u[i], &v[i], &w[i]);
dfs(1, 1);
printf("%lld\n", ans);
}
F - Good Set Query
题意:
给出Q个三元组(ai,bi,di),一个三元组集合S {1,2,...,Q} 是一个好的集合的定义如下:
可以构造一个数组X(X1,X2,...,XN)满足所有Xai-Xbi=di,对于所有i属于集合S
S刚开始是一个空集,你需要依次尝试往集合中加入三元组Qi,当S∪{i}依然是一个好的集合时,将i加入集合S,求完成所有尝试加入操作之后的集合S
题解:
带权并查集,感觉像是有点典(?),维护x与其祖先p[x]的差值s[x],当尝试加入i时,若ai与bi不属于一个集合,则合并集合,同时直接将i加入答案集合S;若ai与bi属于一个集合,若s[ai]-s[bi]=di则可以将i加入S
int p[N];
LL s[N];
vector<int>ans;
int find(int x)
{
if (p[x] != x)
{
int t = p[x];
p[x] = find(p[x]);
s[x] += s[t];
}
return p[x];
}
void solve()
{
int n, q;
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; ++i)
p[i] = i;
for (int i = 1; i <= q; ++i)
{
int a, b, d;
scanf("%d%d%d", &a, &b, &d);
int pa = find(a), pb = find(b);
if (pa != pb)
{
p[pa] = b;
s[pa] = d - s[a];
ans.push_back(i);
}
else if (s[a] - s[b] == d)
ans.push_back(i);
}
for (auto i : ans)printf("%d ", i);
}