結果
問題 | No.2776 Bigger image |
ユーザー |
![]() |
提出日時 | 2024-06-07 21:33:39 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 4,870 bytes |
コンパイル時間 | 6,803 ms |
コンパイル使用メモリ | 308,564 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-26 07:12:31 |
合計ジャッジ時間 | 7,650 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 25 |
ソースコード
#include <bits/stdc++.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}#endif#ifdef LOCAL#include "debug.h"#else#define debug(...) static_cast<void>(0)#define debugg(...) static_cast<void>(0)#define esper(...) static_cast<void>(0)template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}#endifusing ll=long long;using ull=unsigned long long;using P=pair<ll,ll>;template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}#define reps(i,a,n) for(int i=(a);i<(n);i++)#define rep(i,n) reps(i,0,n)#define all(x) x.begin(),x.end()#define pcnt(x) __builtin_popcountll(x)#define fin(x) return cout<<x<<'\n',static_cast<void>(0)ll myceil(ll a,ll b){return (a+b-1)/b;}template<typename T,size_t n,size_t id=0>auto vec(const int (&d)[n],const T &init=T()){if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));else return init;}void SOLVE();int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(16);#ifdef LOCALclock_t start=clock();#endifint testcase=1;//cin>>testcase;for(int i=0;i<testcase;i++){SOLVE();}#ifdef LOCALcerr<<"time:";cerr<<(clock()-start)/1000;cerr<<"ms\n";#endif}struct fraction{private:ll num,den;public:void simple(){ll g=gcd(num,den);this->num/=g;this->den/=g;}fraction():num(0),den(1){}fraction(ll a):num(a),den(1){}fraction(ll a,ll b):num(a),den(b){this->simple();if(this->den<0)this->num*=-1,this->den*=-1;}static fraction raw(ll a,ll b){fraction ret;ret.num=a;ret.den=b;return ret;}friend fraction operator+(const fraction &a){return a;}friend fraction operator-(const fraction &a){return fraction::raw(-a.num,a.den);}friend fraction operator+(const fraction &a,const fraction &b){return fraction(a.num*b.den+b.num*a.den,a.den*b.den);}friend fraction operator-(const fraction &a,const fraction &b){return fraction(a.num*b.den-b.num*a.den,a.den*b.den);}friend fraction operator*(const fraction &a,const fraction &b){fraction c(a.num,b.den),d(b.num,a.den);c.num*=d.num;c.den*=d.den;return c;}friend fraction operator/(const fraction &a,const fraction &b){fraction c(a.num,b.num),d(b.den,a.den);c.num*=d.num;c.den*=d.den;if(c.den<0){c.num*=-1;c.den*=-1;}return c;}friend bool operator==(const fraction &a,const fraction &b){return a.num==b.num&&a.den==b.den;}friend bool operator!=(const fraction &a,const fraction &b){return !(a==b);}friend bool operator<(const fraction &a,const fraction &b){return (__int128_t)a.num*b.den<(__int128_t)b.num*a.den;}friend bool operator>(const fraction &a,const fraction &b){return (__int128_t)a.num*b.den>(__int128_t)b.num*a.den;}friend bool operator<=(const fraction &a,const fraction &b){return !(a>b);}friend bool operator>=(const fraction &a,const fraction &b){return !(a<b);}fraction &operator=(const fraction &a)=default;fraction &operator+=(const fraction &a){return *this=*this+a;}fraction &operator-=(const fraction &a){return *this=*this-a;}fraction &operator*=(const fraction &a){return *this=*this*a;}fraction &operator/=(const fraction &a){return *this=*this/a;}inline fraction inv() const{if(this->num>0)return fraction::raw(this->den,this->num);else return fraction::raw(-this->den,-this->num);}friend ostream &operator<<(ostream &os,const fraction &a){if(a.den==1)os<<a.num;else os<<a.num<<'/'<<a.den;return os;}};void SOLVE(){int a,b,h,w;cin>>a>>b>>h>>w;fraction c1=min(fraction(h,a),fraction(w,b));fraction c2=min(fraction(h,b),fraction(w,a));if(c1==c2)cout<<"Same"<<endl;else if(c1<c2)cout<<"Rotating"<<endl;else cout<<"Non-rotating"<<endl;}