ACGO 排位赛#13 - 预告&答疑
2024-10-08 10:01:25
发布于：加拿大
首先先预祝大家有一个快乐的国庆节（虽然我没有国庆节，这真是个悲伤的事情）。
关于比赛的任何问题，都可以在评论区回复我。数据合法性的验证代码也会在比赛开始后公布。
比赛答疑
- 五张一样的牌算高牌，应该输出 High Card
- 请仔细看题。
比赛预告
"The view's not so good from inside the city, though…"
"Next time, then. I know a place where you can see them more clearly. I'll take you there in fifty years."
"Transformation starts with one change in a world of rules."
"Where chaos meets order, and everything finds its form."
"Cards aren't just about luck, are they?"
"No, it's about knowing the best combos."
"The strategy lies between the points."
"Exactly, it's all about the connections."
"Even small decisions matter in a world of possibilities."
"Yeah, it’s not about the center but where paths align."
"Territory isn't just about space."
"Right, it's about peace and balance."
"In the digital age, data isn't the only cost."
"True, energy powers the future… Macw's AI startups are all over that."
中文翻译如下：
“在城市里看风景不太好吧……”
“下次吧。我知道有个地方能看得更清楚。五十年后带你去。”
“在规则的世界里，变化从一个小小的转变开始。”
“当混乱与秩序交汇，一切都会找到自己的形态。”
“打牌可不仅仅是靠运气，对吧？”
“没错，关键在于你能组合出最好的牌。”
“胜负的关键其实在点与点之间。”
“正是如此，连接才是策略的核心。”
“在无限可能的世界里，连小决定都至关重要。”
“对，关键不是中心，而是所有道路汇聚的地方。”
“领地不仅仅是空间。”
“对，是真正的平衡与和平。”
“在数字时代，代价不仅是数据。”
“没错，能源才是推动未来的力量……Macw 的 AI 初创公司正是踩在这个浪潮上。”
数据合法性校验
T1 - 纪元流星雨
T = int(input())
assert 1 <= T <= 100
for i in range(T):
B, L, E = map(int, input().split())
assert 1 <= B <= 10 ** 8
assert 20 <= L <= 10 ** 8
assert 0 <= E <= 49
print("testcases is valid.")
T2 - MARCOncatenation
T = int(input())
assert 1 <= T <= 100
for i in range(T):
string = input()
assert string.lower() == string
assert string.isalpha()
assert 1 <= len(string) <= 500
print("testcases is valid.")
T3 - TNT接力
T = int(input())
assert 1 <= T <= 100
for i in range(T):
N, M = map(int, input().split())
assert 1 <= N <= 10000
assert 1 <= M <= 10000
string = input()
assert len(string) == N
assert string.count("-") + string.count("#") == N
print("testcases is valid.")
T4 - 小丑牌
T = int(input())
assert 1 <= T <= 10 ** 5
numSet = ["J", "Q", "K", "A"]
for i in range(2, 11):
numSet.append(str(i))
rankSet = ["Spade", "Heart", "Diamond", "Club"]
for testcase in range(T):
input()
for i in range(5):
num, rank = input().split()
assert num in numSet
assert rank in rankSet
print("testcase is valid.")
T5 - Vertex Verse
n, m, q = map(int, input().split())
assert 1 <= n <= 500
assert 1 <= m <= 500
assert 1 <= q * 2 <= min(10 ** 4, n * (n - 1) + m * (m - 1))
for i in range(q):
for j in range(2):
a, b, c, d = map(int, input().split())
assert 1 <= a <= n
assert 1 <= b <= m
assert 1 <= c <= n
assert 1 <= d <= m
assert abs(a - c) + abs(b - d) == 1
print("testcase is valid.")
T6 - 最优政府大楼选址 - 2
N = int(input())
assert 1 <= N <= 5000
E = list(map(int, input().split()))
assert len(E) == N
for i in E:
assert 1 <= i <= 10
for i in range(N):
xi, yi = map(float, input().split())
assert 0 <= abs(xi) <= 10 ** 3
assert 0 <= abs(yi) <= 10 ** 3
print("testcases is valid.")
T7 - 乌龟养殖场
N, M = map(int, input().split())
assert 1 <= N <= 500
assert 1 <= M <= 10
for i in range(N):
row = list(map(int, input().split()))
assert row.count(0) + row.count(1) == M
print("testcases is valid.")
T8 - 数据中心能耗分析
N, M = map(int, input().split())
assert 1 <= N <= 10 ** 5
assert 1 <= M <= 10 ** 5
A = list(map(int, input().split()))
for i in A:
assert -10000 <= i <= 10000
assert len(A) == N
for i in range(M):
op = list(map(int, input().split()))
assert op[0] == 1 or op[0] == 2
if op[0] == 1:
T, L, R, K = op
assert 1 <= L and L <= R and R <= N
assert -1000 <= K <= 1000
else:
T, L, R = op
assert 1 <= L and L <= R and R <= N
print("testcases is valid.")
全部评论 33
正经的翻译：
“在ACGO里刷AK不太好吧……”
“确实啊。我知道有种方法能变得更强。五十年后带你去。”“在C++的世界里，变化从一个小小的解题开始。”
“当WA与AC交汇，一切都会找到自己的形态。”“做题可不仅仅是靠骗分，对吧？”
“没错，关键在于你能写出最好的暴力。”“AC的关键其实在一念之间。”
“正是如此，思考才是策略的核心。”“在无限可能的世界里，连小决定都至关重要。”
“对，关键不是中心，而是所有程序汇聚的地方。”“C++不仅仅是AC。”
“对，是真正的WA与TLE。”“在WA时代，代价不仅是造不出数据。”
“没错，AC才是推动未来的力量…… Macw07 的 AC 初创公司正是踩在这个浪潮上。”2024-09-28 来自 广东
27夏
https://www.acgo.cn/contest/detail/4442?matchRoundId=4442&examId=46478&teamCode=1691092370071752704&openLevel=22024-10-07 来自 北京
0当WA和AC交汇的时候，我******************************************************************************
2024-10-05 来自 江苏
0
有帮助，赞一个