#974542 (C++23) No.2732 Similar Permutations

提出ソース

結果

問題	No.2732 Similar Permutations
ユーザー	ebi_fly
提出日時	2024-04-19 23:12:06
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	52 ms / 2,000 ms
コード長	9,695 bytes
コンパイル時間	4,538 ms
コンパイル使用メモリ	260,384 KB
実行使用メモリ	5,760 KB
最終ジャッジ日時	2024-10-11 17:32:47
合計ジャッジ時間	18,172 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	3 ms 5,248 KB
testcase_02	AC	17 ms 5,248 KB
testcase_03	AC	29 ms 5,248 KB
testcase_04	AC	11 ms 5,248 KB
testcase_05	AC	9 ms 5,248 KB
testcase_06	AC	5 ms 5,248 KB
testcase_07	AC	22 ms 5,248 KB
testcase_08	AC	13 ms 5,248 KB
testcase_09	AC	7 ms 5,248 KB
testcase_10	AC	51 ms 5,504 KB
testcase_11	AC	6 ms 5,248 KB
testcase_12	AC	51 ms 5,632 KB
testcase_13	AC	51 ms 5,632 KB
testcase_14	AC	51 ms 5,632 KB
testcase_15	AC	51 ms 5,632 KB
testcase_16	AC	37 ms 5,248 KB
testcase_17	AC	36 ms 5,248 KB
testcase_18	AC	47 ms 5,504 KB
testcase_19	AC	51 ms 5,632 KB
testcase_20	AC	51 ms 5,504 KB
testcase_21	AC	50 ms 5,632 KB
testcase_22	AC	30 ms 5,248 KB
testcase_23	AC	50 ms 5,632 KB
testcase_24	AC	31 ms 5,248 KB
testcase_25	AC	51 ms 5,632 KB
testcase_26	AC	43 ms 5,248 KB
testcase_27	AC	52 ms 5,632 KB
testcase_28	AC	41 ms 5,248 KB
testcase_29	AC	51 ms 5,632 KB
testcase_30	AC	37 ms 5,248 KB
testcase_31	AC	51 ms 5,632 KB
testcase_32	AC	48 ms 5,376 KB
testcase_33	AC	51 ms 5,504 KB
testcase_34	AC	35 ms 5,248 KB
testcase_35	AC	51 ms 5,760 KB
testcase_36	AC	47 ms 5,504 KB
testcase_37	AC	51 ms 5,632 KB
testcase_38	AC	44 ms 5,376 KB
testcase_39	AC	51 ms 5,632 KB
testcase_40	AC	44 ms 5,376 KB
testcase_41	AC	51 ms 5,632 KB
testcase_42	AC	38 ms 5,248 KB
testcase_43	AC	51 ms 5,632 KB
testcase_44	AC	28 ms 5,248 KB
testcase_45	AC	50 ms 5,632 KB
testcase_46	AC	46 ms 5,376 KB
testcase_47	AC	50 ms 5,632 KB
testcase_48	AC	32 ms 5,248 KB
testcase_49	AC	50 ms 5,632 KB
testcase_50	AC	31 ms 5,248 KB
testcase_51	AC	48 ms 5,632 KB
testcase_52	AC	41 ms 5,376 KB
testcase_53	AC	51 ms 5,504 KB
testcase_54	AC	51 ms 5,632 KB
testcase_55	AC	52 ms 5,632 KB
testcase_56	AC	51 ms 5,632 KB
testcase_57	AC	28 ms 5,248 KB
testcase_58	AC	36 ms 5,248 KB
testcase_59	AC	35 ms 5,248 KB
testcase_60	AC	30 ms 5,248 KB
testcase_61	AC	27 ms 5,248 KB
testcase_62	AC	43 ms 5,376 KB
testcase_63	AC	3 ms 5,248 KB
testcase_64	AC	2 ms 5,248 KB
testcase_65	AC	3 ms 5,248 KB
testcase_66	AC	2 ms 5,248 KB
testcase_67	AC	2 ms 5,248 KB
testcase_68	AC	3 ms 5,248 KB
testcase_69	AC	3 ms 5,248 KB
testcase_70	AC	2 ms 5,248 KB
testcase_71	AC	2 ms 5,248 KB
testcase_72	AC	2 ms 5,248 KB
testcase_73	AC	3 ms 5,248 KB
testcase_74	AC	3 ms 5,248 KB
testcase_75	AC	3 ms 5,248 KB
testcase_76	AC	2 ms 5,248 KB
testcase_77	AC	3 ms 5,248 KB
testcase_78	AC	2 ms 5,248 KB
testcase_79	AC	2 ms 5,248 KB
testcase_80	AC	2 ms 5,248 KB
testcase_81	AC	2 ms 5,248 KB
testcase_82	AC	3 ms 5,248 KB
testcase_83	AC	3 ms 5,248 KB
testcase_84	AC	2 ms 5,248 KB
testcase_85	AC	2 ms 5,248 KB
testcase_86	AC	2 ms 5,248 KB
testcase_87	AC	3 ms 5,248 KB
testcase_88	AC	3 ms 5,248 KB
testcase_89	AC	3 ms 5,248 KB
testcase_90	AC	2 ms 5,248 KB
testcase_91	AC	3 ms 5,248 KB
testcase_92	AC	3 ms 5,248 KB
testcase_93	AC	3 ms 5,248 KB
testcase_94	AC	2 ms 5,248 KB
testcase_95	AC	2 ms 5,248 KB
testcase_96	AC	3 ms 5,248 KB
testcase_97	AC	3 ms 5,248 KB
testcase_98	AC	3 ms 5,248 KB
testcase_99	AC	2 ms 5,248 KB
testcase_100	AC	2 ms 5,248 KB
testcase_101	AC	2 ms 5,248 KB
testcase_102	AC	2 ms 5,248 KB

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

