Submission #305468

#TimeUsernameProblemLanguageResultExecution timeMemory
305468HynDufPlaninarenje (COCI18_planinarenje)C++11
160 / 160
45 ms768 KiB
#include <bits/stdc++.h> #define task "P" #define all(v) (v).begin(), (v).end() #define rep(i, l, r) for (int i = (l); i <= (r); ++i) #define Rep(i, r, l) for (int i = (r); i >= (l); --i) #define DB(X) { cerr << #X << " = " << (X) << '\n'; } #define DB1(A, _) { cerr << #A << "[" << _ << "] = " << (A[_]) << '\n'; } #define DB2(A, _, __) { cerr << #A << "[" << _ << "][" << __ << "] = " << (A[_][__]) << '\n'; } #define DB3(A, _, __, ___) { cerr << #A << "[" << _ << "][" << __ << "][" << ___ << "] = " << (A[_][__][___]) << '\n'; } #define PR(A, l, r) { cerr << '\n'; rep(_, l, r) DB1(A, _); cerr << '\n';} #define SZ(x) ((int)(x).size()) #define pb push_back #define eb emplace_back #define pf push_front #define F first #define S second #define by(x) [](const auto& a, const auto& b) { return a.x < b.x; } // sort(arr, arr + N, by(a)); #define next ___next #define prev ___prev #define y1 ___y1 #define left ___left #define right ___right #define y0 ___y0 #define div ___div #define j0 ___j0 #define jn ___jn using ll = long long; using ld = long double; using ull = unsigned long long; using namespace std; typedef pair<int, int> ii; typedef pair<ii, int> iii; typedef vector<int> vi; typedef vector<ii> vii; typedef vector<ll> vl; const int N = 5002; int n, m, matchP[N], matchV[N], vis[N], nvis; bool del[N]; vi g[N]; bool dfs(int u, bool changed) { if (vis[u] != nvis) vis[u] = nvis; else return 0; for (int v : g[u]) if (!del[v] && (matchP[v] == 0 || dfs(matchP[v], changed))) { if (!changed) { matchV[u] = v; matchP[v] = u; } return 1; } return 0; } void solve() { rep(i, 1, n) { nvis++; bool ok = dfs(i, 0); } rep(i, 1, n) { del[i] = 1; nvis++; if (matchP[i] == 0 || dfs(matchP[i], 1)) cout << "Mirko\n"; else cout << "Slavko\n"; del[i] = 0; } } int main() { #ifdef HynDuf freopen(task".in", "r", stdin); //freopen(task".out", "w", stdout); #else ios_base::sync_with_stdio(false); cin.tie(nullptr); #endif cin >> n >> m; rep(i, 1, m) { int u, v; cin >> u >> v; g[v].eb(u); } solve(); return 0; }

Compilation message (stderr)

planinarenje.cpp: In function 'void solve()':
planinarenje.cpp:62:14: warning: unused variable 'ok' [-Wunused-variable]
   62 |         bool ok = dfs(i, 0);
      |              ^~
#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...