Codeforces 812A Sagheer and Crossroads[模拟]
来源:互联网 发布:淘宝刷平台有哪些 编辑:程序博客网 时间:2024/06/07 18:05
题意:(这题关键就是理解题意了。。)
1. p[i]为1的时候,如果当前方向也有1,是会发生事故的,
2. p[i]为1的时候,其他方向开向 i 的路上也有1,也会发生事故。
以下是代码:
int l[5], s[5], r[5], p[5];int main() {for (int i = 1; i <= 4; ++i) {scanf("%d%d%d%d", &l[i], &s[i], &r[i], &p[i]);}bool flag = 0;for (int i = 1; i <= 4; ++i) {if (p[i] == 1 && (l[i] == 1 || s[i] == 1 || r[i] == 1))flag = 1;}if (p[1] == 1 && (l[2] == 1 || s[3] == 1 || r[4] == 1))flag = 1;if (p[2] == 1 && (r[1] == 1 || l[3] == 1 || s[4] == 1))flag = 1;if (p[3] == 1 && (r[2] == 1 || l[4] == 1 || s[1] == 1))flag = 1;if (p[4] == 1 && (l[1] == 1 || s[2] == 1 || r[3] == 1))flag = 1;if (flag)printf("YES\n");else printf("NO\n");}
阅读全文
0 0
- Codeforces 812A Sagheer and Crossroads[模拟]
- Codeforces 812A-Sagheer and Crossroads
- Codeforces 812 A Sagheer and Crossroads
- CodeForces 812A Sagheer and Crossroads
- codeforces 812A Sagheer and Crossroads
- Codeforces Round #417 (Div. 2)-A. Sagheer and Crossroads-模拟
- CodeFroces 812A Sagheer and Crossroads
- Codeforces Round #417 (Div. 2) A. Sagheer and Crossroads(模拟)
- Codeforces Round #417 (Div. 2) A. Sagheer and Crossroads
- Codeforces Round #417 (Div. 2) A. Sagheer and Crossroads
- Codeforces Round #417 (Div. 2) A. Sagheer and Crossroads
- Sagheer and Crossroads
- Codeforces812A Sagheer and Crossroads
- Codeforces812A Sagheer and Crossroads
- Codeforces 812C-Sagheer and Nubian Market
- Codeforces 812 C Sagheer and Nubian Market
- Codeforces 812C Sagheer and Nubian Market
- codeforces 812C Sagheer and Nubian Market
- 堆与堆排序
- Fiddler中AutoResponder的用法
- mysql 双机主主互备搭建实践
- VS2008环境使用MFC操作读取excel文件(OLE/COM)
- Unity5 pdb2mdb 报错解决
- Codeforces 812A Sagheer and Crossroads[模拟]
- 设计模式-依赖倒置原则
- 这样用组图创作内容,能让你的文章被转发
- MVC、MVP、MVVM、Angular.js、Knockout.js、Backbone.js、React.js、Ember.js、Avalon.js、Vue.js 概念摘录
- There is no getter for property named 'name' in 'class java.lang.Integer'
- 2017年第0届浙江工业大学之江学院程序设计竞赛决赛—I
- 6379-为何Redis选择它作为默认端口号?
- 用SSM搭建restful API协议框架
- MFC向Excel读取、写入数据(OLE/COM)