#1195777 (C++17) No.2397 ω冪

• 問題: No.2397 ω冪
• ユーザー: 👑 Nachia
• 提出日時: 2026-10-29 04:39:45
• 言語: C++17 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 71 ms / 2,000 ms
• コード長: 8,989 bytes
• コンパイル時間: 1,191 ms
• コンパイル使用メモリ: 134,000 KB
• 実行使用メモリ: 11,600 KB
• 最終ジャッジ日時: 2026-10-29 04:39:51
• 合計ジャッジ時間: 6,042 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge7_0

ファイルパターン	結果
other	AC * 43

ソースコード

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

#include <iterator>
#include <functional>
#include <utility>
#include <type_traits>

template<class Elem> struct vec;

template<class Iter>
struct seq_view{
    using Ref = typename std::iterator_traits<Iter>::reference;
    using Elem = typename std::iterator_traits<Iter>::value_type;
    Iter a, b;
    Iter begin() const { return a; }
    Iter end() const { return b; }
    int size() const { return (int)(b-a); }
    seq_view(Iter first, Iter last) : a(first), b(last) {}
    seq_view sort() const { std::sort(a, b); return *this; }
    Ref& operator[](int x) const { return *(a+x); }
    template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {
        ret x(size()); for(int i=0; i<size(); i++) x[i] = i;
        x().sort([&](int l, int r){ return f(a[l],a[r]); });
        return x;
    }
    template<class ret = vec<Elem>> ret col() const { return ret(begin(), end()); }
    template<class ret = vec<Elem>> ret cumsum() const {
        auto res = ret(size() + 1, Elem(0));
        for(int i=0; i<size(); i++) res[i+1] = res[i] + operator[](i);
        return res;
    }
    template<class F = std::equal_to<Elem>, class ret = vec<std::pair<Elem, int>>>
    ret rle(F eq = F()) const {
        auto x = ret();
        for(auto& a : (*this)){
            if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++;
        } return x;
    }
    template<class F> seq_view sort(F f) const { std::sort(a, b, f); return *this; }
    Iter uni() const { return std::unique(a, b); }
    Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); }
    Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); }
    int lbi(const Elem& x) const { return lb(x) - a; }
    int ubi(const Elem& x) const { return ub(x) - a; }
    seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; }
    template<class F> Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); }
    template<class F> Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); }
    template<class F> Iter when_true_to_false(F f) const {
        if(a == b) return a;
        return std::lower_bound(a, b, *a,
            [&](const Elem& x, const Elem&){ return f(x); });
    }
    seq_view same(Elem x) const { return { lb(x), ub(x) }; }
    template<class F> auto map(F f) const {
        vec<decltype(f(std::declval<const typename Iter::value_type&>()))> r;
        for(auto& x : *this) r.emp(f(x));
        return r;
    }
    Iter max() const { return std::max_element(a, b); }
    Iter min() const { return std::min_element(a, b); }
    template<class F = std::less<Elem>>
    Iter min(F f) const { return std::min_element(a, b, f); }
    seq_view rev() const { std::reverse(a, b); return *this; }
};

template<class Elem>
struct vec {
public:
    using Base = typename std::vector<Elem>;
    using Iter = typename Base::iterator;
    using iterator = Iter;
    using CIter = typename Base::const_iterator;
    using const_iterator = CIter;
    using View = seq_view<Iter>;
    using CView = seq_view<CIter>;

    vec(){}
    explicit vec(int n, const Elem& value = Elem()) : a(0<n?n:0, value) {}
    template <class I2> vec(I2 first, I2 last) : a(first, last) {}
    vec(std::initializer_list<Elem> il) : a(std::move(il)) {}
    vec(Base b) : a(std::move(b)) {}
    operator Base() const { return a; }

