#include #include #define rep(i,b) for(int i=0;i=0;i--) #define rep1(i,b) for(int i=1;i=x;i--) #define fore(i,a) for(auto& i:a) #define rng(x) (x).begin(), (x).end() #define rrng(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define pb push_back #define fi first #define se second #define pcnt __builtin_popcountll using namespace std; using namespace atcoder; using ll = long long; using ld = long double; template using mpq = priority_queue, greater>; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (b ll sumv(const vector&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}} #define dame { cout << "No" << endl; return;} #define dame1 { cout << -1 << endl; return;} #define cout2(x,y) cout << x << " " << y << endl; #define coutp(p) cout << p.fi << " " << p.se << endl; #define out cout << ans << endl; #define outd cout << fixed << setprecision(20) << ans << endl; #define outm cout << ans.val() << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define outdv fore(yans , ans) cout << yans.val() << "\n"; #define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;} #define coutv2(v) fore(vy , v) cout << vy << "\n"; #define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;} #define coutvm2(v) fore(vy , v) cout << vy.val() << "\n"; using pll = pair;using pil = pair;using pli = pair;using pii = pair;using pdd = pair; using tp = tuple; using vi = vector;using vd = vector;using vl = vector;using vs = vector;using vb = vector; using vpii = vector;using vpli = vector;using vpll = vector;using vpil = vector; using vvi = vector>;using vvl = vector>;using vvs = vector>;using vvb = vector>; using vvpii = vector>;using vvpli = vector>;using vvpll = vector;using vvpil = vector; using mint = modint998244353; //using mint = modint1000000007; //using mint = dynamic_modint<0>; using vm = vector; using vvm = vector>; vector dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} #define yes {cout <<"Yes"<>n>>s>>t; vi e(s),r(t); map mp; rep(i,s) cin>>e[i],e[i]--; rep(i,t) cin>>r[i],r[i]--; vvl c(n,vl(n)); rep(i,n) rep(j,n) cin>>c[i][j]; rep(i,s) mp[e[i]] = 0; rep(i,t) mp[r[i]] = 0; vi v; rep(i,n) if (mp.count(i)==0){ v.pb(i); } ll ans = 0; rep(i,s) repx(j,i+1,s) ans += c[e[i]][e[j]]; rep(i,t) repx(j,i+1,t) ans += c[r[i]][r[j]]; int k = sz(v); mf_graph mg(n+k*(k-1)+2); int st = n+k*(k-1); int go = st+1; rep(i,n){ mg.add_edge(st,i,0); mg.add_edge(i,go,0); } rep(i,k){ ll tmp = 0; rep(j,s) tmp += c[v[i]][e[j]]; ans += tmp; mg.add_edge(st,v[i],tmp); tmp = 0; rep(j,t) tmp += c[v[i]][r[j]]; ans += tmp; mg.add_edge(v[i],go,tmp); } int now = n; rep(i,k) repx(j,i+1,k){ ll cost = c[v[i]][v[j]]; ans += cost*2; mg.add_edge(st,now,cost); mg.add_edge(now,v[i],LINF); mg.add_edge(now,v[j],LINF); now++; mg.add_edge(now,go,cost); mg.add_edge(v[i],now,LINF); mg.add_edge(v[j],now,LINF); } ll lost = mg.flow(st,go); show(lost); ans -= lost; out; return; } int main(){ ios::sync_with_stdio(false); cin.tie(0); int t = 1; //cin>>t; rep(i,t){ solve(); } return 0; }