Submission #62053745

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <vector>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <cstdint>
#include <functional>
#include <stack>
#include <map>
#include <random>
#include <ctime>
#include <set>
#include <map>
typedef long long LL;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <vector>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <cstdint>
#include <functional>
#include <stack>
#include <map>
#include <random>
#include <ctime>
#include <set>
#include <map>

typedef long long LL;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
const int N = 200010;
const int M = 5000010;
const int mod = 1'000'000'007;

#define INF 0x3f3f3f3f
#define rep(i,l,r) for(auto i(l);i<=(r);++i)
#define per(i,r,l) for(auto i(r);i>=(l);--i)
#define rpp(i,l,r) for(auto i(l);i<(r);++i)
#define ppr(i,r,l) for(auto i(r);i>(l);--i)
#define lowbit(x) ((x)&-(x))
#define ls(p) ((p)<<1)
#define rs(p) ((p)<<1|1)

// char *p1,*p2,buf[100000];
// #define getchar() (p1==p2 && (p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++)
template<typename T>inline T max(T a,T b){return a>b?a:b;}
template<typename T>inline T min(T a,T b){return a<b?a:b;}
template<typename T>inline void read(T &x){
	x=0;
	char ch=getchar(),f=0;
	while(ch<'0' || ch>'9'){f=(ch=='-');ch=getchar();}
	while(ch<='9' && ch>='0'){x=x*10+(ch^48);ch=getchar();}
	f?x=-x:0;
}

template<std::size_t N>inline void read(char (&s)[N]){
	char *p=s,ch=getchar();
	while(isspace(ch)){ch=getchar();}
	while(!isspace(ch) && std::size_t(p-s+1)<N){*p=ch;++p;ch=getchar();}
	*p=0;
}
inline void read(char *s){
	char ch=getchar();
	while(isspace(ch)){ch=getchar();}
	while(!isspace(ch)){*s=ch;++s;ch=getchar();}
	*s=0;
}
inline void read(char &ch){ch=getchar();while(isspace(ch)){ch=getchar();}}
template<typename T,typename... Args>void read(T &x,Args&... args){read(x);read(args...);}
template<typename T>inline void write(T x){
	char s[40],*t=s;
	for(;1;++t,x/=10){
		if(x<0){putchar('-');x=-x;}
		if(x<10){*t=x^48;break;}
		*t=(x%10)^48;
	}
	while(t>=s){putchar(*t);--t;}
}
inline void write(char *s){while(*s){putchar(*s);++s;}}
inline void write(const char *s){while(*s){putchar(*s);++s;}}
inline void write(char ch){putchar(ch);}
template<typename T,typename... Args>void write(T x,Args ...args){write(x);write(args...);}
template<typename... Args>void writen(Args ...args){write(args...,'\n');}
template<typename... Args>void writes(Args ...args){write(args...,' ');}

int h,w;
char s[1010][1010];
int p1,p2,p3,p4;

int main(){
	read(h,w);
	p1=p2=-INF,p3=p4=INF;
	rep(i,1,h){
		read(s[i]+1);
		rep(j,1,w){
			if(s[i][j]=='#'){
				p1=max(p1,i);
				p2=max(p2,j);
				p3=min(p3,i);
				p4=min(p4,j);
			}
		}
	}
	// writen(p3,' ',p1,' ',p4,' ',p2);
	rep(i,p3,p1){
		rep(j,p4,p2){
			if(s[i][j]=='.'){puts("No");return 0;}
		}
	}
	puts("Yes");

	return 0;
}
/*
-std=c++14
-Wall -O2 -static
-Wall -O2 -fsanitize=address,undefined
LHY qingchunkeai,shanliangdafang,wengrouxianhui,meilidongren,chenyuluoyan,biyuexiuhua
*/

Submission Info

Judge Result