#618535 (C++17) No.187 中華風 (Hard)

提出ソース

結果

問題	No.187 中華風 (Hard)
ユーザー	soraie_
提出日時	2021-02-15 19:37:00
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	82 ms / 3,000 ms
コード長	6,117 bytes
コンパイル時間	2,659 ms
コンパイル使用メモリ	218,072 KB
実行使用メモリ	4,380 KB
最終ジャッジ日時	2023-09-30 18:01:30
合計ジャッジ時間	4,805 ms
ジャッジサーバーID （参考情報）	judge15 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,380 KB
testcase_01	AC	2 ms 4,376 KB
testcase_02	AC	69 ms 4,380 KB
testcase_03	AC	68 ms 4,376 KB
testcase_04	AC	81 ms 4,376 KB
testcase_05	AC	82 ms 4,376 KB
testcase_06	AC	82 ms 4,380 KB
testcase_07	AC	82 ms 4,376 KB
testcase_08	AC	59 ms 4,376 KB
testcase_09	AC	59 ms 4,376 KB
testcase_10	AC	59 ms 4,376 KB
testcase_11	AC	82 ms 4,376 KB
testcase_12	AC	82 ms 4,376 KB
testcase_13	AC	19 ms 4,380 KB
testcase_14	AC	19 ms 4,380 KB
testcase_15	AC	58 ms 4,376 KB
testcase_16	AC	58 ms 4,376 KB
testcase_17	AC	1 ms 4,380 KB
testcase_18	AC	2 ms 4,380 KB
testcase_19	AC	1 ms 4,380 KB
testcase_20	AC	63 ms 4,376 KB
testcase_21	AC	1 ms 4,376 KB
testcase_22	AC	82 ms 4,380 KB
testcase_23	AC	1 ms 4,376 KB
testcase_24	AC	2 ms 4,380 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using namespace std;
//--------------------------------------------------------------------
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) for(ll _=0;_<(ll)n;++_)
#define rep2(i,n) for(ll i=0;i<(ll)n;++i)
#define rep3(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)
#define rep4(i,a,b,c) for(ll i=(ll)a;i<(ll)b;i+=(ll)c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#ifdef _DEBUG
#define pass(...) __VA_ARGS__ ;

#define debug1(a) cerr<<#a<<": "<<a<<"\n"
#define debug2(a,b) cerr<<#a<<": "<<a<<", "<<#b<<": "<<b<<"\n"
#define debug3(a,b,c) cerr<<#a<<": "<<a<<", "<<#b<<": "<<b<<", "<<#c<<": "<<c<<"\n"
#define debug4(a,b,c,d) cerr<<#a<<": "<<a<<", "<<#b<<": "<<b<<", "<<#c<<": "<<c<<", "<<#d<<": "<<d<<"\n"

/*
#define debug1(a) cout<<#a<<": "<<a<<"\n"
#define debug2(a,b) cout<<#a<<": "<<a<<", "<<#b<<": "<<b<<"\n"
#define debug3(a,b,c) cout<<#a<<": "<<a<<", "<<#b<<": "<<b<<", "<<#c<<": "<<c<<"\n"
#define debug4(a,b,c,d) cout<<#a<<": "<<a<<", "<<#b<<": "<<b<<", "<<#c<<": "<<c<<", "<<#d<<": "<<d<<"\n"
*/

#define debug(...) overload4(__VA_ARGS__,debug4,debug3,debug2,debug1)(__VA_ARGS__)
#define koko cerr << "koko\n";
#else
#define debug(...) void(0)
#define pass(...) void(0);
#define koko void(0);
#endif
#define mp make_pair
//#define fi first
//#define se second
void myset(){ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
void doset(int n){cout << fixed << setprecision(n);cerr << fixed << setprecision(n);}
using ll = long long;
using ld = long double;
using dou = double;
template<class First,class Second>ostream& operator<<(ostream& os,const pair<First,Second>& pp)
{return os << "{" << pp.first << "," << pp.second << "}";}
template<class T>ostream& operator<<(ostream& os,const vector<T>& VV)
{if(VV.empty())return os<<"[]";os<<"[";rep(i,VV.size())os<<VV[i]<<(i==int(VV.size()-1)?"]":",");return os;}
template<class T>ostream& operator<<(ostream& os,const set<T>& SS)
{if(SS.empty())return os<<"[]";os<<"[";auto ii=SS.begin();for(;ii!=SS.end();ii++)os<<*ii<<(ii==prev(SS.end())?"]":",");return os;}
template<class Key,class Tp>ostream& operator<<(ostream& os,const map<Key,Tp>& MM)
{if(MM.empty())return os<<"[]";os<<"[";auto ii=MM.begin();for(;ii!=MM.end();ii++)os<<"{"<<ii->first<<":"<<ii->second<<"}"<<(ii==prev(MM.end())?"]":",");return os;}
const int inf = 1 << 30;
const ll INF = 1LL << 61;
const ld pi = 3.14159265358;
const ll mod1 = 1000000007LL;
const ll mod2 = 998244353LL;
typedef pair<ll,ll> P;
template<class T, class U> inline bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }
template<class T, class U> inline bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }
ll modpow(ll n,ll m,ll MOD){
    if(m == 0)return 1;
    if(m < 0)return 0;
    ll res = 1;
    n %= MOD;
    while(m){
        if(m & 1)res = (res * n) % MOD;
        m >>= 1;
        n *= n;
        n %= MOD;
    }
    return res;
}
ll mypow(ll n,ll m){
    if(m == 0)return 1;
    if(m < 0)return -1;
    ll res = 1;
    while(m){
        if(m & 1)res = (res * n);
        m >>= 1;
        n *= n;
    }
    return res;
}

