【打CF,学算法——二星级】Codeforces 699B - One Bomb (技巧)
来源:互联网 发布:知已知彼 编辑:程序博客网 时间:2024/05/17 13:42
【CF简介】
题目链接:CF 699B
题面:
You are given a description of a depot. It is a rectangular checkered field ofn × m size. Each cell in a field can be empty (".") or it can be occupied by a wall ("*").
You have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the rowx and all walls in the column y.
You are to determine if it is possible to wipe out all walls in the depot by placing and triggeringexactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.
The first line contains two positive integers n andm (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field.
The next n lines contain m symbols "." and "*" each — the description of the field.j-th symbol in i-th of them stands for cell(i, j). If the symbol is equal to ".", then the corresponding cell is empty, otherwise it equals "*" and the corresponding cell is occupied by a wall.
If it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print "NO" in the first line (without quotes).
Otherwise print "YES" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.
3 4.*.......*..
YES1 2
3 3..*.*.*..
NO
6 5..*....*..*****..*....*....*..
YES3 3
题意:
问能否在图中找到一个点,使得该点的十字爆炸,可以消除图中的所有墙(*)。
解题:
之前各种取巧,不是这错,就是那错。CF第2题,还是要往简单想,直接统计每行每列星数,然后枚举位置即可。
代码:
#include <iostream>#include <cstdio>using namespace std;char mapp[1002][1002];int rowc[1002];int colc[1002];int n,m;int check(int x,int y){int res=0;res+=rowc[x];res+=colc[y];if(mapp[x][y]=='*')res--;return res;}int main(){int x,y,cnt=0,tmp;scanf("%d%d",&n,&m);for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){scanf(" %c",&mapp[i][j]);if(mapp[i][j]=='*'){rowc[i]++;colc[j]++;cnt++;}}}bool flag=0; for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){tmp=check(i,j);if(tmp==cnt){flag=1;x=i;y=j;break;}}if(flag)break;}if(flag)printf("YES\n%d %d\n",x,y);elseprintf("NO\n");return 0;}
- 【打CF,学算法——二星级】Codeforces 699B - One Bomb (技巧)
- 【打CF,学算法——二星级】CodeForces 96B Lucky Numbers (构造/dfs)
- 【打CF,学算法——二星级】CodeForces 417B Crash (水题)
- 【打CF,学算法——二星级】Codeforces 22B Bargaining Table(区域和)
- 【打CF,学算法——二星级】CodeForces 237B Young Table (构造)
- 【打CF,学算法——二星级】Codeforces 703B Mishka and trip (统计)
- 【打CF,学算法——二星级】Codeforces 705B Spider Man (简单博弈)
- 【打CF,学算法——二星级】Codeforces Round #312 (Div. 2) B. Amr and The Large Array
- 【打CF,学算法——二星级】Codeforces Round #313 (Div. 2) B. Gerald is into Art(水题)
- 【打CF,学算法——二星级】CF 520B Two Buttons
- 【打CF,学算法——一星级】CodeForces 227B Effective Approach (水题)
- 【打CF,学算法——二星级】Codeforces 584C Marina and Vasya (简单构造)
- 【打CF,学算法——二星级】CodeForces 417C Football(构造)
- 【打CF,学算法——二星级】CodeForces 520C DNA Alignment (构造)
- 【打CF,学算法——二星级】CodeForces 282C XOR and OR (观察)
- 【打CF,学算法——二星级】CodeForces 689A Mike and Cellphone (模拟)
- 【打CF,学算法——二星级】CodeForces 626C Block Towers(暴力/二分)
- 【打CF,学算法——二星级】CodeForces 292A SMSC (模拟)
- java连接mysql数据库
- runloop
- Android Studio快捷键
- linux 内核移植中的基本配置
- 转载整理一些网址
- 【打CF,学算法——二星级】Codeforces 699B - One Bomb (技巧)
- kafka 单节点快速运用
- 工作遇到问题笔记
- 使用Microsoft Visual Studio Code配置代理服务器的方法
- SDUT 1479 数据结构实验之栈:行编辑器
- Linux网络编程入门 (转载)
- Java IO操作——内存操作流{ByteArrayInputStream、ByteArrayOutputStream)
- 详解Android中AsyncTask的使用
- java synchronized关键字的用法