제출 #437781

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
437781		Parisa	Planinarenje (COCI18_planinarenje)	C++17	160 / 160	4 ms	720 KiB

planinarenje

#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e3 + 10;

int n, m, mat[maxn];
vector<int> adj[maxn];
bitset<maxn> mark, fmat, ans;

bool dfs(int v){
	if (mark[v]) return false;
	mark[v] = true;

	for (auto u:adj[v])
		if (mat[u] == -1 || dfs(mat[u])){
			if (mat[u] != -1)
				ans[mat[u]] = true;
			mat[u] = v;
			return true;
		}
	return false;
}

void dfs2(int v){
	if (mark[v]) return;
	mark[v] = true;

	for (auto u:adj[v])
		if (mat[u] != -1){
			ans[mat[u]] = true;
			dfs2(mat[u]);
		}
	return;
}

int main(){
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	memset(mat, -1, sizeof(mat));

	cin >> n >> m;
	for (int i = 0, v, u; i < m; i++){
		cin >> v >> u; v--, u--;
		adj[v].push_back(u);
	}

	bool find = true;
	while (find){
		find = false;
		mark.reset();
		for (int i = 0; i < n; i++)
			if (!fmat[i] && dfs(i))
				fmat[i] = find = true;
	}

	mark.reset();
	ans.reset();
	for (int i = 0; i < n; i++)
		if (!fmat[i])
			dfs2(i);

	for (int i = 0; i < n; i++)
		if (!fmat[i] || ans[i])
			cout << "Mirko\n";
		else
			cout << "Slavko\n";


	return 0;
}

• 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