oj.uz

답안 #227349

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
227349 2020-04-27T06:05:57 Z aryanv Planinarenje (COCI18_planinarenje) C++14
96 / 160
 1000 ms 1144 KB 
//Be Name Khoda, Besmellah Rahmane Rahim, In The Name Of God;
//#include<bits/stweight++.h>
#include<iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include<bitset>
#include<list>
#include<cassert>
#include<numeric>
#include <stdio.h>
#include <string.h>
#include<iomanip>
#include<unordered_map>
#include<unordered_set>
#include <iostream>
#include <fstream>


using namespace std;

const int N = 10000 + 5;

int n, m;
vector<int> adj[N];
bool mark[N];
int match_up[N];
int match_down[N];

bool dfs(int v, int p = -1) 
{
	if (v == p)
	{
		return false;
	}
	mark[v] = true;
	for (auto u : adj[v]) 
	{
		if (u == p)
		{
			continue;
		}
		if (match_up[u] == -1 || (!mark[match_up[u]] && dfs(match_up[u]))) { // augmenting path found!
			match_up[u] = v;
			match_down[v] = u;
			return true;
		}
	}
	return false;
}

int solver(int p = -1)
{
	int ans = 0;
	memset(match_down, -1, sizeof match_down);
	memset(match_up, -1, sizeof match_up);
	while (true) 
	{
		bool finished = true;
		memset(mark, 0, sizeof mark);
		for (int i = 0; i < n * 2; i++)
		{
			if (match_down[i] == -1 && !mark[i] && dfs(i, p)) 
			{
				finished = false;
				ans++;	
			}
		}
		if (finished)
		{
			break;
		}
	}
	return ans;
}


int main() 
{
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 0; i < m; i++) 
	{
		int u, v;
		cin >> u >> v;
		u--;
		v--;
		adj[2 * u].push_back(2 * v + 1);
		adj[2 * v + 1].push_back(2 * u);
	}
	int max_matching = solver();
	for (int i = 0; i < 2 * n; i += 2)
	{
		int num = solver(i);	
		if (num == max_matching)
		{
			cout << "Mirko" << '\n';
		}
		else
		{
			cout << "Slavko" << '\n';
		}
	}
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 768 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 768 KB Output is correct
2 Correct 16 ms 640 KB Output is correct
3 Correct 17 ms 640 KB Output is correct
4 Correct 17 ms 768 KB Output is correct

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1091 ms 1144 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 358 ms 904 KB Output is correct
2 Correct 54 ms 768 KB Output is correct
3 Correct 208 ms 772 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 888 KB Output is correct
2 Correct 208 ms 768 KB Output is correct
3 Correct 243 ms 768 KB Output is correct
4 Correct 45 ms 768 KB Output is correct

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 962 ms 1004 KB Output is correct
2 Execution timed out 1092 ms 1016 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1087 ms 768 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1091 ms 888 KB Time limit exceeded
2 Halted 0 ms 0 KB -