Codeforces Round #417 (Div. 2) A

A. Sagheer and Crossroads
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Sagheer is walking in the street when he comes to an intersection of two roads. Each road can be represented as two parts where each part has 3 lanes getting into the intersection (one for each direction) and 3 lanes getting out of the intersection, so we have 4 parts in total. Each part has 4 lights, one for each lane getting into the intersection (l — left, s — straight, r — right) and a light p for a pedestrian crossing.

An accident is possible if a car can hit a pedestrian. This can happen if the light of a pedestrian crossing of some part and the light of a lane that can get to or from that same part are green at the same time.

Now, Sagheer is monitoring the configuration of the traffic lights. Your task is to help him detect whether an accident is possible.

Input
The input consists of four lines with each line describing a road part given in a counter-clockwise order.

Each line contains four integers l, s, r, p — for the left, straight, right and pedestrian lights, respectively. The possible values are 0 for red light and 1 for green light.

Output
On a single line, print “YES” if an accident is possible, and “NO” otherwise.

Examples
input
1 0 0 1
0 1 0 0
0 0 1 0
0 0 0 1
output
YES
input
0 1 1 0
1 0 1 0
1 1 0 0
0 0 0 1
output
NO
input
1 0 0 0
0 0 0 1
0 0 0 0
1 0 1 0
output
NO
Note
In the first example, some accidents are possible because cars of part 1 can hit pedestrians of parts 1 and 4. Also, cars of parts 2 and 3 can hit pedestrians of part 4.

In the second example, no car can pass the pedestrian crossing of part 4 which is the only green pedestrian light. So, no accident can occur.
理解题意是关键，好好看图。

#include<bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
const int maxn=5;
int a[maxn][maxn];
int main()
{
    mem(a,0);
    for(int i=1; i<=4; i++)
    {
        for(int j=1; j<=4; j++)
        {
            scanf("%d",&a[i][j]);
        }
    }
    int flag=0;
    if(a[1][4])
    {
        if(a[1][1]||a[1][2]||a[1][3]||a[2][1]||a[3][2]||a[4][3])
        {
            flag=1;
        }
    }
    if(a[2][4])
    {
        if(a[2][1]||a[2][2]||a[2][3]||a[3][1]||a[4][2]||a[1][3])
            flag=1;
    }
    if(a[3][4])
    {
        if(a[3][1]||a[3][2]||a[3][3]||a[4][1]||a[1][2]||a[2][3])
            flag=1;
    }
    if(a[4][4])
    {
        if(a[4][1]||a[4][2]||a[4][3]||a[1][1]||a[2][2]||a[3][3])
            flag=1;
    }
    if(flag==1)
        printf("YES\n");
    else
        printf("NO\n");
    return 0;
}