結果

問題 No.1582 Vertexes vs Edges
ユーザー yuto1115yuto1115
提出日時 2021-07-02 21:49:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 133 ms / 2,000 ms
コード長 6,964 bytes
コンパイル時間 2,503 ms
コンパイル使用メモリ 216,260 KB
実行使用メモリ 19,440 KB
最終ジャッジ日時 2023-09-11 21:40:41
合計ジャッジ時間 5,889 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 3 ms
4,380 KB
testcase_05 AC 56 ms
17,180 KB
testcase_06 AC 4 ms
4,376 KB
testcase_07 AC 9 ms
5,296 KB
testcase_08 AC 28 ms
10,060 KB
testcase_09 AC 53 ms
16,208 KB
testcase_10 AC 32 ms
11,348 KB
testcase_11 AC 5 ms
4,380 KB
testcase_12 AC 23 ms
8,784 KB
testcase_13 AC 60 ms
12,060 KB
testcase_14 AC 58 ms
12,252 KB
testcase_15 AC 84 ms
15,576 KB
testcase_16 AC 38 ms
9,492 KB
testcase_17 AC 55 ms
11,932 KB
testcase_18 AC 103 ms
18,276 KB
testcase_19 AC 50 ms
12,808 KB
testcase_20 AC 51 ms
11,292 KB
testcase_21 AC 50 ms
10,636 KB
testcase_22 AC 83 ms
16,476 KB
testcase_23 AC 31 ms
8,004 KB
testcase_24 AC 16 ms
5,708 KB
testcase_25 AC 46 ms
10,332 KB
testcase_26 AC 36 ms
8,800 KB
testcase_27 AC 84 ms
15,512 KB
testcase_28 AC 25 ms
6,984 KB
testcase_29 AC 71 ms
13,704 KB
testcase_30 AC 44 ms
9,648 KB
testcase_31 AC 78 ms
13,952 KB
testcase_32 AC 28 ms
7,848 KB
testcase_33 AC 129 ms
19,440 KB
testcase_34 AC 127 ms
19,352 KB
testcase_35 AC 133 ms
19,348 KB
testcase_36 AC 1 ms
4,380 KB
testcase_37 AC 1 ms
4,376 KB
testcase_38 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(i, n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i, s, n, d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(i, n) for (ll i = ll(n)-1; i >= 0; i--)
#define rrep2(i, n, t) for (ll i = ll(n)-1; i >= (ll)t; i--)
#define rrep3(i, n, t, d) for (ll i = ll(n)-1; i >= (ll)t; i-=d)
#define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define SUM(a) accumulate(all(a),0LL)
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define popcount(x) __builtin_popcountll(x)
#define pb push_back
#define eb emplace_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using LP = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vp = vector<P>;
using vvp = vector<vp>;

template<class S, class T>
istream &operator>>(istream &is, pair<S, T> &p) { return is >> p.first >> p.second; }

template<class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << '{' << p.first << ", " << p.second << '}'; }

template<class S, class T, class U>
istream &operator>>(istream &is, tuple<S, T, U> &t) { return is >> get<0>(t) >> get<1>(t) >> get<2>(t); }

template<class S, class T, class U>
ostream &operator<<(ostream &os, const tuple<S, T, U> &t) {
    return os << '{' << get<0>(t) << ", " << get<1>(t) << ", " << get<2>(t) << '}';
}

template<class T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &t:v) { is >> t; }
    return is;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '[';
    rep(i, v.size())os << v[i] << (i == int(v.size() - 1) ? "" : ", ");
    return os << ']';
}

template<class T>
void vecout(const vector<T> &v, char div = '\n') {
    rep(i, v.size()) cout << v[i] << (i == int(v.size() - 1) ? '\n' : div);
}

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

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

void scan() {}

template<class Head, class... Tail>
void scan(Head &head, Tail &... tail) {
    cin >> head;
    scan(tail...);
}

template<class T>
void print(const T &t) { cout << t << '\n'; }

