oj.uz

Submission #437397

# Submission time Handle Problem Language Result Execution time Memory
437397 2021-06-26T09:24:59 Z mammedbrk Planinarenje (COCI18_planinarenje) C++14
48 / 160
 7 ms 1996 KB 
#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;
}

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

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.0 / 16.0

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

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1740 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1740 KB Output is correct
2 Correct 2 ms 1740 KB Output is correct
3 Correct 2 ms 1740 KB Output is correct
4 Correct 2 ms 1668 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1932 KB Output is correct
2 Correct 7 ms 1940 KB Output is correct
3 Correct 6 ms 1992 KB Output is correct
4 Correct 5 ms 1996 KB Output is correct

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1740 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1740 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 1892 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 1868 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 1868 KB Output isn't correct
2 Halted 0 ms 0 KB -