ソースコード

raw source code

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)
#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)
#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()

#line 2 "template/debug_template.hpp"

#line 4 "template/debug_template.hpp"

namespace ebi {

#ifdef LOCAL
#define debug(...)                                                      \
    std::cerr << "LINE: " << __LINE__ << "  [" << #__VA_ARGS__ << "]:", \
        debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() {
    std::cerr << std::endl;
}

template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
    std::cerr << " " << h;
    if (sizeof...(t) > 0) std::cerr << " :";
    debug_out(t...);
}

}  // namespace ebi
#line 2 "template/int_alias.hpp"

#line 4 "template/int_alias.hpp"

namespace ebi {

using ld = long double;
using std::size_t;
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;

}  // namespace ebi
#line 2 "template/io.hpp"

#line 5 "template/io.hpp"
#include <optional>
#line 7 "template/io.hpp"

namespace ebi {

template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
    return os << pa.first << " " << pa.second;
}

template <typename T1, typename T2>
std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {
    return os >> pa.first >> pa.second;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
    for (std::size_t i = 0; i < vec.size(); i++)
        os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    return os;
}

template <typename T>
std::istream &operator>>(std::istream &os, std::vector<T> &vec) {
    for (T &e : vec) std::cin >> e;
    return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {
    if (opt) {
        os << opt.value();
    } else {
        os << "invalid value";
    }
    return os;
}

void fast_io() {
    std::cout << std::fixed << std::setprecision(15);
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
}

}  // namespace ebi
#line 2 "template/utility.hpp"

#line 5 "template/utility.hpp"

#line 2 "graph/base.hpp"

#line 5 "graph/base.hpp"
#include <ranges>
#line 7 "graph/base.hpp"

#line 2 "data_structure/simple_csr.hpp"

#line 6 "data_structure/simple_csr.hpp"

namespace ebi {

template <class E> struct simple_csr {
    simple_csr() = default;

    simple_csr(int n, const std::vector<std::pair<int, E>>& elements)
        : start(n + 1, 0), elist(elements.size()) {
        for (auto e : elements) {
            start[e.first + 1]++;
        }
        for (auto i : std::views::iota(0, n)) {
            start[i + 1] += start[i];
        }
        auto counter = start;
        for (auto [i, e] : elements) {
            elist[counter[i]++] = e;
        }
    }

    simple_csr(const std::vector<std::vector<E>>& es)
        : start(es.size() + 1, 0) {
        int n = es.size();
        for (auto i : std::views::iota(0, n)) {
            start[i + 1] = (int)es[i].size() + start[i];
        }
        elist.resize(start.back());
        for (auto i : std::views::iota(0, n)) {
            std::copy(es[i].begin(), es[i].end(), elist.begin() + start[i]);
        }
    }

    int size() const {
        return (int)start.size() - 1;
    }

    const auto operator[](int i) const {
        return std::ranges::subrange(elist.begin() + start[i],
                                     elist.begin() + start[i + 1]);
    }
    auto operator[](int i) {
        return std::ranges::subrange(elist.begin() + start[i],
                                     elist.begin() + start[i + 1]);
    }

    const auto operator()(int i, int l, int r) const {
        return std::ranges::subrange(elist.begin() + start[i] + l,
                                     elist.begin() + start[i + 1] + r);
    }
    auto operator()(int i, int l, int r) {
        return std::ranges::subrange(elist.begin() + start[i] + l,
                                     elist.begin() + start[i + 1] + r);
    }

  private:
    std::vector<int> start;
    std::vector<E> elist;
};

}  // namespace ebi
#line 9 "graph/base.hpp"