template<class Head, class... Tail>
void print(const Head &head, const Tail &... tail) {
    cout << head << ' ';
    print(tail...);
}

template<class... T>
void fin(const T &... a) {
    print(a...);
    exit(0);
}

struct Init_io {
    Init_io() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        cout << boolalpha << fixed << setprecision(15);
        cerr << boolalpha << fixed << setprecision(15);
    }
} init_io;

const string yes[] = {"no", "yes"};
const string Yes[] = {"No", "Yes"};
const string YES[] = {"NO", "YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;

template<class T, class S>
vector<T> cumsum(const vector<S> &v, bool shift_one = true) {
    int n = v.size();
    vector<T> res;
    if (shift_one) {
        res.resize(n + 1);
        rep(i, n) res[i + 1] = res[i] + v[i];
    } else {
        res.resize(n);
        if (n) {
            res[0] = v[0];
            rep(i, 1, n) res[i] = res[i - 1] + v[i];
        }
    }
    return res;
}

vvi graph(int n, int m, bool directed = false, int origin = 1) {
    vvi G(n);
    rep(_, m) {
        INT(u, v);
        u -= origin, v -= origin;
        G[u].pb(v);
        if (!directed) G[v].pb(u);
    }
    return G;
}

template<class T>
vector<vector<pair<int, T>>> weighted_graph(int n, int m, bool directed = false, int origin = 1) {
    vector<vector<pair<int, T>>> G(n);
    rep(_, m) {
        int u, v;
        T w;
        scan(u, v, w);
        u -= origin, v -= origin;
        G[u].eb(v, w);
        if (!directed) G[v].eb(u, w);
    }
    return G;
}

template<typename T>
class dinic {
    struct edge {
        int to, rev;
        T cap;
        
        edge(int to, T cap, int rev) : to(to), cap(cap), rev(rev) {}
    };
    
    int n;
    vector<vector<edge>> G;
    vi level, iter;
    
    void bfs(int s) {
        level.assign(n, -1);
        queue<int> q;
        level[s] = 0;
        q.push(s);
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            for (auto &e : G[v]) {
                if (e.cap > 0 && level[e.to] < 0) {
                    level[e.to] = level[v] + 1;
                    q.push(e.to);
                }
            }
        }
    }
    
    T dfs(int v, int t, T f) {
        if (v == t) return f;
        for (int &i = iter[v]; i < G[v].size(); i++) {
            auto &e = G[v][i];
            if (e.cap > 0 && level[v] < level[e.to]) {
                T d = dfs(e.to, t, min(f, e.cap));
                if (d > 0) {
                    e.cap -= d;
                    G[e.to][e.rev].cap += d;
                    return d;
                }
            }
        }
        return 0;
    }

public:
    explicit dinic(int n) : n(n), G(n), level(n), iter(n) {}
    
    void add_edge(int from, int to, T cap) {
        G[from].eb(to, cap, G[to].size());
        G[to].eb(from, 0, G[from].size() - 1);
    }
    
    // O(|E||V|^2)
    T max_flow(int s, int t) {
        T fl = 0;
        while (true) {
            bfs(s);
            if (level[t] < 0) return fl;
            iter.assign(n, 0);
            T f;
            while ((f = dfs(s, t, inf)) > 0) fl += f;
        }
    }
};

int main() {
    INT(n);
    vvi G = graph(n, n - 1);
    vi a, b;
    auto dfs = [&](auto &dfs, int u, int p, int d) -> void {
        if (d % 2 == 0) a.pb(u);
        else b.pb(u);
        for (int v : G[u]) {
            if (v == p) continue;
            dfs(dfs, v, u, d + 1);
        }
    };
    dfs(dfs, 0, -1, 0);
    dinic<int> fl(n + 2);
    int s = n, t = n + 1;
    for (int i : a) {
        fl.add_edge(s, i, 1);
        for (int j : G[i]) fl.add_edge(i, j, 1);
    }
    for (int i : b) fl.add_edge(i, t, 1);
    print(fl.max_flow(s, t));
}
0