oj.uz

Submission #227367

# Submission time Handle Problem Language Result Execution time Memory
227367 2020-04-27T07:47:31 Z mohammad_amin Planinarenje (COCI18_planinarenje) C++14
160 / 160
 34 ms 896 KB 
#include <bits/stdc++.h>
using namespace std;

const int MN = 5012;
vector <int> adj[MN], kaj[MN];
int p[MN];
bool mark[MN];
int good[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 kfs(int v) {
//	cerr << v << endl;
	mark[v] = true;
	for (int u: kaj[v]) {
//		cerr << v << ' ' << u << ' ' << good[u] << endl;
		if ((good[u] == -1) || (!mark[good[u]] && kfs(good[u]))) {
//			cerr << v << '?' << u << '?' << good[u] << endl;
			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);
	}
//	good[2] = -1;
//	cerr << (good[2] = -1) << '*' << endl;
	for (int i = 0; i < n; i++)
		if (p[i] != -1)
			good[p[i]] = i;//, cerr << p[i] << '=' << i << endl;
//	for (int i = 0; i < n; i++)
//		cerr << p[i] << '!' << ' ';
//	cerr << endl;
//	for (int i = 0; i < n; i++)
//		cerr << good[i] << '!' << ' ';
//	cerr << endl;
	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 (kfs(good[i]))	
			cout << "Mirko\n";
		else
			cout << "Slavko\n";			
	}
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 640 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 640 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 6 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 896 KB Output is correct
2 Correct 31 ms 896 KB Output is correct
3 Correct 30 ms 896 KB Output is correct
4 Correct 31 ms 896 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 640 KB Output is correct
2 Correct 20 ms 872 KB Output is correct
3 Correct 13 ms 640 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 640 KB Output is correct
2 Correct 8 ms 640 KB Output is correct
3 Correct 13 ms 640 KB Output is correct
4 Correct 16 ms 768 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 768 KB Output is correct
2 Correct 31 ms 888 KB Output is correct
3 Correct 15 ms 768 KB Output is correct

Subtask #9
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 768 KB Output is correct
2 Correct 21 ms 896 KB Output is correct
3 Correct 17 ms 768 KB Output is correct
4 Correct 34 ms 768 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 768 KB Output is correct
2 Correct 12 ms 768 KB Output is correct
3 Correct 20 ms 896 KB Output is correct
4 Correct 28 ms 768 KB Output is correct