Submission #227349

#TimeUsernameProblemLanguageResultExecution timeMemory
227349aryanvPlaninarenje (COCI18_planinarenje)C++14
96 / 160
1092 ms1144 KiB
//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'; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...