Submission #1868435

---

Source Code Expand

#include <stdio.h>
#include <bits/stdc++.h>			

#define pb push_back
#define pf push_front
#define pp pop_back
#define sz(a) (int)(a.size())
#define mp make_pair
#define F first
#define S second
#define next _next
#define prev _prev
#define left _left
#define right _right
#define y1 _y1
#define all(x) x.begin(), x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = (int)1e6 + 123;
const ll INF = (ll)1e18 + 123;
const int inf = (int)1e9 + 123;
const int MOD = (int)1e9 + 7;

void megaRandom() {
	unsigned int FOR;
 	asm("rdtsc" : "=A"(FOR));
  srand(FOR);
}

int n, m, a[311][311];
set<int> st;
int cnt[311], p[311][311];

int main() {
	megaRandom();
	cin >> n >> m;
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= m; j ++) {
			cin >> a[i][j];
			p[i][a[i][j]] = j;
		}
	}
	for(int j = 1; j <= m; j ++) 
		st.insert(j);
	int res = inf;
	while(sz(st) > 0) {
		memset(cnt, 0, sizeof cnt);
		for(int i = 1; i <= n; i ++) {
			int mn = inf, mn_x = -1;
			for(auto v : st) 
				if(p[i][v] < mn)
					mn = p[i][v], mn_x = v;
			cnt[mn_x] ++;		
		}
		int mx = -inf, mx_x = -1;
		for(auto v : st) {
			if(cnt[v] > mx)
				mx = cnt[v], mx_x = v;
		}
		res = min(res, mx);
		st.erase(mx_x);
	}
	cout << res;
	return 0;         
}

Submission Info

Judge Result