Submission #1693173

---

Source Code Expand

#include<cstdio>
#include<algorithm>
using namespace std;
inline char tc(void){
	static char fl[10000],*A=fl,*B=fl;
	return A==B&&(B=(A=fl)+fread(fl,1,10000,stdin),A==B)?EOF:*A++;
}
inline int read(void){
	int a=0;static char c;
	while((c=tc())<'0'||c>'9');
	while(c>='0'&&c<='9')a=a*10+c-'0',c=tc();
	return a;
}
int n,m,a[301][301],ans=2e9,sum[301],now[301],mx,b[301];
int main(void){
	register int i,j;
	n=read(),m=read();
	for(i=1;i<=n;++i){
		for(j=1;j<=m;++j)
			a[i][j]=read();
		++sum[a[i][1]],now[i]=1;
	}
	for(i=1;i<=n;++i)
		if(sum[a[i][1]]>sum[mx])
			mx=a[i][1];	
	ans=min(ans,sum[mx]);
	for(i=1;i<m;++i){
		b[mx]=1,mx=0;
		for(j=1;j<=n;++j){
			int s=0;
			if(b[a[j][now[j]]])
				--sum[a[j][now[j]]];
			while(b[a[j][now[j]]])
				++now[j],s=1;
			sum[a[j][now[j]]]+=s;
			if(sum[a[j][now[j]]]>sum[mx])
				mx=a[j][now[j]];
		}
		ans=min(ans,sum[mx]);
	}
	printf("%d",ans);
	return 0;
}

Submission Info

Judge Result