2020-12-06

B - Keyboard

Vasya learns to type. He has an unusual keyboard at his disposal: it is rectangular and it has n rows of keys containing m keys in each row. Besides, the keys are of two types. Some of the keys have lowercase Latin letters on them and some of the keys work like the “Shift” key on standard keyboards, that is, they make lowercase letters uppercase.

Vasya can press one or two keys with one hand. However, he can only press two keys if the Euclidean distance between the centers of the keys does not exceed x. The keys are considered as squares with a side equal to 1. There are no empty spaces between neighbouring keys.

Vasya is a very lazy boy, that’s why he tries to type with one hand as he eats chips with his other one. However, it is possible that some symbol can’t be typed with one hand only, because the distance between it and the closest “Shift” key is strictly larger than x. In this case he will have to use his other hand. Having typed the symbol, Vasya returns other hand back to the chips.

You are given Vasya’s keyboard and the text. Count the minimum number of times Vasya will have to use the other hand.

Input
The first line contains three integers n, m, x (1 ≤ n, m ≤ 30, 1 ≤ x ≤ 50).

Next n lines contain descriptions of all the keyboard keys. Each line contains the descriptions of exactly m keys, without spaces. The letter keys are marked with the corresponding lowercase letters. The “Shift” keys are marked with the “S” symbol.

Then follow the length of the text q (1 ≤ q ≤ 5·105). The last line contains the text T, which consists of q symbols, which are uppercase and lowercase Latin letters.

Output
If Vasya can type the text, then print the minimum number of times he will have to use his other hand. Otherwise, print “-1” (without the quotes).

题解:模拟题,记录键盘字符位置,Shift位置。再进行遍历查询。

#include<bits/stdc++.h>

using namespace std;

const int maxn=5e5+5;
char s[maxn];
char jp[35][35];
bool to[100];
bool exist[35];

bool findd(char a[],char ch){
    int len=strlen(a);
    for(int i=0; i<len; i++)
        if(a[i]==ch)
            return true;
    return false;
}

int main(){
    int n,m,x;
    cin>>n>>m>>x;
    memset(exist,false,sizeof(exist));
    memset(to,false,sizeof(to));
    for(int i=0; i<n; i++){
        scanf("%s",jp[i]);
    }
    int kk=0,flag=0;
    for(int i=0; i<n; i++){
        for(int j=0; j<m; j++){
            if(jp[i][j]=='S'){
                flag=1;
                for(int k=0; k<n; k++){
                    for(int p=0; p<m; p++){
                        if((k-i)*(k-i)+(p-j)*(p-j)<=x*x && jp[k][p] != 'S'){
                            to[jp[k][p]-'a']=true;
                        }
                    }
                }
            }
            else{
                exist[jp[i][j]-'a']=true;
            }
        }
    }
    int q;
    cin>>q;
    getchar();
    int an=0,ans=0;
    cin>>s;
    for(int i=0; i<q; i++){
        if(s[i]>='a'&&s[i]<='z'){
            if (!exist[s[i] - 97]){
                puts("-1");
                return 0;
            }
        }
        else{

        }
        if(s[i]>='A'&&s[i]<='Z'){
            if (flag == 0){
                puts("-1");
                return 0;
            }
            if(exist[tolower(s[i])-'a']==true){
                if(to[tolower(s[i])-'a']==false)
                    ans++;
            }
            else{
                printf("-1\n");
                return 0;
            }
        }
    }
    printf("%d\n",ans);
}

vj炸了。。好了更cd。。qwq

C - Trains

内容概要:本文详细介绍了如何利用Simulink进行自动代码生成,在STM32平台上实现带57次谐波抑制功能的霍尔场定向控制(FOC)。首先,文章讲解了所需的软件环境准备,包括MATLAB/Simulink及其硬件支持包的安装。接着,阐述了构建永磁同步电机(PMSM)霍尔FOC控制模型的具体步骤,涵盖电机模型、坐标变换模块(如Clark和Park变换)、PI调节器、SVPWM模块以及用于抑制特定谐波的陷波器的设计。随后,描述了硬件目标配置、代码生成过程中的注意事项,以及生成后的C代码结构。此外,还讨论了霍尔传感器的位置估算、谐波补偿器的实现细节、ADC配置技巧、PWM死区时间和换相逻辑的优化。最后,分享了一些实用的工程集成经验,并推荐了几篇有助于深入了解相关技术和优化控制效果的研究论文。 适合人群:从事电机控制系统开发的技术人员,尤其是那些希望掌握基于Simulink的自动代码生成技术,以提高开发效率和控制精度的专业人士。 使用场景及目标:适用于需要精确控制永磁同步电机的应用场合,特别是在面对高次谐波干扰导致的电流波形失真问题时。通过采用文中提供的解决方案,可以显著改善系统的稳定性和性能,降低噪声水平,提升用户体验。 其他说明:文中不仅提供了详细的理论解释和技术指导,还包括了许多实践经验教训,如霍尔传感器处理、谐波抑制策略的选择、代码生成配置等方面的实际案例。这对于初学者来说是非常宝贵的参考资料。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值