A. Flag
2016-04-21 19:02
232 查看
A. Flagtime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputAccording to a new ISO standard, a flag of every country should have a chequered field n?×?m, each square should be of one of 10 colours, and the flag should be ?striped?: each horizontal row of the flag should contain squares of the same colour, and the colours of adjacent horizontal rows should be different. Berland's government asked you to find out whether their flag meets the new ISO standard.InputThe first line of the input contains numbers n and m (1?≤?n,?m?≤?100), n — the amount of rows, m — the amount of columns on the flag of Berland. Then there follows the description of the flag: each of the following n lines contain m characters. Each character is a digit between 0 and 9, and stands for the colour of the corresponding square.OutputOutput YES, if the flag meets the new ISO standard, and NO otherwise.Sample test(s)input
相邻两行是不同的字符每行都是一样的字符
3 3 000 111 222output
YESinput
3 3 000 000 111output
NOinput
3 3 000 111 002output
NO
相邻两行是不同的字符每行都是一样的字符
/* *********************************************** ************************************************ */ #include <iostream> #include <cstring> #include <cstdlib> #include <stdio.h> #include <algorithm> #include <vector> #include <queue> #include <set> #include <map> #include <string> #include <math.h> #include <stdlib.h> #include <iomanip> #include <list> #include <deque> #include <stack> #define ull unsigned long long #define ll long long #define mod 90001 #define INF 1<<30 #define maxn 10000+10 #define cle(a) memset(a,0,sizeof(a)) const ull inf = 1LL << 61; const double eps=1e-5; using namespace std; bool cmp(int a,int b){ return a>b; } string s; int main() { #ifndef ONLINE_JUDGE //freopen("in.txt","r",stdin); #endif //freopen("out.txt","w",stdout); int n,m; while(cin>>n>>m){ s=""; string t=""; int mark=0; for(int i=1;i<=n;i++){ if(i==1){ cin>>s; for(int i=1;i<m;i++) if(s[i]!=s[i-1])mark=1; } else { cin>>t; if(t==s){ mark=1; } if(t!=s){ for(int i=1;i<m;i++) if(t[i]!=t[i-1])mark=1; } s=t; } } if(mark)cout<<"NO"; else cout<<"YES"; } return 0; }
相关文章推荐
- A. Cottage Village
- A. Letter
- A. Numbers
- A. Super Agent
- A. Increasing Sequence
- A. Power Consumption Calculation
- 【问题解决】FragmentTabHost 底部菜单栏,切换Frgment时重新加载问题
- 使用Ajax实现异步用户名验证
- hiho#1139 : 二分·二分答案
- A. Die Roll
- 错排公式
- Crontab配置及使用总结
- Oracle内置表二
- CalendarView功能与用法(日历视图)
- 报名|「OneAPM x DaoCloud」技术公开课:Docker性能监控!
- Friday the Thirteenth
- DINIC 模板
- Greedy Gift Givers
- Activity之封装intent
- 2015年06月17日