Submission #1868408

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)
#define lowbit(x) ((x)&(-(x)))
#define sqr(a) ((a)*(a))
#define clr(a) (memset((a),0,sizeof(a)))
#define ls ((x)<<1)
#define rs (((x)<<1)|1)
#define mid (((l)+(r))>>1)
#define pb push_back
#define w1 first
#define w2 second
inline void read(int &x){
	x=0;int f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	x*=f;
}
inline void judge(){
	freopen("in.txt","r",stdin);
	freopen("out.txt","w",stdout);
}
/*******************************head*******************************/
const int maxn=305;
int a[maxn][maxn],n,m;
bool flag[maxn];
int cnt[maxn];
inline void re_count(){
	memset(cnt,0,sizeof(cnt));
	rep(i,1,n){
		rep(j,1,m)if(flag[a[i][j]]){
			cnt[a[i][j]]++;break;
		}
	}
}
int main(){
	read(n);read(m);
	rep(i,1,n)rep(j,1,m)read(a[i][j]);
	int ans=n;rep(i,1,m)flag[i]=1;
	rep(x,1,n){
		re_count();
		int maxi=0;
		rep(i,1,m)maxi=max(maxi,cnt[i]);
		ans=min(ans,maxi);
		rep(i,1,m)if(cnt[i]==maxi){
			flag[i]=0;break;
		}
	}cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result