Submission #1446763

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int n,m;
int d[310],a[310][310],now[310];
bool open[310];
int main(){
	cin>>n>>m;
	for(int i=0;i<m;i++)d[i]=0,open[i]=true;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			int k;cin>>k;k--;
			a[i][k]=j;
			if(j==0)d[k]++,now[i]=k;
		}
	}
	int p=0;
	for(int i=0;i<m;i++)if(d[i]>d[p])p=i;
	int ans=d[p];
	for(int u=0;u<m-1;u++){
		open[p]=false;
		for(int i=0;i<n;i++){
			int q=0;
			for(int j=0;j<m;j++){
				if(open[j]&&a[i][j]<a[i][q])q=j;
			}
			d[now[i]]--;d[q]++;now[i]=q;
		}
		p=0;
		for(int i=0;i<m;i++)if(d[i]>d[p])p=i;
		ans=min(ans,d[p]);
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result