# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683556 | 42kangaroo | Commuter Pass (JOI18_commuter_pass) | C++17 | 648 ms | 67976 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.
//
// Created by 42kangaroo on 17/01/2023.
//
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct Edge {
int fr, to, w;
};
struct nEdge {
int to, w;
int stat;
};
bool operator>(const Edge &l, const Edge &r) {
return l.w > r.w;
}
bool operator>(const nEdge &l, const nEdge &r) {
return l.w > r.w;
}
using g_t = vector<vector<Edge>>;
void dfs(int n, g_t &gr, g_t &outB, g_t &outF, vector<bool>& vis) {
if (vis[n])return;
# | 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... |