Submit Info #48096

Problem Lang User Status Time Memory
Assignment Problem cpp NhatMinh0208 AC 473 ms 4.61 MiB

ケース詳細
Name Status Time Memory
example_00 AC 2 ms 0.68 MiB
hand_minus_00 AC 469 ms 4.61 MiB
hand_plus_00 AC 473 ms 4.36 MiB
max_random_00 AC 68 ms 4.55 MiB
max_random_01 AC 59 ms 4.55 MiB
max_random_02 AC 57 ms 4.55 MiB
max_random_03 AC 71 ms 4.55 MiB
max_random_04 AC 65 ms 4.55 MiB
random_00 AC 7 ms 1.68 MiB
random_01 AC 8 ms 1.80 MiB
random_02 AC 2 ms 1.07 MiB
random_03 AC 10 ms 1.71 MiB
random_04 AC 2 ms 0.80 MiB

/* Hungarian assignment algorithm. Given a (n,m) bipartite weighted graph (n<=m), the algorithm finds the min-cost matching from left to right in O(n^2*m). Tested with library-checker (https://judge.yosupo.jp/problem/assignment) */ // Standard library in one include. #include <bits/stdc++.h> using namespace std; // ordered_set library. #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update> // AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.) //#include <atcoder/all> //using namespace atcoder; //Pragmas (Comment out these three lines if you're submitting in szkopul.) #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") //File I/O. #define FILE_IN "cseq.inp" #define FILE_OUT "cseq.out" #define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout) //Fast I/O. #define fio ios::sync_with_stdio(0);cin.tie(0) #define nfio cin.tie(0) #define endl "\n" //Order checking. #define ord(a,b,c) ((a>=b)and(b>=c)) //min/max redefines, so i dont have to resolve annoying compile errors. #define min(a,b) (((a)<(b))?(a):(b)) #define max(a,b) (((a)>(b))?(a):(b)) // Fast min/max assigns to use with AVX. // Requires g++ 9.2.0. template<typename T> __attribute__((always_inline)) void chkmin(T& a, const T& b) { a=(a<b)?a:b; } template<typename T> __attribute__((always_inline)) void chkmax(T& a, const T& b) { a=(a>b)?a:b; } //Constants. #define MOD (ll(998244353)) #define MAX 300001 #define mag 320 const long double PI=3.14159265358979; //Pairs and 3-pairs. #define p1 first #define p2 second.first #define p3 second.second #define fi first #define se second #define pii(element_type) pair<element_type,element_type> #define piii(element_type) pair<element_type,pii(element_type)> //Quick power of 2. #define pow2(x) (ll(1)<<x) //Short for-loops. #define ff(i,__,___) for(int i=__;i<=___;i++) #define rr(i,__,___) for(int i=__;i>=___;i--) //Typedefs. #define bi BigInt typedef long long ll; typedef long double ld; typedef short sh; // Binpow and stuff ll BOW(ll a, ll x, ll p) { if (!x) return 1; ll res=BOW(a,x/2,p); res*=res; res%=p; if (x%2) res*=a; return res%p; } ll INV(ll a, ll p) { return BOW(a,p-2,p); } //---------END-------// vector<int> vec; ll n,m,i,j,k,t,t1,u,v,a,b; ll cost[2001][2001]; ll res[2001]; ll HungarianAssignment() { ll i,j,i0,j0,i1,j1,d; n++; m++; vector<ll> u(n),v(m),p(m); for (i=1;i<n;i++) { p[0]=i; ll j0=0; vector<ll> dis(m,1e9+7),pre(m,-1); vector<int> used(m+1); do { used[j0]=1; ll i0=p[j0],j1,d=1e9+7; for (j=1;j<m;j++) if (!used[j]) { auto cur=cost[i0-1][j-1]-u[i0]-v[j]; if (cur<dis[j]) dis[j]=cur,pre[j]=j0; if (dis[j]<d) d=dis[j],j1=j; } for (j=0;j<m;j++) { if (used[j]) u[p[j]]+=d,v[j]-=d; else dis[j]-=d; } j0=j1; } while (p[j0]); while(j0) { j1=pre[j0]; p[j0]=p[j1],j0=j1; } } for (j=1;j<m;j++) if (p[j]) res[p[j]-1]=j-1; n--; m--; return -v[0]; } // Example problem follows. // Source: https://judge.yosupo.jp/problem/assignment int main() { fio; cin>>n; m=n; for (i=0;i<n;i++) for (j=0;j<n;j++) cin>>cost[i][j]; cout<<HungarianAssignment()<<endl; for (i=0;i<n;i++) cout<<res[i]<<' '; }