結果

問題 No.798 コレクション
ユーザー kyort0n
提出日時 2019-03-15 22:33:43
言語 C++11
(gcc 4.8.5)
結果
TLE  
実行時間 -
コード長 3,450 Byte
コンパイル時間 1,590 ms
使用メモリ 94,748 KB
最終ジャッジ日時 2019-03-15 22:33:49

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
000_sample_1 AC 4 ms
1,660 KB
000_sample_2 AC 3 ms
1,660 KB
000_sample_3 AC 4 ms
1,664 KB
001_rand_1 AC 4 ms
1,664 KB
001_rand_2 AC 4 ms
1,660 KB
001_rand_3 AC 4 ms
1,664 KB
001_rand_4 AC 4 ms
1,660 KB
001_rand_5 AC 4 ms
1,668 KB
001_rand_6 AC 4 ms
1,668 KB
001_rand_7 AC 4 ms
1,664 KB
001_rand_8 AC 4 ms
1,668 KB
001_rand_9 AC 4 ms
1,668 KB
001_rand_10 AC 4 ms
1,664 KB
002_rand_1 TLE -
002_rand_2 -- -
002_rand_3 -- -
002_rand_4 -- -
002_rand_5 -- -
002_rand_6 -- -
002_rand_7 -- -
002_rand_8 -- -
002_rand_9 -- -
002_rand_10 -- -
100_hand_1 -- -
100_hand_2 -- -
100_hand_3 -- -
テストケース一括ダウンロード

ソースコード

diff #
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;

#define EPS (1e-7)
//#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;

template< typename flow_t, typename cost_t >
struct PrimalDual {
    const cost_t INF;

    struct edge {
        int to;
        flow_t cap;
        cost_t cost;
        int rev;
        bool isrev;
    };
    vector< vector< edge > > graph;
    vector< cost_t > potential, min_cost;
    vector< int > prevv, preve;

    PrimalDual(int V) : graph(V), INF(numeric_limits< cost_t >::max()) {}

    void add_edge(int from, int to, flow_t cap, cost_t cost) {
        graph[from].emplace_back((edge) {to, cap, cost, (int) graph[to].size(), false});
        graph[to].emplace_back((edge) {from, 0, -cost, (int) graph[from].size() - 1, true});
    }

    cost_t min_cost_flow(int s, int t, flow_t f) {
        int V = (int) graph.size();
        cost_t ret = 0;
        using Pi = pair< cost_t, int >;
        priority_queue< Pi, vector< Pi >, greater< Pi > > que;
        potential.assign(V, 0);
        preve.assign(V, -1);
        prevv.assign(V, -1);

        while(f > 0) {
            min_cost.assign(V, INF);
            que.emplace(0, s);
            min_cost[s] = 0;
            while(!que.empty()) {
                Pi p = que.top();
                que.pop();
                if(min_cost[p.second] < p.first) continue;
                for(int i = 0; i < graph[p.second].size(); i++) {
                    edge &e = graph[p.second][i];
                    cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];
                    if(e.cap > 0 && min_cost[e.to] > nextCost) {
                        min_cost[e.to] = nextCost;
                        prevv[e.to] = p.second, preve[e.to] = i;
                        que.emplace(min_cost[e.to], e.to);
                    }
                }
            }
            if(min_cost[t] == INF) return -1;
            for(int v = 0; v < V; v++) potential[v] += min_cost[v];
            flow_t addflow = f;
            for(int v = t; v != s; v = prevv[v]) {
                addflow = min(addflow, graph[prevv[v]][preve[v]].cap);
            }
            f -= addflow;
            ret += addflow * potential[t];
            for(int v = t; v != s; v = prevv[v]) {
                edge &e = graph[prevv[v]][preve[v]];
                e.cap -= addflow;
                graph[v][e.rev].cap += addflow;
            }
       }
       return ret;
    }

    void output() {
        for(int i = 0; i < graph.size(); i++) {
            for(auto &e : graph[i]) {
                if(e.isrev) continue;
                auto &rev_e = graph[e.to][e.rev];
                cout << i << "->" << e.to << " (flow: " << rev_e.cap << "/" << rev_e.cap + e.cap << ")" << endl;
            }
        }
    }
};

int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    ll MAX_DAY = n - n / 3;
    PrimalDual<ll, ll> field(4e3+2);
    for(ll day = 0; day < MAX_DAY; day++) {
        field.add_edge(0, 1 + day, 1, 0);
    }
    for(ll item = 1; item <= n; item++) {
        ll a, b;
        cin >> a >> b;
        for(ll day = 0; day <= MAX_DAY; day++) {
            field.add_edge(1+day, 2e3+item, 1, a+b*day);
        }
        field.add_edge(2e3+item, 4e3+1, 1, 0);
    }
    cout << field.min_cost_flow(0, 4e3+1, MAX_DAY) << endl;
    return 0;
}
0