| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1021705 | lHog | Monthly railway pass (LMIO18_menesinis_bilietas) | C++17 | 174 ms | 7604 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>
using namespace std;
long long N, E;
//void dfs(long long n, vector<vector<long long>>& g, vector<bool>& v) {
//v[n] = true;
//for (long long e : g[n]) {
//if (!v[e]) {
//dfs(e, g, v);
//}
//}
//}
//long long c(long long N, vector<pair<long long, long long>>& d) {
//vector<vector<long long>> g(N);
//for (auto d : d) {
//g[d.first].push_back(d.second);
//g[d.second].push_back(d.first);
//}
//vector<bool> v(N, false);
//long long u = 0;
//for (long long i = 0; i < N; ++i) {
//if (!v[i]) {
//u++;
//dfs(i,g,v);
//}
//}
//return u;
//}
int main() {
| # | 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... | ||||