inline bool isp(ll n){
    bool res = true;
    if(n == 1 || n == 0)return false;
    else{
        for(ll i = 2;i * i <= n;i++){
            if(n % i == 0){
                res = false;
                break;
            }
        }
        return res;
    }
}
inline bool Yes(bool b = 1){cout << (b ? "Yes\n":"No\n");return b;}
inline bool YES(bool b = 1){cout << (b ? "YES\n":"NO\n");return b;}
map<ll,ll> primefactor(ll n){
    map<ll,ll> ma;
    if(n <= 1)return ma;
    ll m = n;
    for(ll i = 2;i * i <= n;i++){
        while(m % i == 0){
            ma[i]++;
            m /= i;
        }
    }
    if(m != 1)ma[m]++;
    return ma;
}
vector<ll> divisor(ll n,bool sorted = true,bool samein = false){
    vector<ll> res;
    for(ll i = 1;i * i <= n;i++){
        if(n % i == 0){
            res.push_back(i);
            if(i * i != n || samein)res.push_back(n / i);
        }
    }
    if(sorted)sort(all(res));
    return res;
}

ll __lcm(ll a,ll b){return a / __gcd(a,b) * b;}

template<class T>T sum(const vector<T> &V){T r=0;for(auto x:V)r+=x;return r;}
template<class T>T sum(const initializer_list<T> &V){T r=0;for(auto x:V)r+=x;return r;}

//--------------------------------------------------------------------


//b mod m
ll pregarner(vector<ll> &b,vector<ll>& m,ll mod){
    rep(i,b.size()){
        rep(j,i){
            ll g = gcd(m[i],m[j]);
            if((b[i] - b[j]) % g != 0)return -1;
            else if(g == 1)continue;
            m[i] /= g;m[j] /= g;
            ll gi = gcd(m[i],g),gj = g / gi;
            do{
                g = gcd(gi,gj);
                gi *= g;gj /= g;
            }while(g != 1);
            m[i] *= gi;m[j] *= gj;
            b[i] %= m[i];b[j] %= m[j];
        }
    }
    ll res = 1;
    rep(i,b.size())res = res * m[i] % mod;
    return res;
}

long long modinv(long long a,long long p){
    long long b = p, u = 1, v = 0;
    while(b){
        long long t = a / b;
        a -= t * b;std::swap(a, b);
        u -= t * v;std::swap(u, v);
    }
    u %= p;
    if(u < 0)u += p;
    return u;
}

ll garner(vector<ll> b,vector<ll> m,ll mod){
    m.push_back(mod);
    int s = m.size();
    vector<ll> coeffs(s,1LL),constants(s,0LL);
    rep(i,s - 1){
        ll cur = (b[i] - constants[i]) * modinv(coeffs[i],m[i]) % m[i];
        if(cur < 0)cur += m[i];
        rep(j,i + 1,s){
            constants[j] = (constants[j] + cur * coeffs[j]) % m[j];
            coeffs[j] = coeffs[j] * m[i] % m[j];
        }
    }
    return constants.back();
}



int main(){
    myset();
    int N;
    cin >> N;
    vector<ll> m(N),b(N);
    rep(i,N)cin >> b[i] >> m[i];
    bool zero = 1;
    rep(i,N)if(b[i])zero = 0;
    ll lcm = pregarner(b,m,mod1);
    debug(b,m);
    if(zero)cout << lcm << "\n";
    else if(lcm == -1)cout << "-1\n";
    else cout << garner(b,m,mod1) << "\n";
}

yukicoder

結果

テストケース

ソースコード