結果

問題 No.2301 Namorientation
ユーザー iiljjiiljj
提出日時 2023-05-12 23:04:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 569 ms / 3,000 ms
コード長 14,158 bytes
コンパイル時間 2,115 ms
コンパイル使用メモリ 163,924 KB
実行使用メモリ 100,796 KB
最終ジャッジ日時 2024-11-28 19:44:27
合計ジャッジ時間 16,760 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 312 ms
43,576 KB
testcase_13 AC 269 ms
39,896 KB
testcase_14 AC 535 ms
70,528 KB
testcase_15 AC 341 ms
48,128 KB
testcase_16 AC 456 ms
60,928 KB
testcase_17 AC 318 ms
45,256 KB
testcase_18 AC 480 ms
62,208 KB
testcase_19 AC 252 ms
37,636 KB
testcase_20 AC 471 ms
61,440 KB
testcase_21 AC 343 ms
47,488 KB
testcase_22 AC 255 ms
100,796 KB
testcase_23 AC 249 ms
99,356 KB
testcase_24 AC 209 ms
83,704 KB
testcase_25 AC 132 ms
55,308 KB
testcase_26 AC 177 ms
71,836 KB
testcase_27 AC 541 ms
70,784 KB
testcase_28 AC 569 ms
70,784 KB
testcase_29 AC 542 ms
70,656 KB
testcase_30 AC 555 ms
70,828 KB
testcase_31 AC 551 ms
70,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {
    if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
        os << get<N>(a);
        if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
            os << ' ';
        } else if constexpr (end_line) {
            os << '\n';
        }
        return operator<< <N + 1, end_line>(os, a);
    }
    return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<< <0, true>(cout, a); }

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifndef MYLOCAL
#undef DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    assert((cin >> __VA_ARGS__));

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i) v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i) v[i]++;
}

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region Graph */

// エッジ（本来エッジは双方向だが，ここでは単方向で管理）
template <class weight_t = int, class flow_t = int> struct Edge {
    int src;         // エッジ始点となる頂点
    int dst;         // エッジ終点となる頂点
    weight_t weight; // 重み
    flow_t cap;
    Edge() : src(0), dst(0), weight(0) {}
    Edge(int src, int dst, weight_t weight) : src(src), dst(dst), weight(weight) {}
    Edge(int src, int dst, weight_t weight, flow_t cap) : src(src), dst(dst), weight(weight), cap(cap) {}
    // Edge 標準出力
    friend ostream &operator<<(ostream &os, Edge &edge) {
        os << "(" << edge.src << " -> " << edge.dst << ", " << edge.weight << ")";
        return os;
    }
};

// 同じ頂点を始点とするエッジ集合
template <class weight_t = int, class flow_t = int> class Node : public vc<Edge<weight_t, flow_t>> {
  public:
    int idx;
    Node() : vc<Edge<weight_t, flow_t>>() {}
    // void add(int a, int b, weight_t w, flow_t cap) { this->emplace_back(a, b, w, cap); };
};

// graph[i] := 頂点 i を始点とするエッジ集合
template <class weight_t = int, class flow_t = int> class Graph : public vc<Node<weight_t, flow_t>> {
  public:
    Graph() : vc<Node<weight_t, flow_t>>() {}
    Graph(int n) : vc<Node<weight_t, flow_t>>(n) { REP(i, 0, n)(*this)[i].idx = i; }
    /** 単方向 */
    void add_arc(int a, int b, weight_t w = 1, flow_t cap = 1) { (*this)[a].emplace_back(a, b, w, cap); }
    /** 双方向 */
    void add_edge(int a, int b, weight_t w = 1, flow_t cap = 1) { add_arc(a, b, w, cap), add_arc(b, a, w, cap); }
    /** ノード追加 */
    int add_node() {
        int idx = (int)this->size();
        this->emplace_back();
        Node<weight_t, flow_t> &node = this->back();
        node.idx = idx;
        return idx;
    }
};
// using Array = vc<Weight>;
// using Matrix = vc<Array>;

