Educational Codeforces Round 117 (Rated for Div. 2) ABCD (更新中)

本文探讨了四个技术问题:计算两点之间的曼哈顿距离,找到满足条件的特殊排列,避免聊天禁言策略,以及判断魔法配对是否可达。通过实例解析和代码实现,展示了如何在这些技术场景中寻找解决方案。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

A. Distance

Let’s denote the Manhattan distance between two points p1 (with coordinates (x1,y1)) and p2 (with coordinates (x2,y2)) as d(p1,p2)=|x1−x2|+|y1−y2|. For example, the distance between two points with coordinates (1,3) and (4,2) is |1−4|+|3−2|=4.

You are given two points, A and B. The point A has coordinates (0,0), the point B has coordinates (x,y).

Your goal is to find a point C such that:

both coordinates of C are non-negative integers;
d(A,C)=d(A,B)2 (without any rounding);
d(B,C)=d(A,B)2 (without any rounding).
Find any point C that meets these constraints, or report that no such point exists.

AC

#include <bits/stdc++.h>
using namespace std;

int main() {
	int t; cin>>t;
	while (t--) {
		int a,b; cin>>a>>b;
		if (a+b&1) puts("-1 -1");
		else if (a<b) printf("0 %d\n",a+b>>1);
		else printf("%d 0\n",a+b>>1);
	}
	return 0;
}

B. Special Permutation

AC

#include <bits/stdc++.h>
using namespace std;
int T,n,a,b,seq[105];
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d%d",&n,&a,&b);
		if(a>n/2+1||b<n/2){printf("-1\n");continue;}
		else if((a==n/2+1&&b!=n/2)||(b==n/2&&a!=n/2+1)){printf("-1\n");continue;}
		for(int al=1;al<=n;al++) seq[al]=n+1-al;
		if(b!=n/2) swap(seq[n+1-a],seq[n+1-b]);
		for(int al=1;al<=n;al++) printf("%d ",seq[al]);
		printf("\n");
	}
	return 0;
}

C. Chat Ban

You are a usual chat user on the most famous streaming platform. Of course, there are some moments when you just want to chill and spam something.

More precisely, you want to spam the emote triangle of size k. It consists of 2k−1 messages. The first message consists of one emote, the second one — of two emotes, …, the k-th one — of k emotes, the k+1-th one — of k−1 emotes, …, and the last one — of one emote.

For example, the emote triangle for k=3 consists of 5 messages:

Of course, most of the channels have auto moderation. Auto moderator of the current chat will ban you right after you spam at least x emotes in succession (you can assume you are the only user in the chat). Now you are interested — how many messages will you write before getting banned? Or maybe you will not get banned at all (i.e. will write all 2k−1 messages and complete your emote triangle successfully)? Note that if you get banned as a result of writing a message, this message is also counted.

You have to answer t independent test cases.

#include <bits/stdc++.h>
using namespace std;

int main() {
	int t; cin>>t;
	while (t--) {
		long long a,b;
		cin>>a>>b;
		long long L=1,R=2*a-1,Ans=0,Mid;
		while (L<=R) {
			Mid=L+R>>1;
			long long res;
			if (Mid<=a) res=Mid*(Mid+1)/2;
			else res=a*a-(2*a-Mid-1)*(2*a-Mid)/2;
			if (res<b) Ans=Mid,L=Mid+1;
			else R=Mid-1;
		}
		cout<<min(2*a-1,Ans+1)<<endl;
	}
	return 0;
}

D. X-Magic Pair

You are given a pair of integers (a,b) and an integer x.

You can change the pair in two different ways:

set (assign) a:=|a−b|;
set (assign) b:=|a−b|,
where |a−b| is the absolute difference between a and b.
The pair (a,b) is called x-magic if x is obtainable either as a or as b using only the given operations (i.e. the pair (a,b) is x-magic if a=x or b=x after some number of operations applied). You can apply the operations any number of times (even zero).

