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

提出ソース

結果

問題	No.2397 ω冪
ユーザー	👑 Nachia
提出日時	2023-07-28 22:19:03
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,257 bytes
コンパイル時間	1,609 ms
コンパイル使用メモリ	118,976 KB
実行使用メモリ	13,008 KB
最終ジャッジ日時	2024-10-06 19:24:45
合計ジャッジ時間	6,108 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	86 ms 12,796 KB
testcase_03	AC	2 ms 5,248 KB
testcase_04	AC	86 ms 12,672 KB
testcase_05	AC	86 ms 12,668 KB
testcase_06	AC	85 ms 12,796 KB
testcase_07	AC	85 ms 12,664 KB
testcase_08	AC	86 ms 12,796 KB
testcase_09	AC	85 ms 12,668 KB
testcase_10	AC	86 ms 12,792 KB
testcase_11	AC	85 ms 12,800 KB
testcase_12	AC	84 ms 12,800 KB
testcase_13	AC	84 ms 12,668 KB
testcase_14	WA	-
testcase_15	AC	87 ms 12,796 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	84 ms 12,668 KB
testcase_20	AC	83 ms 12,796 KB
testcase_21	AC	86 ms 12,668 KB
testcase_22	WA	-
testcase_23	AC	85 ms 12,792 KB
testcase_24	AC	88 ms 12,664 KB
testcase_25	AC	86 ms 12,668 KB
testcase_26	AC	85 ms 12,668 KB
testcase_27	AC	86 ms 12,668 KB
testcase_28	AC	86 ms 12,668 KB
testcase_29	AC	85 ms 12,668 KB
testcase_30	AC	88 ms 12,668 KB
testcase_31	AC	85 ms 12,668 KB
testcase_32	WA	-
testcase_33	WA	-
testcase_34	AC	84 ms 12,792 KB
testcase_35	AC	87 ms 12,612 KB
testcase_36	AC	91 ms 13,008 KB
testcase_37	AC	92 ms 12,884 KB
testcase_38	WA	-
testcase_39	AC	92 ms 13,008 KB
testcase_40	AC	89 ms 12,880 KB

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

ソースコード

raw source code

#line 1 "..\\Main.cpp"

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
#line 1 "D:\\Programming\\VSCode\\competitive-cpp\\nachia\\vec.hpp"

#line 3 "D:\\Programming\\VSCode\\competitive-cpp\\nachia\\vec.hpp"
#include <iterator>
#line 5 "D:\\Programming\\VSCode\\competitive-cpp\\nachia\\vec.hpp"
#include <functional>
#include <utility>
#line 8 "D:\\Programming\\VSCode\\competitive-cpp\\nachia\\vec.hpp"

template<class Elem> struct vec;
struct iotai;

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){ return *(a+x); }
    template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {
        ret x(iotai(0), iotai(size()));
        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 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[-1].first, a)) x.emp(a, 1); else x[-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); }
    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<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); }
    seq_view rev() const { std::reverse(a, b); return *this; }
};

struct iotai {
    using i64 = long long;
    using Me = iotai;
    using value_type = i64;
    using iterator_category = std::random_access_iterator_tag;
    using difference_type = ptrdiff_t;
    using pointer = i64*;
    using reference = i64&;
    i64 x;
    iotai(i64 y) : x(y) {}
    i64 operator*() const { return x; }
    std::size_t operator-(Me a) const { return x - a.x; }
    Me operator++(){ return { (i64)(++x) }; }
    Me operator--(){ return { (i64)(--x) }; }
    Me operator++(int){ return { (i64)(x++) }; }
    Me operator--(int){ return { (i64)(x--) }; }
    Me operator+(std::size_t a) const { return { (i64)(x+a) }; }
    Me operator-(std::size_t a) const { return { (i64)(x-a) }; }
    static seq_view<iotai> range(i64 l, i64 r){ return { Me{l}, Me{r} }; }
};

template<class Elem>
struct vec {
    using Base = typename std::vector<Elem>;
    using Iter = typename Base::iterator;
    using CIter = typename Base::const_iterator;
    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(); }
    vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; }
    Iter operator()(int x){ return (x < 0 ? a.end() : a.begin()) + x; }
    CIter operator()(int x) const { return (x < 0 ? a.end() : 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 *((*this)(x)); }
    const Elem& operator[](int x) const { return *((*this)(x)); }
    Base& operator*(){ return a; }
    const Base& operator*() const { return a; }
    vec& push(Elem args){
        a.push_back(std::move(args));
        return *this;
    }
    template<class... Args>
    vec& emp(Args &&... args){
        a.emplace_back(std::forward<Args>(args) ...);
        return *this;
    }
    template<class Range>
    vec& app(Range& x){ for(auto& v : a) emp(v); }
    Elem pop(){
        Elem x = std::move(a.back());
        a.pop_back(); return x;
    }
private: Base a;
};

template<class IStr, class T>
IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }
#line 8 "..\\Main.cpp"
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;

//using Modint = atcoder::static_modint<998244353>;
using Modint = atcoder::modint;

vector<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);
    vector<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;
            buf.push_back(base[q]);
        }
        sort(buf.rbegin(), buf.rend());
        tmp.emplace_back(move(buf), I);
    }
    sort(tmp.begin(), tmp.end());
    rep(i,N+1) ans[tmp[i].second] = i;
    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;
    for(auto q : vec<char>(N.begin(), N.end())().rle()){
        if(q.first == '0') Narr.push(q.second);
        else rep(j,q.second-1) Narr.push(0);
    }
    for(auto q : vec<char>(M.begin(), M.end())().rle()){
        if(q.first == '0') Marr.push(q.second);
        else rep(j,q.second-1) Marr.push(0);
    }
    for(auto& q : Narr) q = ord[q];
    for(auto& q : Marr) q = ord[q];
    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;

yukicoder

結果

テストケース

ソースコード