結果

問題 No.1911 Alternately Coloring
ユーザー SumitacchanSumitacchan
提出日時 2022-04-22 22:32:46
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 416 ms / 4,000 ms
コード長 4,440 bytes
コンパイル時間 2,617 ms
コンパイル使用メモリ 217,360 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-24 03:50:28
合計ジャッジ時間 9,930 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 3 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 349 ms
6,944 KB
testcase_07 AC 275 ms
6,940 KB
testcase_08 AC 272 ms
6,940 KB
testcase_09 AC 344 ms
6,940 KB
testcase_10 AC 253 ms
6,940 KB
testcase_11 AC 305 ms
6,944 KB
testcase_12 AC 341 ms
6,940 KB
testcase_13 AC 298 ms
6,944 KB
testcase_14 AC 218 ms
6,940 KB
testcase_15 AC 287 ms
6,944 KB
testcase_16 AC 283 ms
6,944 KB
testcase_17 AC 290 ms
6,940 KB
testcase_18 AC 200 ms
6,940 KB
testcase_19 AC 228 ms
6,944 KB
testcase_20 AC 257 ms
6,940 KB
testcase_21 AC 158 ms
6,944 KB
testcase_22 AC 336 ms
6,940 KB
testcase_23 AC 416 ms
6,940 KB
testcase_24 AC 125 ms
6,944 KB
testcase_25 AC 141 ms
6,940 KB
testcase_26 AC 225 ms
6,944 KB
testcase_27 AC 275 ms
6,944 KB
testcase_28 AC 89 ms
6,944 KB
testcase_29 AC 218 ms
6,940 KB
testcase_30 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, (int)v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, (int)m.size()){ REP(j_debug, (int)m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < (int)v.size(); i++) { cout << v[i]; if(i != (int)v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

//const int mod = 1000000007;
const int mod = 998244353;


template<typename T> 
struct edge{ int to; T cost; int id; };

template<typename T = long long>
struct Graph
{

    int N;
    vector<vector<edge<T>>> E;
    vec col;

    Graph(int N): N(N){
        E = vector<vector<edge<T>>>(N, vector<edge<T>>(0));
        col = vec(N, -1);
    }

    void add_Directed_edge(int from, int to, T cost = 1, int id = 0){
        E[from].push_back(edge<T>({ to, cost, id }));
    }

    void add_Undirected_edge(int v1, int v2, T cost = 1, int id = 0){
        add_Directed_edge(v1, v2, cost, id);
        add_Directed_edge(v2, v1, cost, id);
    }

        vector<T> dijkstra(int s, T T_INF = INF){
        using PTi = pair<T, int>;

        vector<T> d(N);
        priority_queue<PTi, vector<PTi>, greater<PTi>> que;
        fill(d.begin(), d.end(), T_INF);
        d[s] = 0;
        que.push(PTi(0, s));

        while(!que.empty()){
            PTi p = que.top(); que.pop();
            int v = p.second;
            if(d[v] < p.first) continue;

            for(auto e: E[v]){
                if(d[e.to] > d[v] + e.cost){
                    d[e.to] = d[v] + e.cost;
                    que.push(PTi(d[e.to], e.to));
                }
            }
        }
        return d;
    }

    void dfs(int v, int c = 0){
        col[v] = c;
        for(auto e: E[v]) if(col[e.to] == -1) dfs(e.to, c ^ 1);
    }

};

signed main(){

    int N, M; cin >> N >> M;
    vec u(M), v(M);
    REP(i, M){
        cin >> u[i] >> v[i];
        u[i]--; v[i]--;
    }
    vec R(N), B(N); cin >> R >> B;

    Graph G(2 * N);
    REP(i, M){
        REP(_, 2){
            G.add_Directed_edge(u[i], v[i] + N, max(0LL, R[v[i]] - B[v[i]]));
            G.add_Directed_edge(u[i] + N, v[i], max(0LL, B[v[i]] - R[v[i]]));
            swap(u[i], v[i]);
        }
    }
    int MM = INF;
    REP(i, N){
        chmin(MM, G.dijkstra(i)[i + N]);
        chmin(MM, G.dijkstra(i + N)[i]);
    }
    int ans = 0;
    if(MM < INF){
        REP(i, N) ans += max(R[i], B[i]);
        ans -= MM;
    }else{
        Graph G2(N);
        REP(i, M) G2.add_Undirected_edge(u[i], v[i]);
        G2.dfs(0);
        REP(k, 2){
            int t = 0;
            REP(i, N){
                if(G2.col[i] == k) t += R[i];
                else t += B[i];
            }
            chmax(ans, t);
        }
    }
    Out(ans);

    return 0;
}
0