結果

問題 No.1324 Approximate the Matrix
ユーザー milanis48663220
提出日時 2020-12-21 01:11:50
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 726 ms / 2,000 ms
コード長 3,955 bytes
コンパイル時間 945 ms
コンパイル使用メモリ 103,936 KB
最終ジャッジ日時 2025-01-17 05:22:05
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 42
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In member function ‘void MinCostFlow::add_edge(int, int, ll, ll)’:
main.cpp:39:63: warning: narrowing conversion of ‘(&((MinCostFlow*)this)->MinCostFlow::G.std::vector<std::vector<edge> >::operator[](((std::vector<std::vector<edge> >::size_type)to)))->std::vector<edge>::size()’ from ‘std::vector<edge>::size_type’ {aka ‘long unsigned int’} to ‘int’ [-Wnarrowing]
   39 |             G[from].push_back((edge){to, cap, cost, G[to].size()});
      |                                                     ~~~~~~~~~~^~
main.cpp:40:66: warning: narrowing conversion of ‘((&((MinCostFlow*)this)->MinCostFlow::G.std::vector<std::vector<edge> >::operator[](((std::vector<std::vector<edge> >::size_type)from)))->std::vector<edge>::size() - 1)’ from ‘std::vector<edge>::size_type’ {aka ‘long unsigned int’} to ‘int’ [-Wnarrowing]
   40 |             G[to].push_back((edge){from, 0, -cost, G[from].size()-1});
      |                                                    ~~~~~~~~~~~~~~^~

ソースコード

diff # 

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

const ll INF = 1e18;

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

class MinCostFlow{
    public:
        int V;  // 頂点数
        vector<vector<edge>> G;
        MinCostFlow(int v){
            V = v;
            G = vector<vector<edge>>(v, vector<edge>());
            dist = vector<ll>(v);
            preve = vector<int>(v);
            prevv = vector<int>(v);
        }
        void add_edge(int from, int to, ll cap, ll cost){
            G[from].push_back((edge){to, cap, cost, G[to].size()});
            G[to].push_back((edge){from, 0, -cost, G[from].size()-1});
        }

        ll min_cost_flow(int s, int t, int f){
            ll res = 0;
            while(f > 0){
                fill(dist.begin(), dist.end(), INF);
                dist[s] = 0;
                bool update = true;
                while(update){
                    update = false;
                    for(int v = 0; v < V; v++){
                        if(dist[v] == INF) continue;
                        for(int i = 0; i < G[v].size(); i++){
                            edge &e = G[v][i];
                            if(e.cap > 0 && dist[e.to] > dist[v]+e.cost){
                                dist[e.to] = dist[v]+e.cost;
                                prevv[e.to] = v;
                                preve[e.to] = i;
                                update = true;
                            }
                        }
                    }
                }
                if(dist[t] == INF){
                    return -1;
                }
                ll d = f;
                for(int v = t; v != s; v = prevv[v]){
                    d = min(d, G[prevv[v]][preve[v]].cap);
                }
                f -= d;
                res += d*dist[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;
        }

    private:
        vector<ll> dist;
        vector<int> prevv, preve;
};

int n, k;

int row_idx(int i){
    return 1+i;
}

int col_idx(int i){
    return 1+n+n*n+i;
}

int elm_idx(int i, int j){
    return 1+n+n*i+j;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> n >> k;
    vector<int> a(n), b(n);
    vector<vector<int>> p(n, vector<int>(n));
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++) cin >> b[i];
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cin >> p[i][j];
        }
    }
    int m = 2+2*n+n*n;
    int s = 0, t = m-1;
    MinCostFlow mcf(m);
    for(int i = 0; i < n; i++){
        mcf.add_edge(s, row_idx(i), a[i], 0);
    }
    for(int i = 0; i < n; i++){
        mcf.add_edge(col_idx(i), t, b[i], 0);
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            int k_min = min(a[i], b[j]);
            for(int k = 1; k <= k_min; k++){
                mcf.add_edge(row_idx(i), elm_idx(i, j), 1, 2*(k-p[i][j])-1);
                mcf.add_edge(elm_idx(i, j), col_idx(j), 1, 0);
            }
        }
    }
    int ans = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            ans += p[i][j]*p[i][j];
        }
    }
    cout << ans+mcf.min_cost_flow(s, t, k) << endl;
}
0