/* #endregion */

template <class weight_t, class flow_t> vc<int> get_cycle_undirected(Graph<weight_t, flow_t> &graph) {
    const int n = SIZE(graph);
    vc<int> visited(n, -1);
    auto dfs = [&](auto &&dfs, int idx, int par) -> vc<int> {
        if (visited[idx] != -1) return {idx};
        visited[idx] = true;
        for (Edge<weight_t, flow_t> &edge : graph[idx])
            if (edge.dst != par) {
                vc<int> path = dfs(dfs, edge.dst, idx);
                if (SIZE(path) > 0) {
                    path.push_back(idx);
                    return path;
                }
            }
        return {};
    };
    TREP(int, i, 0, n) if (visited[i] == -1) {
        vc<int> path = dfs(dfs, i, -1);
        if (SIZE(path) > 0) {
            // ループとは関係ないところが含まれているかもしれないので，
            // もしそうなら取り除く
            if (path.front() != path.back()) {
                vc<int> pos(n, -1);
                int l = -1, r = -1;
                const int m = ISIZE(path);
                TREP(int, i, 0, m) {
                    if (pos[path[i]] != -1) {
                        l = pos[path[i]];
                        r = i;
                        break;
                    }
                    pos[path[i]] = i;
                }
                if (l != -1 && r != -1) {
                    vc<int> path_sub(r - l + 1);
                    TREPM(int, i, l, r) { path_sub[i - l] = path[i]; }
                    path = path_sub;
                }
            }
            return path;
        }
    }
    return {};
}

// Problem
void solve() {
    VAR(ll, n);
    vll a(n), b(n);
    REP(i, 0, n) cin >> a[i], b[i];
    a--, b--;

    Graph<> graph(n);
    vc<int> deg(n, 0);
    vc<us<int>> dsts(n);
    REP(i, 0, n) {
        graph.add_edge(a[i], b[i]); //
        ++deg[a[i]];
        ++deg[b[i]];
        dsts[a[i]].insert(b[i]);
        dsts[b[i]].insert(a[i]);
    }

    queue<int> que;
    TREP(int, i, 0, n) {
        if (deg[i] == 1) {
            que.push(i);
        }
    }

    vc<int> cycle = get_cycle_undirected(graph);
    // dump(cycle);

    set<int> ng;
    for (const int &v : cycle) {
        ng.insert(v);
    }

    vc<int> ans(n, -1);
    const int m = ISIZE(cycle);
    TREP(int, i, 0, m - 1) {
        ans[cycle[i]] = cycle[i + 1]; //
        --deg[cycle[i]];
        --deg[cycle[i + 1]];
        dsts[cycle[i]].erase(cycle[i + 1]);
        dsts[cycle[i + 1]].erase(cycle[i]);
        // if (deg[cycle[i]] == 1) {
        //     que.push(cycle[i]);
        // }
        // if (deg[cycle[i + 1]] == 1) {
        //     que.push(cycle[i + 1]);
        // }
        // dump(cycle[i], cycle[i + 1]);
    }

    // 次数 1 の頂点から攻めていく
    while (que.size()) {
        const int v = que.front();
        que.pop();
        if (deg[v] == 0) continue;

        const int nxt = *dsts[v].begin();
        --deg[v];
        --deg[nxt];
        dsts[v].erase(nxt);
        dsts[nxt].erase(v);
        ans[v] = nxt;
        if (ng.count(nxt) == 0 && deg[nxt] == 1) {
            que.push(nxt);
        }
    }

    // 出力
    // dump(ans);
    TREP(int, i, 0, n) {
        if (ans[a[i]] == b[i]) {
            pprint("->");
        } else {
            assert(ans[b[i]] == a[i]);
            pprint("<-");
        }
    }
}

// entry point
int main() {
    solve();
    return 0;
}
0