-
Notifications
You must be signed in to change notification settings - Fork 1
/
1709A - Three Doors.cpp
36 lines (33 loc) · 1.04 KB
/
1709A - Three Doors.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/** ========================================**
** @Author: Kareem Taha Abdelfatah
** @Category: Codeforces problems solutions
/** ========================================**/
#include<bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define endll "\n"
#define ll long long
#define fr(i, n) for(ll i = 0; i < n; i++)
#define fr1(i, n) for(ll i = 1; i <= n; i++)
#define asort(a) sort(a + 1, a + n + 1)
#define dsort(a) sort(a + 1, a + n + 1, greater<int>())
const long long N = 2e5 + 5, MOD = 1e9 + 7, oo = 1e18;
const double PI = 3.14;
const double Prox = 1e-7;
ll a[N], b[N] ,q[N], s[N], w[N], xy[N], l, r, v, x, y, j;
string a1[N], b1[N];
char arr[N];
map<ll, ll>mp, mk;
set<ll>st;
int main()
{
IO
int Tc; cin >> Tc;
while(Tc--){
int x; cin >> x;
fr1(i, 3) cin >> a[i];
if(a[x] != 0 && a[a[x]] != 0) cout << "YES" << endll;
else cout << "NO" << endll;
}
return 0;
}