    Iter begin(){ return a.begin(); }
    CIter begin() const { return a.begin(); }
    Iter end(){ return a.end(); }
    CIter end() const { return a.end(); }
    int size() const { return a.size(); }
    bool empty() const { return a.empty(); }
    Elem& back(){ return a.back(); }
    const Elem& back() const { return a.back(); }
    vec& sortuni(){ (*this)().sort(); a.erase((*this)().uni(), end()); return *this; }
    vec sortunied(){ vec x = *this; x.sortuni(); return x; }
    Iter operator()(int x){ return a.begin() + x; }
    CIter operator()(int x) const { return a.begin() + x; }
    View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; }
    CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; }
    View operator()(){ return (*this)(0,size()); }
    CView operator()() const { return (*this)(0,size()); }
    Elem& operator[](int x){ return a[x]; }
    const Elem& operator[](int x) const { return a[x]; }
    Base& operator*(){ return a; }
    const Base& operator*() const { return a; }
    vec& push(Elem args){
        a.push_back(std::move(args));
        return *this;
    }
    vec& push_back(Elem args){ return push(std::move(args)); }
    template<class... Args>
    vec& emp(Args &&... args){
        a.emplace_back(std::forward<Args>(args) ...);
        return *this;
    }
    void assign(int n, const Elem& e){ a.assign(n, e); }
    template<class... Args> vec& emplace_back(Args &&... args){ return emp(std::forward<Args>(args) ...); }
    template<class Range>
    vec& app(Range& x){ for(auto& v : x){ emp(v); } return *this; }
    void erase(Iter l, Iter r){ a.erase(l, r); }
    Elem pop(){ Elem x = std::move(a.back()); a.pop_back(); return x; }
    Elem pop_back(){ return pop(); }
    void resize(int sz){ a.resize(sz); }
    void reserve(int sz){ a.reserve(sz); }
    bool operator==(const vec& r) const { return a == r.a; }
    bool operator!=(const vec& r) const { return a != r.a; }
    bool operator<(const vec& r) const { return a < r.a; }
    bool operator<=(const vec& r) const { return a <= r.a; }
    bool operator>(const vec& r) const { return a > r.a; }
    bool operator>=(const vec& r) const { return a >= r.a; }
    vec<vec<Elem>> pile(int n) const { return vec<vec<Elem>>(n, *this); }
    template<class F> vec& filter(F f){
        int p = 0;
        for(auto& x : a) if(f(x)) std::swap(a[p++],x);
        resize(p); return *this;
    }
    vec& operator+=(const vec& r){ return app(r); }
    vec operator+(const vec& r) const { vec x = *this; x += r; return x; }
    vec operator*(int t) const { vec res; while(t--){ res += *this; } return res; }
    vec& set(int i, const Elem& v){ a[i] = v; return *this; }
    template<class Int>
    vec operator[](const vec<Int>& i){ return i().map([&](auto& j){return a[j];}); }
private: Base a;
};

template<class Elem> vec<Elem> cumsum(const vec<Elem>& A){
    vec<Elem> buf(A.size() + 1, Elem(0));
    for(int i=0; i<A.size(); i++) buf[i+1] = buf[i] + A[i];
    return buf;
}

template<class IStr, class U, class T>
IStr& operator>>(IStr& is, vec<std::pair<U,T>>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; }
template<class IStr, class T>
IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }
template<class OStr, class T>
OStr& operator<<(OStr& os, const vec<T>& v){
    for(int i=0; i<v.size(); i++){
        if(i){ os << ' '; } os << v[i];
    } return os;
}
template<class OStr, class U, class T>
OStr& operator<<(OStr& os, const vec<std::pair<U,T>>& v){
    for(int i=0; i<v.size(); i++){
        if(i){ os << ' '; } os << '(' << v[i].first << ',' << v[i].second << ')';
    } return os;
}

using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;


vec<int> makeord(int N){
    if(N <= 3) return { 0, 1, 3, 2 };
    int n = 0;
    while((1<<n) < N*2) n++;
    vector<int> base = makeord(n);
    vector<int> ans(N+1);
    vec<pair<vector<int>, int>> tmp;
    tmp.push_back({ {}, 0 });
    for(int I=1; I<=N; I++){
        vector<int> buf;
        int p = I;
        while(p){
            int q = 0;
            while(p % 2 == 0){ p /= 2; q++; }
            p /= 2;
            q = base[q];
            if(buf.empty() || buf.back() <= q) buf.push_back(q);
        }
        reverse(buf.begin(), buf.end());
        tmp.emplace_back(move(buf), I);
    }
    tmp().sort();
    sort(tmp.begin(), tmp.end());
    rep(i,N+1) ans[tmp[i].second] = tmp().lbi({ tmp[i].first, -1 });
    return ans;
}

int main(){
    string N, M; cin >> N >> M;
    if(M == "0"){ cout << "No\n"; return 0; }
    if(N == "0"){ cout << "Yes\n"; return 0; }
    auto ord = makeord(100006);
    vec<int> Narr, Marr;
    rep(t,2){
        swap(N, M);
        swap(Narr, Marr);
        for(auto q : vec<char>(N.begin(), N.end())().rle()){
            if(q.first == '0'){
                int f = ord[q.second];
                while(Narr.size() != 0 && Narr[Narr.size()-1] < f) Narr.pop();
                Narr.push(f);
            }
            else rep(j,q.second-1) Narr.push(ord[0]);
        }
        if(N.back() == '1') Narr.push(ord[0]);
    }
    Narr().sort().rev();
    Marr().sort().rev();
    cout << (*Narr < *Marr ? "Yes\n" : "No\n");
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;