当前位置:网站首页>Naoqi robot summary 26
Naoqi robot summary 26
2022-07-05 23:25:00 【hiyaaa】
Basic algorithm
#include<bits/stdc++.h>
using namespace std;
const int N=1100;
int size[N];
char s[N][N];
int vis[N][N];
int dx[8]={0,1,0,-1,-1,1,1,-1};
int dy[8]={1,0,-1,0,1,1,-1,-1};
int m,cnt;
int a[N],b[N],tot,tot1;
void dfs(int x,int y,int &ans,int k)
{// For every cannon attacked , So it's centered 3*3 The squares will be affected , So find the connected block , The number of each connected block , And the number of cannons in each connected block .
if(s[x][y]=='.') return ;
vis[x][y]=true;
for(int i=0;i<8;i++)
{
int xx=dx[i]+x;
int yy=dy[i]+y;
if(xx<k||xx>=k+4||yy<0||y>=m||vis[xx][yy]) continue;
vis[xx][yy]=true;
if(s[xx][yy]=='*') ans++;
dfs(xx,yy,ans,k);
}
}
int main()
{
cin>>m;
for(int i=0;i<8;i++) cin>>s[i];
for(int i=0;i<4;i++)
{
for(int j=0;j<m;j++)
{
if(s[i][j]=='*'&&!vis[i][j])
{
cnt=1;
dfs(i,j,cnt,0);
a[++tot]=cnt;
}
}
}
for(int i=4;i<8;i++)
{
for(int j=0;j<m;j++)
{
if(s[i][j]=='*'&&!vis[i][j])
{
cnt=1;
dfs(i,j,cnt,4);
b[++tot1]=cnt;
}
}
}
if(tot1<tot) cout<<-1<<endl;
else
{
sort(b+1,b+1+tot1);
int ans=0;
for(int i=tot;i<=tot1;i++) ans+=b[i];
cout<<ans<<endl;
}
}
#include <bits/stdc++.h>
const int maxn = 510;
const int MaxN = 0x3f3f3f3f;
const int MinN = 0xc0c0c00c;
typedef long long ll;
const int mod = 100000000;
using namespace std;
char a[maxn][maxn];
bool visited[maxn][maxn];
bool flag=false;
int n,m;
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
void dfs(int x,int y){
if(a[x][y]=='E'){
flag=true;
return ;
}
if(flag==true) return ;
for(int i=0;i<4;i++){
int nx=x+dx[i];
int ny=y+dy[i];
if((a[nx][ny]=='.'||a[nx][ny]=='E')&&!visited[nx][ny]){
visited[nx][ny]=true;
dfs(nx,ny);
}
}
}
int main()
{
while(cin>>n>>m){
memset(visited,false,sizeof(visited));
memset(a,-1,sizeof(a));
for(int i=1;i<=n;i++){
scanf("%s",a[i]+1);
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(a[i][j]=='S'){
flag=false;
visited[i][j]=true;
dfs(i,j);
break;
}
}
}
if(flag) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
边栏推荐
- February 13, 2022-4-symmetric binary tree
- Difference between out of band and in band
- 芯源&立创EDA训练营——无刷电机驱动
- Brushless drive design -- on MOS drive circuit
- openresty ngx_ Lua request response
- Selenium+pytest automated test framework practice
- Sum of two numbers, sum of three numbers (sort + double pointer)
- asp.net弹出层实例
- CIS基准测试工具kube-bench使用
- 证明 poj 1014 模优化修剪,部分递归 有错误
猜你喜欢
Go language implementation principle -- lock implementation principle
Simple and beautiful method of PPT color matching
Three. Js-01 getting started
数学公式截图识别神器Mathpix无限使用教程
Southeast Asia e-commerce guide, how do sellers layout the Southeast Asia market?
Practice of concurrent search
Hainan Nuanshen tea recruits warmhearted people: recruitment of the product experience recommender of Nuanshen multi bubble honey orchid single cluster
【原创】程序员团队管理的核心是什么?
Three. JS VR house viewing
Brushless drive design -- on MOS drive circuit
随机推荐
There are 14 God note taking methods. Just choose one move to improve your learning and work efficiency by 100 times!
idea 连接mysql ,直接贴配置文件的url 比较方便
CIS基准测试工具kube-bench使用
698. 划分为k个相等的子集 ●●
Leecode learning notes
grafana工具界面显示报错influxDB Error
Expectation, variance and covariance
动态规划 之 打家劫舍
Rethinking about MySQL query optimization
无刷驱动设计——浅谈MOS驱动电路
Go语言实现原理——锁实现原理
Data type, variable declaration, global variable and i/o mapping of PLC programming basis (CoDeSys)
Multi sensor fusion of imu/ optical mouse / wheel encoder (nonlinear Kalman filter)
Use of shell:for loop
11gR2 Database Services for &quot; Policy&quot; and &quot; Administrator&quot; Managed databases (file I
基于脉冲神经网络的物体检测
Object detection based on impulse neural network
Solution to the packaging problem of asyncsocket long connecting rod
C Primer Plus Chapter 9 question 10 binary conversion
How to insert data into MySQL database- How can I insert data into a MySQL database?