Алгоритм Куна

#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <string>
#include <math.h>
#include <climits>

//#include <chrono>
//#include <fstream>
//#include <bits/stdc++.h>

#define mp make_pair
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b) - 1; i >= (a); i--)

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> veci;
typedef vector<bool> vecb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;

const int INF_I = 1e9;
const ll INF_LL = 1e18;

vvb vec;
veci p;
vecb used;
int n, s;

bool dfs(int v) {
	if (used[v])
		return false;
	used[v] = true;
	for (int i = 0; i < n; i++)
		if (vec[v][i] && (p[i] == -1 || dfs(p[i]))) {
			p[i] = v;
			return true;
		}
	return false;
}

int main() {
	/*ifstream cin("in.txt");
	ofstream cout("out.txt");
	auto start_time = chrono::high_resolution_clock::now();*/

	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);



	cin >> n >> s;
	vec.assign(s, vecb(n));
	p.assign(n, -1);
	for (int i = 0; i < s; i++)
		for (int j = 0; j < n; j++)
		{
			int a; cin >> a;
			vec[i][j] = a == 1;
		}


	int res = 0;
	for (int i = 0; i < s; i++) {
		used.assign(s, 0);
		res += dfs(i);
	}

	cout << res << endl;

	/*auto end_time = chrono::high_resolution_clock::now();
	chrono::duration<double> duration = end_time - start_time;
	cout << duration.count() << "\n";
	cin.close();
	cout.close();*/
	return 0;
}