#954231 (C++23) No.2652 [Cherry 6th Tune N] Δρονε χιρχλινγ

提出ソース

結果

問題	No.2652 [Cherry 6th Tune N] Δρονε χιρχλινγ
ユーザー	👑 rin204
提出日時	2024-02-23 21:48:48
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	672 ms / 2,000 ms
コード長	12,767 bytes
コンパイル時間	5,416 ms
コンパイル使用メモリ	304,680 KB
実行使用メモリ	33,100 KB
最終ジャッジ日時	2024-09-29 06:15:15
合計ジャッジ時間	49,071 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	330 ms 6,816 KB
testcase_02	AC	328 ms 6,816 KB
testcase_03	AC	335 ms 6,816 KB
testcase_04	AC	386 ms 6,816 KB
testcase_05	AC	374 ms 6,816 KB
testcase_06	AC	387 ms 5,548 KB
testcase_07	AC	470 ms 19,288 KB
testcase_08	AC	479 ms 14,572 KB
testcase_09	AC	519 ms 21,500 KB
testcase_10	AC	461 ms 20,240 KB
testcase_11	AC	472 ms 19,592 KB
testcase_12	AC	475 ms 19,424 KB
testcase_13	AC	540 ms 28,832 KB
testcase_14	AC	610 ms 30,148 KB
testcase_15	AC	524 ms 25,608 KB
testcase_16	AC	478 ms 17,332 KB
testcase_17	AC	508 ms 22,976 KB
testcase_18	AC	539 ms 20,708 KB
testcase_19	AC	515 ms 24,512 KB
testcase_20	AC	616 ms 30,584 KB
testcase_21	AC	611 ms 30,840 KB
testcase_22	AC	623 ms 30,716 KB
testcase_23	AC	649 ms 30,712 KB
testcase_24	AC	638 ms 30,712 KB
testcase_25	AC	648 ms 30,840 KB
testcase_26	AC	641 ms 30,588 KB
testcase_27	AC	637 ms 30,844 KB
testcase_28	AC	626 ms 30,972 KB
testcase_29	AC	637 ms 30,584 KB
testcase_30	AC	634 ms 30,708 KB
testcase_31	AC	623 ms 30,840 KB
testcase_32	AC	644 ms 30,712 KB
testcase_33	AC	672 ms 30,708 KB
testcase_34	AC	625 ms 30,716 KB
testcase_35	AC	641 ms 30,712 KB
testcase_36	AC	658 ms 30,712 KB
testcase_37	AC	613 ms 30,844 KB
testcase_38	AC	589 ms 30,840 KB
testcase_39	AC	641 ms 30,764 KB
testcase_40	AC	317 ms 33,100 KB
testcase_41	AC	352 ms 32,976 KB

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

ソースコード

raw source code

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #define INTERACTIVE

namespace templates {
// type
using ll  = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on

// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on

// const value
const ll MOD1   = 1000000007;
const ll MOD9   = 998244353;
const double PI = acos(-1);

// other macro
#if !defined(RIN__LOCAL) && !defined(INTERACTIVE)
#define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)

// function
vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}
string ctos(vector<char> &S) {
    int n      = S.size();
    string ret = "";
    for (int i = 0; i < n; i++) ret += S[i];
    return ret;
}

template <class T>
auto min(const T &a) {
    return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}

template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}

template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}

// input and output
namespace io {
// __int128_t
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}

// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << ' ';
    }
    return os;
}

// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
    is >> A.first >> A.second;
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
    os << A.first << ' ' << A.second;
    return os;
}

// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        is >> A[i];
    }
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// tuple
template <typename T, size_t N>
struct TuplePrint {
    static ostream &print(ostream &os, const T &t) {
        TuplePrint<T, N - 1>::print(os, t);
        os << ' ' << get<N - 1>(t);
        return os;
    }
};
template <typename T>
struct TuplePrint<T, 1> {
    static ostream &print(ostream &os, const T &t) {
        os << get<0>(t);
        return os;
    }
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
    TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
    return os;
}

// io functions
void FLUSH() {
    cout << flush;
}

void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(std::forward<Tail>(tail)...);
}

template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void prispa(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}

template <class... T>
void inp(T &...a) {
    (cin >> ... >> a);
}

} // namespace io
using namespace io;

// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}

template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}

// yes / no
namespace yesno {

// yes
inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}

// no
inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}

