結果

問題 No.3082 Make Palindromic Multiple(Judge)
コンテスト
ユーザー 👑 potato167
提出日時 2025-03-28 21:52:10
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,889 bytes
コンパイル時間 2,769 ms
コンパイル使用メモリ 204,916 KB
実行使用メモリ 18,508 KB
最終ジャッジ日時 2025-03-28 21:52:31
合計ジャッジ時間 19,925 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 55 WA * 2 TLE * 1 -- * 8
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "c.cpp"
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#line 2 "/Users/Shared/po167_library/modint/mint61.hpp"

// https://qiita.com/keymoon/items/11fac5627672a6d6a9f6
namespace po167{
struct mint61{
    using u64 = unsigned long long;
    static constexpr u64 MOD = (1ULL << 61) - 1;
    static constexpr u64 MASK30 = (1ULL << 30) - 1;
    static constexpr u64 MASK31 = (1ULL << 31) - 1;
    u64  x;
    u64 calcmod(u64 a){
        u64 au = (a >> 61);
        u64 ad = (a & MOD);
        u64 res = au + ad;
        if (res >= MOD) res -= MOD;
        return res;
    }
    mint61(){ x = 0;}
    mint61(long long x_){
        while (x_ < 0) x_ += MOD;
        x = calcmod(x_);
    }
    mint61 &operator+=(mint61 b){
        if ((x += b.x) >= MOD) x -= MOD;
        return *this;
    }
    mint61 &operator-=(mint61 b){
        if (x >= b.x) x -= b.x;
        else{
            x += MOD;
            x -= b.x;
        }
        return *this;
    }
    mint61 &operator*=(mint61 b){
        u64 au = (x >> 31);
        u64 ad = (x & MASK31);
        u64 bu = (b.x >> 31);
        u64 bd = (b.x & MASK31);
        u64 mid = ad * bu + au * bd;
        u64 midu = (mid >> 30);
        u64 midd = (mid & MASK30);
        x = calcmod(au * bu * 2 + midu + (midd << 31) + ad * bd);
        return *this;
    }
    friend mint61 operator+(mint61 a, mint61 b){return a += b;}
    friend mint61 operator-(mint61 a, mint61 b){return a -= b;}
    friend mint61 operator*(mint61 a, mint61 b){return a *= b;}
    friend bool operator==(mint61 a, mint61 b){return a.x == b.x;}
    friend bool operator!=(mint61 a, mint61 b){return a.x != b.x;}
    mint61 pow(long long e) const {
        mint61 r = 1,b =*this;
        while (e){
            if (e & 1) r *= b;
            b *= b;
            e >>= 1;
        }
        return r;
    }
};
}
#line 26 "c.cpp"
using mint = po167::mint61;

const mint base = mt19937_64{random_device{}()}() % mint::MOD;
//mint base = 10;
random_device seed_gen;
mt19937 rng(seed_gen());
long long rand_long(long long l,long long r){
    return uniform_int_distribution<long long>(l,r-1)(rng);
}
// return 1 + a + a^2 + ... + a^{k - 1}
mint my_pow(mint a, ll k){
    if (k == 0) return 0;
    if (k & 1){
        return 1 + a * my_pow(a, k - 1);
    }
    return (1 + a.pow(k / 2)) * my_pow(a, k / 2);
}

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll K;
    cin >> K;
    vector<string> S(K);
    vector<ll> T(K);
    rep(i, 0, K){
        cin >> S[i] >> T[i];
    }

    vector<mint> hash(10);
    rep(i, 0, 10) hash[i] = rand_long(0, mint::MOD);
    //rep(i, 0, 10) hash[i] = i;
    auto f = [&]() -> mint {
        mint res = 0;
        rep(i, 0, K){
            mint sum = 0;
            mint bs = 1;
            for (auto c : S[i]){
                sum *= base;
                bs *= base;
                sum += hash[c - '0'];
            }
            res *= bs.pow(T[i]);
            res += sum * my_pow(bs, T[i]);
        }
        return res;
    };
    mint A = f();
    reverse(all(S));
    reverse(all(T));
    rep(i, 0, K) reverse(all(S[i]));
    mint B = f();
    // cout << A.x << "\n" << B.x << "\n";
    yneos(A == B);
}
0