結果

問題 No.55 正方形を描くだけの簡単なお仕事です。
ユーザー fumiphysfumiphys
提出日時 2020-04-14 22:18:02
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 34 ms / 5,000 ms
コード長 4,255 bytes
コンパイル時間 1,797 ms
コンパイル使用メモリ 170,096 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-04-09 18:15:03
合計ジャッジ時間 3,542 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 18 ms
6,812 KB
testcase_01 AC 34 ms
6,944 KB
testcase_02 AC 18 ms
6,940 KB
testcase_03 AC 19 ms
6,940 KB
testcase_04 AC 34 ms
6,940 KB
testcase_05 AC 34 ms
6,940 KB
testcase_06 AC 34 ms
6,944 KB
testcase_07 AC 34 ms
6,944 KB
testcase_08 AC 34 ms
6,940 KB
testcase_09 AC 34 ms
6,944 KB
testcase_10 AC 34 ms
6,944 KB
testcase_11 AC 11 ms
6,940 KB
testcase_12 AC 34 ms
6,944 KB
testcase_13 AC 26 ms
6,944 KB
testcase_14 AC 18 ms
6,940 KB
testcase_15 AC 34 ms
6,944 KB
testcase_16 AC 18 ms
6,944 KB
testcase_17 AC 34 ms
6,940 KB
testcase_18 AC 10 ms
6,940 KB
testcase_19 AC 33 ms
6,940 KB
testcase_20 AC 18 ms
6,940 KB
testcase_21 AC 17 ms
6,940 KB
testcase_22 AC 34 ms
6,944 KB
testcase_23 AC 22 ms
6,944 KB
testcase_24 AC 10 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
#define F first
#define S second
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;


int main(int argc, char const* argv[])
{
  int x[4], y[4];
  rep(i, 3)cin >> x[i] >> y[i];
  for(int tx = -200; tx <= 200; tx++){
    for(int ty = -200; ty <= 200; ty++){
      x[3] = tx, y[3] = ty;
      vector<int> e(4); rep(i, 4)e[i] = i;
      bool ok = false;
      do{
        set<int> st;
        int l1 = (x[e[0]] - x[e[3]]) * (x[e[0]] - x[e[3]]) + (y[e[0]] - y[e[3]]) * (y[e[0]] - y[e[3]]);
        int l2 = (x[e[0]] - x[e[2]]) * (x[e[0]] - x[e[2]]) + (y[e[0]] - y[e[2]]) * (y[e[0]] - y[e[2]]);
        int l3 = (x[e[1]] - x[e[3]]) * (x[e[1]] - x[e[3]]) + (y[e[1]] - y[e[3]]) * (y[e[1]] - y[e[3]]);
        int l4 = (x[e[2]] - x[e[1]]) * (x[e[2]] - x[e[1]]) + (y[e[2]] - y[e[1]]) * (y[e[2]] - y[e[1]]);
        int l5 = (x[e[0]] - x[e[1]]) * (x[e[0]] - x[e[1]]) + (y[e[0]] - y[e[1]]) * (y[e[0]] - y[e[1]]);
        int l6 = (x[e[2]] - x[e[3]]) * (x[e[2]] - x[e[3]]) + (y[e[2]] - y[e[3]]) * (y[e[2]] - y[e[3]]);
        if((x[e[0]] - x[e[1]]) * (x[e[2]] - x[e[3]]) + (y[e[0]] - y[e[1]]) * (y[e[2]] - y[e[3]]) == 0 && l1 == l2 && l2 == l3 && l3 == l4 && l5 == l6 && l5 == 2 * l1)ok = true;
      }while(next_permutation(whole(e)));
      if(ok){
        cout << tx << " " << ty << endl;
        return 0;
      }
    }
  }
  cout << -1 << endl;
  return 0;
}
0