// possible
inline bool possible(bool f = true) {
    cout << (f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Possible(bool f = true) {
    cout << (f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool POSSIBLE(bool f = true) {
    cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// impossible
inline bool impossible(bool f = true) {
    cout << (!f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Impossible(bool f = true) {
    cout << (!f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool IMPOSSIBLE(bool f = true) {
    cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// Alice Bob
inline bool Alice(bool f = true) {
    cout << (f ? "Alice" : "Bob") << endl;
    return f;
}
inline bool Bob(bool f = true) {
    cout << (f ? "Bob" : "Alice") << endl;
    return f;
}

// Takahashi Aoki
inline bool Takahashi(bool f = true) {
    cout << (f ? "Takahashi" : "Aoki") << endl;
    return f;
}
inline bool Aoki(bool f = true) {
    cout << (f ? "Aoki" : "Takahashi") << endl;
    return f;
}

} // namespace yesno
using namespace yesno;

} // namespace templates
using namespace templates;

struct UnionFind {
    int n;
    std::vector<int> par;
    int group;

    UnionFind() = default;
    UnionFind(int n) : n(n) {
        par.assign(n, -1);
        group = n;
    }

    int find(int x) {
        if (par[x] < 0) return x;
        par[x] = find(par[x]);
        return par[x];
    }

    bool unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return false;
        if (par[x] > par[y]) std::swap(x, y);
        group--;
        par[x] += par[y];
        par[y] = x;
        return true;
    }

    bool same(int x, int y) {
        return find(x) == find(y);
    }

    int size(int x) {
        return -par[find(x)];
    }

    std::vector<int> roots() {
        std::vector<int> ret;
        for (int i = 0; i < n; i++) {
            if (i == find(i)) ret.push_back(i);
        }
        return ret;
    }

    bool isroot(int x) {
        return x == find(x);
    }
};

template <typename T>
struct ManhattanEdges {
    int i;
    int j;
    T cost;
};

template <typename T>
std::pair<std::vector<ManhattanEdges<T>>, T> ManhattanMST(std::vector<T> X, std::vector<T> Y) {
    assert(X.size() == Y.size());
    using ME = ManhattanEdges<T>;
    std::vector<ME> E;
    int n = X.size();

    std::vector<int> ord(n);
    std::iota(ord.begin(), ord.end(), 0);

    for (int s = 0; s < 2; s++) {
        for (int t = 0; t < 2; t++) {
            sort(ord.begin(), ord.end(), [&](int i, int j) { return X[i] + Y[i] < X[j] + Y[j]; });

            std::map<T, int> ind;
            for (auto i : ord) {
                for (auto it = ind.lower_bound(-Y[i]); it != ind.end(); it = ind.erase(it)) {
                    int j = (*it).second;
                    if (X[i] - X[j] < Y[i] - Y[j]) break;
                    E.push_back({i, j, abs(X[i] - X[j]) + abs(Y[i] - Y[j])});
                }
                ind[-Y[i]] = i;
            }
            std::swap(X, Y);
        }
        for (int i = 0; i < n; i++) X[i] *= -1;
    }

    std::sort(E.begin(), E.end(), [](ME &lhs, ME &rhs) { return lhs.cost < rhs.cost; });

    UnionFind UF(n);
    std::vector<ME> ret;
    T cost = 0;
    for (auto tmp : E) {
        if (UF.unite(tmp.i, tmp.j)) {
            ret.push_back(tmp);
            cost += tmp.cost;
        }
    }
    return {ret, cost};
}

template <typename T>
std::pair<std::vector<ManhattanEdges<T>>, T> ManhattanMST(std::vector<std::pair<T, T>> xy) {
    int n = xy.size();
    std::vector<T> X(n), Y(n);
    for (int i = 0; i < n; i++) {
        X[i] = xy[i].first;
        Y[i] = xy[i].second;
    }
    return ManhattanMST(X, Y);
}

void solve() {
    LL(n, L);
    vec(ll, X, n);
    vec(ll, Y, n);
    fori(i, n) {
        inp(X[i], Y[i]);
    }
    auto E = ManhattanMST(X, Y).first;
    vvec(int, edges, n, 0);
    for (auto &e : E) {
        edges[e.i].push_back(e.j);
        edges[e.j].push_back(e.i);
    }
    stack<int> st;
    vec(bool, used, n, false);
    st.push(0);
    used[0] = true;
    print(n);
    while (!st.empty()) {
        int pos = st.top();
        st.pop();
        print(X[pos], Y[pos]);
        for (auto npos : edges[pos]) {
            if (!used[npos]) {
                st.push(npos);
                used[npos] = true;
            }
        }
    }
}

int main() {
#ifndef INTERACTIVE
    cin.tie(0)->sync_with_stdio(0);
#endif
    cout << fixed << setprecision(12);
    int t;
    t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード