結果

問題 No.751 Frac #2
ユーザー uchiiiiuchiiii
提出日時 2020-08-11 18:23:28
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 1,919 bytes
コンパイル時間 2,877 ms
コンパイル使用メモリ 210,780 KB
最終ジャッジ日時 2024-04-17 17:28:50
合計ジャッジ時間 3,132 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/string:43,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bitset:52,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:52,
                 from main.cpp:4:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h: In destructor 'std::_Rb_tree<long long int, std::pair<const long long int, int>, std::_Select1st<std::pair<const long long int, int> >, std::less<long long int>, std::allocator<std::pair<const long long int, int> > >::_Rb_tree_impl<std::less<long long int>, true>::~_Rb_tree_impl()':
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to 'always_inline' 'std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = std::_Rb_tree_node<std::pair<const long long int, int> >]': target specific option mismatch
  184 |       ~allocator() _GLIBCXX_NOTHROW { }
      |       ^
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/map:62,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:152:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_tree.h:662:16: note: called from here
  662 |         struct _Rb_tree_impl
      |                ^~~~~~~~~~~~~

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}
//-------------------
map<ll, int> factorize(ll n) {
    map<ll,int> ans;
    for(int i=2; i*i<=n; i++) {
        while(n%i==0) {
            ans[i]++;
            n /= i;
        }
    }
    if(n!=1) ans[n]++;
    return ans;
} 

int main() {
    cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);
    int n1,n2; cin >> n1;
    ll bunshi = 1;
    ll bunbo = 1;
    rep(i, n1) {
        int a; cin >> a;
        if(i==0) bunshi *= a;
        else bunbo *= a;
    }
    cin >> n2;
    rep(i, n2) {
        int b; cin >> b;
        if(i&1) {
            bunshi *= b;
        } else bunbo *= b;
    } 

    auto mp1 = factorize(abs(bunshi));
    auto mp2 = factorize(abs(bunbo));

    for(auto [k,v]: mp1) {
        int cnt = min(v, mp2[k]);
        if(cnt > 0) {
            rep(_, cnt) {
                bunshi /= k;
                bunbo /= k;
            }
        }
    }

    if(bunshi*bunbo<0) {
        cout << -abs(bunshi) << " " << abs(bunbo) << endl;
    } else {
        cout << abs(bunshi) << " " << abs(bunbo) << endl;
    }
    return 0;
}
0