結果
| 問題 | No.55 正方形を描くだけの簡単なお仕事です。 |
| ユーザー |
 t98slider
|
| 提出日時 | 2022-04-19 05:42:40 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 5,000 ms |
| コード長 | 5,769 bytes |
| コンパイル時間 | 2,039 ms |
| コンパイル使用メモリ | 180,196 KB |
| 実行使用メモリ | 6,820 KB |
| 最終ジャッジ日時 | 2024-12-31 03:56:12 |
| 合計ジャッジ時間 | 3,022 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 21 |
ソースコード
#include <bits/stdc++.h>#define all(v) v.begin(), v.end()#define rall(v) v.rbegin(), v.rend()#define rep(i,n) for(int i=0;i<(int)(n);i++)#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)#define codefor int test;scanf("%d",&test);while(test--)#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define yes(ans) if(ans)printf("yes\n");else printf("no\n")#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")#define popcount(v) __builtin_popcountll(v)#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))#define vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__))))using namespace std;using ll = long long;template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;const int MOD=1000000007;const int MOD2=998244353;const int INF=1<<30;const ll INF2=1LL<<60;void scan(int& a){scanf("%d",&a);}void scan(long long& a){scanf("%lld",&a);}template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}template<class T> void scan(T& a){cin>>a;}template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}void in(){}template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}void print(const int& a){printf("%d",a);}void print(const long long& a){printf("%lld",a);}void print(const double& a){printf("%.15lf",a);}template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}template<class T> void print(const T& a){cout<<a;}template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}void out(){putchar('\n');}template<class T> void out(const T& t){print(t);putchar('\n');}template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}template<class T> void dprint(const T& a){cerr<<a;}template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}void debug(){cerr<<'\n';}template<class T> void debug(const T& t){dprint(t);cerr<<endl;}template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;returnu;}ll updivide(ll a,ll b){return (a+b-1)/b;}template<class T> void chmax(T &a,const T b){if(b>a)a=b;}template<class T> void chmin(T &a,const T b){if(b<a)a=b;}template<class T> struct point{T x,y;point():x(0),y(0){}point(T a,T b):x(a),y(b){}point& operator+=(const point& rhs) {x+=rhs.x,y+=rhs.y; return *this;}point& operator-=(const point& rhs) {x-=rhs.x,y-=rhs.y; return *this;}point& operator*=(const T& rhs) {x*=rhs,y*=rhs; return *this;}point& operator/=(const T& rhs) {x/=rhs,y/=rhs; return *this;}point operator+() const { return *this; }point operator-() const { return point() - *this; }friend point operator+(const point& lhs, const point& rhs) {return point(lhs) += rhs;}friend point operator-(const point& lhs, const point& rhs) {return point(lhs) -= rhs;}friend point operator*(const point& lhs, const T& rhs) {return point(lhs) *= rhs;}friend point operator*(const T& lhs, const point& rhs) {return point(rhs) *= lhs;}friend point operator/(const point& lhs, const T& rhs) {return point(lhs) /= rhs;}friend T operator*(const point& lhs, const point& rhs) {return lhs.x*rhs.x+lhs.y*rhs.y;}friend T operator^(const point& lhs, const point& rhs) {return lhs.x*rhs.y-lhs.y*rhs.x;}friend istream& operator>>(istream& os,point& rhs) noexcept {os >> rhs.x >> rhs.y;return os;}friend constexpr ostream& operator << (ostream &os, const point& rhs) noexcept {return os << '('<< rhs.x << ',' << rhs.y << ')';}double norm(){return sqrt(x*x+y*y);}T norm2(){return x*x+y*y;}int orthant(){//第何象限かのベクトルを返す(0,0は0象限とする)if(x==0&&y==0)return 0;if(y>0)return (x>0?1:2);return (x>0?4:3);}//偏角ソート->ベクトルの大きさの小さい順の優先度friend bool operator<(point &lhs,point &rhs){int lo=lhs.orthant(),ro=rhs.orthant();if(lo!=ro)return (lo<ro);T cv=(lhs^rhs);if(cv!=0)return (cv>0);return (lhs.norm2()<rhs.norm2());}};int main(){vector<point<ll>> a(3);in(a);sort(all(a));do{auto p1=a[1]-a[0];auto p2=a[2]-a[0];if(p1*p2==0&&p1.norm2()==p2.norm2()){auto p3=a[0]+p1+p2;out(p3.x,p3.y);return 0;}}while(next_permutation(all(a)));out(-1);}