# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096686 | nguyenvu | Railway (BOI17_railway) | C++14 | 44 ms | 23624 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.
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,k;
vector<int> a[500007];
map<pair<int,int>,int> mp;
int d[500007];
namespace sub1 {
bool check() {
return 1;
}
bool f[500007];
vector<pair<int,int>> res;
int dfs(int i) {
f[i] = 1;
bool ok = (d[i]>=k);
for (const int &j : a[i]) {
if (f[j]) continue;
if (dfs(j)) {
res.push_back(pair<int,int>(min(i,j),max(i,j)));
ok = 1;
}
}
return ok;
# | 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... |