题目链接:https://www.nowcoder.com/acm/contest/143/E
思路:要让搬寝室的人最少,也就是要让住在原寝室的人最多,所以要确定的就是现在的寝室和原来哪个寝室匹配,只要跑个最大权匹配就行了,km模板。
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(998244353)
#define pb push_back
#define eps 1e-6
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define PP pair<int,pair<int,int>>
#define P pair<int,int>
#define pi acos(-1)
const int N=1e2+8;
int w[N][N],x[N],y[N],pop,a[N][4],b[N][4],n;
int px[N],py[N],sy[N],slack[N],par[N];
void adjust(int v)
{
sy[v]=py[v];
if(px[sy[v]]!=-2) adjust(px[sy[v]]);
}
bool fid(int v)
{
FOR(i,0,pop-1)
if(py[i]==-1)
{
if(slack[i]>x[v]+y[i]-w[v][i])
slack[i]=x[v]+y[i]-w[v][i],par[i]=v;
if(x[v]+y[i]==w[v][i])
{
py[i]=v;
if(sy[i]==-1) {adjust(i);return 1;}
if(px[sy[i]]!=-1) continue;
px[sy[i]]=i;
if(fid(sy[i])) return 1;
}
}
return 0;
}
int km()
{
FOR(i,0,pop-1) sy[i]=-1,y[i]=0;
FOR(i,0,pop-1)
{
x[i]=0;
FOR(j,0,pop-1)
x[i]=max(x[i],w[i][j]);
}
int flag,m;
FOR(i,0,pop-1)
{
FOR(j,0,pop-1)
px[j]=py[j]=-1,slack[j]=inf;
px[i]=-2;
if(fid(i)) continue;
flag=0;
while(!flag)
{
m=inf;
FOR(j,0,pop-1)
if(py[j]==-1) m=min(m,slack[j]);
FOR(j,0,pop-1)
{
if(px[j]!=-1) x[j]-=m;
if(py[j]!=-1) y[j]+=m;
else slack[j]-=m;
}
FOR(j,0,pop-1)
if(py[j]==-1&&!slack[j])
{
py[j]=par[j];
if(sy[j]==-1)
{adjust(j),flag=1;break;}
px[sy[j]]=j;
if(fid(sy[j]))
{flag=1;break;}
}
}
}
int ans=0;
FOR(i,0,pop-1)
ans+=w[sy[i]][i];
return ans;
}
int main()
{
cin.tie(0);
cout.tie(0);
si(n);
FOR(i,1,n)
FOR(j,0,3) si(a[i][j]);
FOR(i,1,n)
FOR(j,0,3) si(b[i][j]);
FOR(i,1,n)
{
FOR(j,1,n)
{
int s=0;
FOR(k,0,3)
{
FOR(z,0,3)
{
if(a[i][k]==b[j][z]) s++;
}
}
w[i-1][j-1]=s;
}
}
pop=n;
cout<<4*n-km()<<endl;
return 0;
}