Submission #228250

#	Time	Username	Problem	Language	Result	Execution time	Memory
228250		shengdebao	Planinarenje (COCI18_planinarenje)	C++14	160 / 160	41 ms	3072 KiB

planinarenje

#include <bits/stdc++.h>
using namespace std;

const int MN = 50012;
vector <int> adj[MN], kaj[MN];
int p[MN], good[MN];
bool mark[MN];

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

bool sms(int v) {
	mark[v] = true;
	for (int u: kaj[v]) 
		if ((good[u] == -1) || (!mark[good[u]] && sms(good[u]))) 
			return true;
	return false;
}

int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++)
		good[i] = p[i] = -1;
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		adj[--a].push_back(--b);
		kaj[b].push_back(a);
	}
	for (int i = 0; i < n; i++) {
		for (int i = 0; i < n; i++)
			mark[i] = false;
		dfs(i);
	}
	for (int i = 0; i < n; i++)
		if (p[i] != -1)
		good[p[i]] = i;
	for (int i = 0; i < n; i++) {
		for (int i = 0; i < n; i++)
			mark[i] = false;
		if (good[i] == -1)
			cout << "Mirko\n";
		else if (sms(good[i]))	
			cout << "Mirko\n";
		else
			cout << "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