#498053 (C++14) No.416 旅行会社

提出ソース

結果

問題	No.416 旅行会社
ユーザー	haruki_K
提出日時	2020-06-18 05:45:52
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	460 ms / 4,000 ms
コード長	6,401 bytes
コンパイル時間	2,113 ms
コンパイル使用メモリ	185,472 KB
実行使用メモリ	23,492 KB
最終ジャッジ日時	2024-05-08 15:53:50
合計ジャッジ時間	7,143 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	127 ms 11,008 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	1 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	3 ms 6,944 KB
testcase_08	AC	5 ms 6,944 KB
testcase_09	AC	22 ms 6,940 KB
testcase_10	AC	144 ms 13,312 KB
testcase_11	AC	133 ms 13,440 KB
testcase_12	AC	133 ms 13,440 KB
testcase_13	AC	111 ms 10,880 KB
testcase_14	AC	460 ms 23,492 KB
testcase_15	AC	429 ms 23,452 KB
testcase_16	AC	405 ms 18,688 KB
testcase_17	AC	441 ms 18,688 KB
testcase_18	AC	431 ms 23,448 KB
testcase_19	AC	395 ms 20,124 KB
testcase_20	AC	391 ms 20,020 KB

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

コンパイルメッセージ

main.cpp: In function 'int32_t main()':
main.cpp:146:27: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  146 |                 for (auto [a,b] : es) uf.unite(a,b);
      |                           ^

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
// >>> union find
struct UnionFind {
    int n, sz; // id : 0...n-1
    vector<int> par;

    UnionFind(int n = 0) : n(n), sz(n), par(n,-1) { }
    int root(int x) {
        assert(0 <= x); assert(x < n);
        return par[x] < 0 ? x : par[x] = root(par[x]);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        sz--;
        if (par[x] < par[y]) swap(x,y);
        par[y] += par[x];
        par[x] = y;
        return true;
    }
    bool same(int x, int y) { return root(x) == root(y); }
    int size(int x) { return -par[root(x)]; }
    int size() const { return sz; }
    struct groups_t {
        vector<vector<int> > grp;
        vector<pair<int,int> > id;
    };
    groups_t groups() {
        vector<vector<int> > g(n);
        rep (i,n) if (par[i] < 0) g[i].reserve(-par[i]);
        rep (i,n) g[root(i)].push_back(i);
        vector<vector<int> > grp; grp.reserve(size());
        rep (i,n) if (g[i].size()) grp.emplace_back(move(g[i]));
        vector<pair<int,int> > id(n);
        rep (i,grp.size()) rep (j,grp[i].size()) {
            id[grp[i][j]] = make_pair(i,j);
        }
        return { grp, id };
    }
};
// <<<

int32_t main() {
    int n,m,q; cin >> n >> m >> q;
    set<pair<int,int>> es;
    rep (i,m) {
        int a,b; cin >> a >> b; --a,--b;
        es.emplace(a,b);
    }
    vector<int> c(q),d(q);
    rep (i,q) {
        cin >> c[i] >> d[i], --c[i],--d[i];
        es.erase(mp(c[i],d[i]));
    }

    vector<int> l(n,-1),r(n,q+1);
    while (1) {
        vector<vector<int>> w(q+1);
        bool update = false;
        rep (i,n) if (l[i]+1 < r[i]) {
            w[(l[i]+r[i])/2].eb(i);
            update = true;
        }
        if (not update) break;

        UnionFind uf(n);
        repR (i,q+1) {
            if (i == q) {
                for (auto [a,b] : es) uf.unite(a,b);
            } else {
                uf.unite(c[i],d[i]);
            }
            for (auto idx : w[i]) {
                (uf.same(0,idx) ? l[idx] : r[idx]) = i;
            }
        }
    }
    dump(l);
    dump(r);

    rep (i,n) {
        if (i == 0) continue;
        if (l[i] == -1) {
            cout << 0 << "\n";
        } else if (l[i] == q) {
            cout << -1 << "\n";
        } else {
            cout << l[i]+1 << "\n";
        }
    }

}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード