#755538 (C++17) No.1911 Alternately Coloring

提出ソース

結果

問題	No.1911 Alternately Coloring
ユーザー	haruki_K
提出日時	2022-04-22 22:18:10
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	450 ms / 4,000 ms
コード長	9,999 bytes
コンパイル時間	3,294 ms
コンパイル使用メモリ	229,492 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-24 03:34:35
合計ジャッジ時間	9,922 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	365 ms 6,940 KB
testcase_07	AC	290 ms 6,940 KB
testcase_08	AC	285 ms 6,944 KB
testcase_09	AC	361 ms 6,940 KB
testcase_10	AC	270 ms 6,944 KB
testcase_11	AC	314 ms 6,940 KB
testcase_12	AC	360 ms 6,944 KB
testcase_13	AC	313 ms 6,940 KB
testcase_14	AC	225 ms 6,944 KB
testcase_15	AC	291 ms 6,940 KB
testcase_16	AC	290 ms 6,944 KB
testcase_17	AC	297 ms 6,944 KB
testcase_18	AC	210 ms 6,940 KB
testcase_19	AC	238 ms 6,944 KB
testcase_20	AC	269 ms 6,940 KB
testcase_21	AC	167 ms 6,940 KB
testcase_22	AC	365 ms 6,940 KB
testcase_23	AC	450 ms 6,940 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	AC	3 ms 6,944 KB
testcase_27	AC	288 ms 6,940 KB
testcase_28	AC	91 ms 6,940 KB
testcase_29	AC	231 ms 6,944 KB
testcase_30	AC	2 ms 6,940 KB

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

ソースコード

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 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) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#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 oj_local(x, y) (y)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#define oj_local(x, y) (x)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) 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 > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)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(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr ll mod(ll x, ll m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr ll div_floor(ll x, ll y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr ll div_ceil(ll x, ll y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
bool next_product(vector<int> &v, int m) {
    repR (i, v.size()) if (++v[i] < m) return true; else v[i] = 0;
    return false;
}
bool next_product(vector<int> &v, vector<int> const& s) {
    repR (i, v.size()) if (++v[i] < s[i]) return true; else v[i] = 0;
    return false;
}
template <class vec> int sort_unique(vec &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
    return v.size();
}
template <class It> auto prefix_sum(It l, It r) {
    vector<typename It::value_type> s = { 0 };
    while (l != r) s.emplace_back(s.back() + *l++);
    return s;
}
template <class It> auto suffix_sum(It l, It r) {
    vector<typename It::value_type> s = { 0 };
    while (l != r) s.emplace_back(*--r + s.back());
    reverse(s.begin(), s.end());
    return s;
}
template <class T> T pop(vector<T> &a) { auto x = a.back(); a.pop_back(); return x; }
template <class T, class V, class C> T pop(priority_queue<T, V, C> &a) { auto x = a.top(); a.pop(); return x; }
template <class T> T pop(queue<T> &a) { auto x = a.front(); a.pop(); return x; }
template <class T> T pop_front(deque<T> &a) { auto x = a.front(); a.pop_front(); return x; }
template <class T> T pop_back(deque<T> &a) { auto x = a.back(); a.pop_back(); return x; }
template <class T> T pop_front(set<T> &a) { auto x = *a.begin(); a.erase(a.begin()); return x; }
template <class T> T pop_back(set<T> &a) { auto it = prev(a.end()); auto x = *it; a.erase(it); return x; }
template <class T> T pop_front(multiset<T> &a) { auto it = a.begin(); auto x = *it; a.erase(it); return x; }
template <class T> T pop_back(multiset<T> &a) { auto it = prev(a.end()); auto x = *it; a.erase(it); return x; }
// <<<
// >>> union find

struct UnionFind {
    int n, sz; // id : 0...n-1
    vector<int32_t> par;

    UnionFind(int n = 0) : n(n), sz(n), par(n, -1) { }
    void clear() {
        rep (i, n) par[i] = -1;
        sz = n;
    }
    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; }
    vector<vector<int32_t>> groups() {
        vector<vector<int32_t>> 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<int32_t>> grp; grp.reserve(size());
        rep (i, n) if (g[i].size()) grp.emplace_back(move(g[i]));
        return grp;
    }
};

// <<<
struct edge { int to; int cost; };
// >>> dijkstra
#ifndef EDGE_INFO
#define EDGE_INFO
constexpr int dest(int v) { return v; }
template <class E, class = decltype(declval<E>().to)>
constexpr int dest(E const& e) { return e.to; }
constexpr int cost(int) { return 1; }
template <class E, class = decltype(declval<E>().cost)>
constexpr auto cost(E const& e) { return e.cost; }
template <class E> using cost_t = decltype(cost(declval<E>()));
#endif
vector<cost_t<edge>> dijkstra(vector<vector<edge>> const& g, int s, cost_t<edge> inf) {
    rep (x, g.size()) {
        for (auto const& e : g[x]) {
            assert(cost(e) >= 0);
        }
    }

    vector<cost_t<edge>> d(g.size(), inf);
    pque_min<pair<cost_t<edge>, int>> q;
    d[s] = 0;
    q.emplace(0, s);
    while (q.size()) {
        auto p = q.top(); q.pop();
        const int x = p.snd;
        if (d[x] < p.fst) continue;
        for (auto const& e : g[x]) {
            const int y = dest(e);
            if (chmin(d[y], d[x] + cost(e))) {
                q.emplace(d[y], y);
            }
        }
    }
    return d;
}
// <<<

int32_t main() {
    int n, m; cin >> n >> m;
    vector<pair<int, int>> es;
    rep (i, m) {
        int x, y; cin >> x >> y; --x, --y;
        es.eb(x, y);
    }
    auto a = make_v<int, 2>(2, n); cin >> a;

    UnionFind uf(2*n);
    for (auto [x, y] : es) {
        uf.unite(x, y+n);
        uf.unite(y, x+n);
    }
    if (not uf.same(0, n)) {
        say("2");
        int ma = 0;
        rep (p, 2) {
            swap(a[0], a[1]);
            int sum = 0;
            rep (x, n) sum += a[uf.same(0, x)][x];
            chmax(ma, sum);
        }
        cout << ma << '\n';
        return 0;
    }

    vector<int> c(2*n);
    rep (p, 2) rep (x, n) c[x+n*p] = max(a[0][x], a[1][x]) - a[p][x];
    dump(c);

    vector<vector<edge>> g(2*n);
    for (auto [x, y] : es) {
        rep (p, 2) {
            int q = p^1;
            g[x+p*n].pb({y+q*n, c[y+q*n]});
            g[y+p*n].pb({x+q*n, c[x+q*n]});
        }
    }

    int sum = 0;
    rep (x, n) sum += max(a[0][x], a[1][x]);
    dump(sum);

    int ma = 0;
    rep (p, 2) rep (x, n) {
        auto d = dijkstra(g, x+p*n, INF);
        int q = p^1;
        dump(x, d[x+q*n]);
        chmax(ma, sum - d[x+q*n]);
    }
    cout << ma << '\n';
}

yukicoder

結果

テストケース

ソースコード