Submission #3665478


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
const int M = 1000000007;

struct edge {
    int to, cap;
    int cost;
    int rev;
};

int V = 5010;
vector<edge> G[5010];
int h[5010];
int dist[5010];
int prevv[5010], preve[5010];
void add_edge(int from, int to, int cap, int cost) {
    G[from].push_back((edge){ to, cap, cost, (int)G[to].size() });
    G[to].push_back((edge){ from, 0, -cost, (int)G[from].size() - 1 });
}

int min_cost_flow(int s, int t, int f) {
    int res = 0;
    fill(h, h + V, 0);
    while (f > 0) {
        priority_queue<P, vector<P>, greater<P> > q;
        fill(dist, dist + V, M);
        dist[s] = 0;
        q.push(P(0, s));
        while (!q.empty()) {
            P p = q.top();
            q.pop();
            int v = p.second;
            if (dist[v] < p.first) continue;
            for (int i = 0; i < (int)G[v].size(); ++i) {
                edge &e = G[v][i];
                if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {
                    dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];
                    prevv[e.to] = v;
                    preve[e.to] = i;
                    q.push(P(dist[e.to], e.to));
                }
            }
        }
        if (dist[t] == M) return res;
        for (int v = 0; v < V; ++v)
            h[v] += dist[v];

        int d = f;
        for (int v = t; v != s; v = prevv[v])
            d = min(d, G[prevv[v]][preve[v]].cap);

        f -= d;
        res += d * h[t];
        for (int v = t; v != s; v = prevv[v]) {
            edge &e = G[prevv[v]][preve[v]];
            e.cap -= d;
            G[v][e.rev].cap += d;
        }
    }
    return res;
}


int main() {
    int n, k;
    cin >> n >> k;
    vector<int> cnt(n);
    int sum = 0;
    int S = 5001, T = 5002;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        --a[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> b[i];
        --b[i];
    }
    for (int i = 0; i < n; ++i) {
        if (a[i] != b[i]) {
            add_edge(max(a[i], b[i]), min(a[i], b[i]), 1, abs(a[i] - b[i]));
        }
        ++cnt[max(a[i], b[i])];
        sum += max(a[i], b[i]) + 1;
    }
    int c = 0;
    for (int i = 0; i < n; ++i) {
        if (cnt[i] > 0) ++c;
    }
    if (c >= k) {
        cout << sum << "\n";
        return 0;
    }
    k -= c;

    for (int i = 0; i < n; ++i) {
        if (cnt[i] == 2) {
            add_edge(S, i, 1, 0);
        }
        if (cnt[i] == 0) {
            add_edge(i, T, 1, 0);
        }
    }
    cout << sum - min_cost_flow(S, T, k) << "\n";
    return 0;
}

Submission Info

Submission Time
Task G - Sum of Cards
User riantkb
Language C++14 (GCC 5.4.1)
Score 500
Code Size 2628 Byte
Status AC
Exec Time 976 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 43
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 1 ms 384 KB
02.txt AC 1 ms 384 KB
03.txt AC 1 ms 384 KB
04.txt AC 1 ms 384 KB
05.txt AC 1 ms 384 KB
06.txt AC 1 ms 384 KB
07.txt AC 4 ms 384 KB
08.txt AC 1 ms 384 KB
09.txt AC 1 ms 384 KB
10.txt AC 2 ms 384 KB
11.txt AC 1 ms 384 KB
12.txt AC 2 ms 384 KB
13.txt AC 1 ms 384 KB
14.txt AC 3 ms 384 KB
15.txt AC 2 ms 384 KB
16.txt AC 4 ms 640 KB
17.txt AC 468 ms 896 KB
18.txt AC 4 ms 640 KB
19.txt AC 626 ms 1024 KB
20.txt AC 976 ms 1024 KB
21.txt AC 4 ms 640 KB
22.txt AC 4 ms 640 KB
23.txt AC 4 ms 768 KB
24.txt AC 4 ms 640 KB
25.txt AC 703 ms 1024 KB
26.txt AC 853 ms 1024 KB
27.txt AC 4 ms 768 KB
28.txt AC 4 ms 640 KB
29.txt AC 4 ms 768 KB
30.txt AC 4 ms 768 KB
31.txt AC 4 ms 640 KB
32.txt AC 217 ms 1024 KB
33.txt AC 4 ms 640 KB
34.txt AC 4 ms 640 KB
35.txt AC 4 ms 640 KB
36.txt AC 4 ms 640 KB
37.txt AC 197 ms 896 KB
38.txt AC 925 ms 1024 KB
39.txt AC 4 ms 640 KB
40.txt AC 4 ms 640 KB
s1.txt AC 1 ms 384 KB
s2.txt AC 1 ms 384 KB
s3.txt AC 1 ms 384 KB