結果

問題 No.1911 Alternately Coloring
ユーザー rniyarniya
提出日時 2022-04-22 23:05:24
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 458 ms / 4,000 ms
コード長 7,316 bytes
コンパイル時間 2,579 ms
コンパイル使用メモリ 222,376 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-09-06 09:49:27
合計ジャッジ時間 11,660 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 394 ms
4,376 KB
testcase_07 AC 409 ms
4,380 KB
testcase_08 AC 336 ms
4,376 KB
testcase_09 AC 451 ms
4,380 KB
testcase_10 AC 458 ms
4,380 KB
testcase_11 AC 440 ms
4,380 KB
testcase_12 AC 421 ms
4,380 KB
testcase_13 AC 340 ms
4,376 KB
testcase_14 AC 297 ms
4,376 KB
testcase_15 AC 426 ms
4,376 KB
testcase_16 AC 420 ms
4,376 KB
testcase_17 AC 436 ms
4,376 KB
testcase_18 AC 296 ms
4,380 KB
testcase_19 AC 338 ms
4,376 KB
testcase_20 AC 375 ms
4,376 KB
testcase_21 AC 173 ms
4,376 KB
testcase_22 AC 455 ms
4,380 KB
testcase_23 AC 431 ms
4,376 KB
testcase_24 AC 2 ms
4,380 KB
testcase_25 AC 2 ms
4,380 KB
testcase_26 AC 2 ms
4,376 KB
testcase_27 AC 414 ms
4,376 KB
testcase_28 AC 126 ms
4,380 KB
testcase_29 AC 330 ms
4,376 KB
testcase_30 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}
template <typename T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) {
    for (size_t i = 0; i < N; i++) {
        os << v[i] << (i + 1 == N ? "" : " ");
    }
    return os;
}

template <int i, typename T> void print_tuple(ostream&, const T&) {}
template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {
    if (i) os << ',';
    os << get<i>(t);
    print_tuple<i + 1, T, Args...>(os, t);
}
template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    os << '{';
    print_tuple<0, tuple<Args...>, Args...>(os, t);
    return os << '}';
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) void(0)
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

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

template <typename T> void mkuni(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    vector<int> u(M), v(M), R(N), B(N);
    vector<vector<pair<int, int>>> G(N);
    for (int i = 0; i < M; i++) {
        cin >> u[i] >> v[i];
        u[i]--, v[i]--;
        G[u[i]].emplace_back(v[i], i);
        G[v[i]].emplace_back(u[i], i);
    }
    cin >> R >> B;

    ll ans = 0;
    vector<int> color(N, -1);
    bool bipar = true;
    auto dfs = [&](auto self, int v, int c) -> void {
        color[v] = c;
        if (!bipar) return;
        for (auto& e : G[v]) {
            int u = e.first;
            if (color[u] < 0)
                self(self, u, c ^ 1);
            else if (color[u] == color[v]) {
                bipar = false;
                return;
            }
        }
    };
    dfs(dfs, 0, 0);
    if (bipar) {
        for (int _ = 0; _ < 2; _++) {
            ll sum = 0;
            for (int i = 0; i < N; i++) sum += (color[i] == 0 ? R[i] : B[i]);
            chmax(ans, sum);
            swap(R, B);
        }
        cout << ans << '\n';
        return 0;
    }

    ll tot = 0;
    for (int i = 0; i < N; i++) tot += max(R[i], B[i]);
    auto cost = [&](int v, int i) { return max(R[v], B[v]) - (i == 0 ? R[v] : B[v]); };
    ll Min = IINF;
    auto dijkstra = [&](int idx) {
        for (int _ = 0; _ < 2; _++) {
            vector<vector<ll>> dp(N, vector<ll>(2, IINF));
            priority_queue<tuple<ll, int, int>> pq;
            dp[u[idx]][0] = cost(u[idx], 0);
            pq.emplace(-dp[u[idx]][0], u[idx], 0);
            while (!pq.empty()) {
                auto t = pq.top();
                pq.pop();
                ll d;
                int x, c;
                tie(d, x, c) = t;
                d *= -1;
                for (auto& e : G[x]) {
                    if (idx == e.second) continue;
                    int y = e.first;
                    if (chmin(dp[y][c ^ 1], d + cost(y, c ^ 1))) pq.emplace(-dp[y][c ^ 1], y, c ^ 1);
                }
            }
            chmin(Min, dp[v[idx]][0]);
            swap(R, B);
        }
    };
    for (int i = 0; i < M; i++) dijkstra(i);

    cout << tot - Min << '\n';
    return 0;
}
0