제출 #228252

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
228252		shengdebao	Planinarenje (COCI18_planinarenje)	C++14	0 / 160	13 ms	640 KiB

planinarenje

#include <bits/stdc++.h>//random submition// =|-_-|-=-|-_-|=


using namespace std;



const int MAXN = 5000 + 23;












int n, m, mt[MAXN];
vector<int> g[MAXN];
bitset<MAXN> mark;

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




int main() {
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int p, v;
		cin >> p >> v;
		g[--p].push_back(--v);
	}
	memset(mt, -1, sizeof mt);
	for (int i = 0; i < n; i++) {
		mark.reset();
		if (dfs(i)) cout << "Slavko\n";//wrong need to edit dfs:))
		else cout << "Mirko\n";
	}
	return 0;
}

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