Submission #1445297

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#define PB push_back
#define MP make_pair
#define sz(v) (in((v).size()))
#define forn(i,n) for(in i=0;i<(n);++i)
#define forv(i,v) forn(i,sz(v))
#define fors(i,s) for(auto i=(s).begin();i!=(s).end();++i)
#define all(v) (v).begin(),(v).end()
using namespace std;
typedef long long in;
typedef vector<in> VI;
typedef vector<VI> VVI;
in n,m;
in bst=1e9;
VVI pm;
VI nxt;
VI act;
VI pct;
int main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin>>n>>m;
  pm.resize(n,VI(m));
  nxt.resize(n,0);
  forn(i,n){
    forn(j,m){
      cin>>pm[i][j];
      --pm[i][j];
    }
  }
  act.resize(m,1);
  pct.resize(m,0);
  forn(i,n)
    ++pct[pm[i][0]];
  in mx=-1;
  in argmx=-1;
  forn(i,m){
    if(pct[i]>mx){
      mx=pct[i];
      argmx=i;
    }
  }
  bst=min(bst,mx);
  forn(z,n-1){
    act[argmx]=0;
    forn(i,n){
      while(!act[pm[i][nxt[i]]])
	++nxt[i];
    }
    forn(i,m)
      pct[i]=0;
    forn(i,n)
      ++pct[pm[i][nxt[i]]];
    mx=-1;
    argmx=-1;
    forn(i,m){
      if(pct[i]>mx){
	mx=pct[i];
	argmx=i;
      }
    }
    bst=min(bst,mx);
  }
  cout<<bst<<endl;
  return 0;
}

Submission Info

Judge Result