namespace ebi {

template <class T> struct Edge {
    int from, to;
    T cost;
    int id;
};

template <class E> struct Graph {
    using cost_type = E;
    using edge_type = Edge<cost_type>;

    Graph(int n_) : n(n_) {}

    Graph() = default;

    void add_edge(int u, int v, cost_type c) {
        buff.emplace_back(u, edge_type{u, v, c, m});
        edges.emplace_back(edge_type{u, v, c, m++});
    }

    void add_undirected_edge(int u, int v, cost_type c) {
        buff.emplace_back(u, edge_type{u, v, c, m});
        buff.emplace_back(v, edge_type{v, u, c, m});
        edges.emplace_back(edge_type{u, v, c, m});
        m++;
    }

    void read_tree(int offset = 1, bool is_weighted = false) {
        read_graph(n - 1, offset, false, is_weighted);
    }

    void read_parents(int offset = 1) {
        for (auto i : std::views::iota(1, n)) {
            int p;
            std::cin >> p;
            p -= offset;
            add_undirected_edge(p, i, 1);
        }
        build();
    }

    void read_graph(int e, int offset = 1, bool is_directed = false,
                    bool is_weighted = false) {
        for (int i = 0; i < e; i++) {
            int u, v;
            std::cin >> u >> v;
            u -= offset;
            v -= offset;
            if (is_weighted) {
                cost_type c;
                std::cin >> c;
                if (is_directed) {
                    add_edge(u, v, c);
                } else {
                    add_undirected_edge(u, v, c);
                }
            } else {
                if (is_directed) {
                    add_edge(u, v, 1);
                } else {
                    add_undirected_edge(u, v, 1);
                }
            }
        }
        build();
    }

    void build() {
        assert(!prepared);
        csr = simple_csr<edge_type>(n, buff);
        buff.clear();
        prepared = true;
    }

    int size() const {
        return n;
    }

    int node_number() const {
        return n;
    }

    int edge_number() const {
        return m;
    }

    edge_type get_edge(int i) const {
        return edges[i];
    }

    std::vector<edge_type> get_edges() const {
        return edges;
    }

    const auto operator[](int i) const {
        return csr[i];
    }
    auto operator[](int i) {
        return csr[i];
    }

  private:
    int n, m = 0;

    std::vector<std::pair<int,edge_type>> buff;

    std::vector<edge_type> edges;
    simple_csr<edge_type> csr;
    bool prepared = false;
};

}  // namespace ebi
#line 8 "template/utility.hpp"

namespace ebi {

template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> T safe_ceil(T a, T b) {
    if (a % b == 0)
        return a / b;
    else if (a >= 0)
        return (a / b) + 1;
    else
        return -((-a) / b);
}

template <class T> T safe_floor(T a, T b) {
    if (a % b == 0)
        return a / b;
    else if (a >= 0)
        return a / b;
    else
        return -((-a) / b) - 1;
}

constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;

constexpr int INF = std::numeric_limits<int>::max() / 2;

const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};
const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};

}  // namespace ebi
#line 2 "a.cpp"

namespace ebi {

void main_() {
    int n;
    std::cin >> n;
    std::vector<int> a(n);
    std::cin >> a;
    const int max = 200'010;
    std::vector<int> table(max, -1);
    rep(i,0,n) {
        if(table[a[i]] != -1) {
            std::vector<int> ans(n);
            std::iota(all(ans), 1);
            std::cout << ans << '\n';
            std::swap(ans[table[a[i]]], ans[i]);
            std::cout << ans << '\n';
            return;
        }
        table[a[i]] = i;
    }
    int log = 0;
    while((1<<log) <= n) {
        log++;
    }
    std::map<std::tuple<int,int,int>,int> map;
    rep(i,0,n) {
        rep(j,0,log) {
            rep(k,0,j) {
                int x = (a[i] + (1<<j)) ^ (a[i] + (1<<k));
                if(map.contains({x, j, k})) {
                    int l = map[{x, j, k}];
                    int r = i;
                    std::vector<int> ans(n);
                    ans[l] = 1<<j;
                    ans[r] = 1<<k;
                    int now = 1;
                    rep(i,0,n) {
                        if(i == l || i == r) continue;
                        while(now == (1<<j) || now == (1<<k)) now++;
                        ans[i] = now++;
                    }
                    std::cout << ans << '\n';
                    std::swap(ans[l], ans[r]);
                    std::cout << ans << '\n';
                    return;
                }
                map[{x, j, k}] = i;
            }
        }
    }
    std::cout << "-1\n";
}

}  // namespace ebi

int main() {
    ebi::fast_io();
    int t = 1;
    // std::cin >> t;
    while (t--) {
        ebi::main_();
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード