Submission #696236

---

Source Code Expand

#include <algorithm>
#include <array>
#include <complex>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

inline bool valid(const int x, const int r) { return 0 <= x && x < r; }

void initIOStream() {
  ios::sync_with_stdio(false); // stdinなどと同期しない
  cin.tie(0); // cinの前にflushしない
  cout.setf(ios::fixed);
  cout.precision(10); // 四捨五入して指定桁数表示
}

typedef pair<int, int> P;

int dy[4] = {-1, 0, 1, 0};
int dx[4] = {0, 1, 0, -1};
P p1, p2, p3;
int r;

bool visibleRed(){
  int cnt = 0;
  for(int i = 0; i < 4; ++i){
    P p(p1.first + dx[i] * r, p1.second + dy[i] * r);
    if(p2.first <= p.first && p.first <= p3.first &&
       p2.second <= p.second && p.second <= p3.second){
      ++cnt;
    }
  }
  return cnt != 4;
}

bool inCurcle(P q){
  int a = p1.first - q.first;
  int b = p1.second - q.second;
  return a * a + b * b <= r * r;
}

bool visibleBlue(){
  return
    !inCurcle(p2) ||
    !inCurcle(p3) ||
    !inCurcle(P(p2.first, p3.second)) ||
    !inCurcle(P(p3.first, p2.second));
}

int main() {
  initIOStream();
  cin >> p1.first >> p1.second >> r;
  cin >> p2.first >> p2.second >> p3.first >> p3.second;
  cout << (visibleRed() ? "YES" : "NO") << endl;
  cout << (visibleBlue() ? "YES" : "NO") << endl;
}

Submission Info

Judge Result