Submission #106638

#	Time	Username	Problem	Language	Result	Execution time	Memory
106638		ArshiaDadras	Planinarenje (COCI18_planinarenje)	C++14	160 / 160	13 ms	996 KiB

planinarenje

/* In the name of Allah */
#include<bits/stdc++.h>
using namespace std;

const int N = 1e4 + 5;
int n, m, match[N];
vector<int> adj[N];
bitset<N> mark;

bool dfs1(int u) {
	mark[u] = true;
	for (auto v: adj[u])
		if (!~match[v] || (!mark[match[v]] && dfs1(match[v]))) {
			match[match[v] = u] = v;
			return true;
		}
	return false;
}

void dfs2(int u) {
	mark[u] = true;
	for (auto v: adj[u])
		if (~match[v] && !mark[match[v]])
			dfs2(match[v]);
}

int main() {
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		u--, v += n - 1;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	memset(match, -1, sizeof match);
	for (int ok = 1; ok; mark.reset())
		for (int u = ok = 0; u < n; u++)
			if (!~match[u] && !mark[u])
				ok |= dfs1(u);
	for (int u = 0; u < n; u++)
		if (!~match[u] && !mark[u])
			dfs2(u);
	for (int u = 0; u < n; u++)
		cout << (mark[u]? "Mirko\n": "Slavko\n");
}

• Subtask 1: 16 / 16
• Subtask 2: 16 / 16
• Subtask 3: 16 / 16
• Subtask 4: 16 / 16
• Subtask 5: 16 / 16
• Subtask 6: 16 / 16
• Subtask 7: 16 / 16
• Subtask 8: 16 / 16
• Subtask 9: 16 / 16
• Subtask 10: 16 / 16