Submission #3235543

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <iostream>
#include <queue>
#define ll long long 
#define ri register int 
using std::min;
using std::max;
template <class T>inline void read(T &x){
    x=0;int ne=0;char c;
    while(!isdigit(c=getchar()))ne=c=='-';
    x=c-48;
    while(isdigit(c=getchar()))x=(x<<3)+(x<<1)+c-48;
    x=ne?-x:x;return ;
}
const int maxn=305;
const int inf=0x7fffffff;
int a[maxn][maxn];
int n,m;
bool ok[maxn];
int cnt[maxn],ans=inf;
int main(){
    int mx,p;
    read(n),read(m);
    for(ri i=1;i<=n;i++){
        for(ri j=1;j<=m;j++){
            read(a[i][j]);
        }
    }
    for(ri k=1;k<=m;k++){
    	memset(cnt,0,sizeof(cnt));
        for(ri i=1;i<=n;i++){
            for(ri j=1;j<=m;j++){
                if(!ok[a[i][j]]){
					cnt[a[i][j]]++;
					break;
				}
            }
        }
        mx=0,p=0;
        for(ri i=1;i<=m;i++){
            if(cnt[i]>mx)mx=cnt[i],p=i;
        }
        ok[p]=1;
        ans=min(ans,mx);
    }
    printf("%d\n",ans);
    return 0;
}

Submission Info

Judge Result