Submission #437404

#	Time	Username	Problem	Language	Result	Execution time	Memory
437404		mammedbrk	Planinarenje (COCI18_planinarenje)	C++14	160 / 160	6 ms	1992 KiB

planinarenje

#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 5e4+10;
bool mark[maxn], fmatch[maxn], tmp[maxn];
vector<int> adj[maxn];
int match[maxn];

bool dfs(int v){
	if(mark[v]) return false;
	mark[v] = true;
	for(int u: adj[v])
		if(match[u] == -1 || dfs(match[u])){
			match[u] = v;
			return true;
		}
	return false;
}

void dfs2(int v){
	if(mark[v]) return;
	mark[v] = true;
	for(int u: adj[v])
		if(match[u] != -1){
			tmp[match[u]] = false;
			dfs2(match[u]);
		}
}

int main(){
	memset(match, -1, sizeof(match));
	int n, m;
	cin >> n >> m;
	for(int i = 0, u, v; i < m; i++){
		cin >> u >> v; u--; v--;
		adj[u].pb(v);
	}
	bool find = true;
	while(find){
		find = false;
		memset(mark, 0, sizeof(mark));
		for(int i = 0; i < n; i++)
			if(!fmatch[i] && dfs(i)){
				find = true;
				fmatch[i] = true;
			}
	}

	memset(mark, 0, sizeof(mark));
	memset(tmp, 1, sizeof(tmp));
	for(int i = 0; i < n; i++)
		if(!fmatch[i])
			dfs2(i);

	for(int i = 0; i < n; i++)
		if(!fmatch[i] || !tmp[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