-
Notifications
You must be signed in to change notification settings - Fork 0
/
A.cpp
116 lines (92 loc) · 2.01 KB
/
A.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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < b; i++)
#define repR(i, a, b) for (int i = a; i >= b; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vb vector<bool>
#define vpii vector<pii>
#define vpll vector<pll>
#define mod 1000000007
#define ps(x,y) fixed << setprecision(y) << x
#define fastio ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
int mat[1001][1001];
int n, ax, ay, bx, by, cx, cy;
bool ans = 0, visited[1001][1001];
void DFS(int i, int j)
{
if (i > n || j > n || i < 1 || j < 1) return;
if (visited[i][j]) return;
if (mat[i][j] == 1) return;
visited[i][j] = 1;
if (i == cx && j == cy) {
ans = 1;
return;
}
DFS(i, j + 1);
DFS(i, j - 1);
DFS(i + 1, j);
DFS(i - 1, j);
DFS(i + 1, j + 1);
DFS(i - 1, j + 1);
DFS(i - 1, j - 1);
DFS(i + 1, j - 1);
}
void solve()
{
cin >> n >> ax >> ay >> bx >> by >> cx >> cy;
rep(i, 1, n + 1) {
mat[ax][i] = 1;
}
rep(i, 1, n + 1) {
mat[i][ay] = 1;
}
for (int i = ax, j = ay; i >= 1 && j <= n; i--, j++) {
mat[i][j] = 1;
}
for (int i = ax, j = ay; i <= n && j <= n; i++, j++) {
mat[i][j] = 1;
}
for (int i = ax, j = ay; i <= n && j >= 1; i++, j--) {
mat[i][j] = 1;
}
for (int i = ax, j = ay; i >= 1 && j <= n; i--, j--) {
mat[i][j] = 1;
}
DFS(bx, by);
if (ans) {
cout << "YES" << '\n';
}
else {
cout << "NO" << '\n';
}
}
int main()
{
fastio;
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
int t = 1;
//cin>>t;
while (t--) solve();
return 0;
}