# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
169997 | darklight256 | Planinarenje (COCI18_planinarenje) | C++14 | 8 ms | 632 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//
// fstmm.cpp
// Code
//
// Created by Mohammadreza Raddanipour on 12/23/19.
// Copyright © 2019 Mohammadreza Raddanipour. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
const int MXN = 5e3 + 20;
int n, m, mch[MXN];
vector<int> adj[MXN];
bool mchd[MXN], vs[MXN];
void npt() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
adj[--u].push_back(--v);
}
}
bool dfs(int v) {
vs[v] = 1;
for (auto u: adj[v])
if (mch[v] == -1 || (!vs[mch[u]] && dfs(mch[u]))) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |