Submission #762033

#	Time	Username	Problem	Language	Result	Execution time	Memory
762033		siewjh	Planinarenje (COCI18_planinarenje)	C++17	160 / 160	7 ms	596 KiB

planinarenje

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5005;
vector<int> adj[MAXN];
bool vis[MAXN], matched[MAXN], flip[MAXN];
int match[MAXN];
bool aug(int x){
	if (vis[x]) return 0;
	vis[x] = 1;
	for (int nxt : adj[x])
		if (match[nxt] == -1 || aug(match[nxt])){
			match[nxt] = x;
			return 1;
		}
	return 0;
}
bool alt(int x){
	if (vis[x]) return 0;
	vis[x] = 1;
	for (int nxt : adj[x]){
		if (match[nxt] != -1){
			flip[match[nxt]] = 1;
			alt(match[nxt]);
		}
	}
	return 0;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int nums, edges; cin >> nums >> edges;
	for (int i = 0; i < edges; i++){
		int p, v; cin >> p >> v;
		adj[p].push_back(v);
	}
	for (int i = 1; i <= nums; i++) match[i] = -1;
	for (int i = 1; i <= nums; i++){
		for (int j = 1; j <= nums; j++) vis[j] = 0;
		aug(i);
	}
	for (int i = 1; i <= nums; i++)
		if (match[i] != -1)
			matched[match[i]] = 1;
	for (int i = 1; i <= nums; i++)
		if (!matched[i]){
			for (int j = 1; j <= nums; j++) vis[j] = 0;
			alt(i);
		}
	for (int i = 1; i <= nums; i++){
		if (!matched[i] || flip[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