Your task is to find out if the pair (a,b) is x-magic or not.

You have to answer t independent test cases.

思路

相当于在ab中小的数身上拿x作为材料生成ab中较大的数

AC

#include <bits/stdc++.h>
using namespace std;

string solve(long long a,long long b,long long x) {
	if (a>b) swap(a,b);
	if (x>b || !a) return "NO";
	if ((b-x)%a==0) return "YES";
	return solve(a,b%a,x);
}

int main() {
	int t; cin>>t;
	while (t--) {
		long long a,b,x;
		cin>>a>>b>>x;
		cout<<solve(a,b,x)<<endl;
	}
	return 0;
}

E. Messages

Monocarp is a tutor of a group of n students. He communicates with them using a conference in a popular messenger.

Today was a busy day for Monocarp — he was asked to forward a lot of posts and announcements to his group, that’s why he had to write a very large number of messages in the conference. Monocarp knows the students in the group he is tutoring quite well, so he understands which message should each student read: Monocarp wants the student i to read the message mi.

Of course, no one’s going to read all the messages in the conference. That’s why Monocarp decided to pin some of them. Monocarp can pin any number of messages, and if he wants anyone to read some message, he should pin it — otherwise it will definitely be skipped by everyone.

Unfortunately, even if a message is pinned, some students may skip it anyway. For each student i, Monocarp knows that they will read at most ki messages. Suppose Monocarp pins t messages; if t≤ki, then the i-th student will read all the pinned messages; but if t>ki, the i-th student will choose exactly ki random pinned messages (all possible subsets of pinned messages of size ki are equiprobable) and read only the chosen messages.

Monocarp wants to maximize the expected number of students that read their respective messages (i.e. the number of such indices i that student i reads the message mi). Help him to choose how many (and which) messages should he pin!

AC

。。。。

Windows 系统修复工具主要用于解决 Windows 11/10 系统中的各种常见问题,具有操作简单、功能全面等特点: 文件资源管理器修复:可解决文件资源管理器卡死、崩溃、无响应等问题,能终止崩溃循环。还可修复右键菜单无响应或选项缺失问题,以及重建缩略图缓存,让图片、视频等文件的缩略图正常显示,此外,还能处理桌面缺少回收站图标、回收站损坏等问题。 互联网和连接修复:能够刷新 DNS 缓存,加速网页加载速度,减少访问延迟。可重置 TCP/IP 协议栈,增强网络连接稳定性,减少网络掉线情况,还能还原 Hosts 文件,清除恶意程序对网络设置的篡改,保障网络安全,解决电脑重装系统后网络无法连接、浏览器主页被篡改等问题。 系统修复:集成系统文件检查器(SFC),可自动扫描并修复受损的系统文件。能解决 Windows 激活状态异常的问题,还可重建 DLL 注册库,恢复应用程序兼容性,解决部分软件无法正常运行的问题,同时也能处理如 Windows 沙箱无法启动、Windows 将 JPG 或 JPEG 保存为 JFIF 等系统问题。 系统工具维护:提供启动管理器、服务管理器和进程管理器等工具,用户可控制和管理启动程序、系统服务和当前运行的进程,提高系统的启动和运行速度,防止不必要的程序和服务占用系统资源。还能查看系统规格,如处理器线程数、最大显示分辨率等。 故障排除:集成超过 20 个微软官方诊断工具,可对系统问题进行专业排查,还能生成硬件健康状态报告。能解决搜索和索引故障、邮件和日历应用程序崩溃、设置应用程序无法启动等问题,也可处理打印机、网络适配器、Windows 更新等相关故障。 其他修复功能:可以重置组策略设置、catroot2 文件夹、记事本等多种系统设置和组件,如重置 Windows 应用商店缓存、Windows 防火墙设置等。还能添加重建图标缓存支持,恢复粘滞便笺删除
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

.0-0.

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值