# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
916096 | bmh123456789asdf | Commuter Pass (JOI18_commuter_pass) | C++14 | 101 ms | 19564 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 int long long
#define fi first
#define se second
using namespace std;
const int N = 1e5 + 1;
const int oo = 1e18;
int n, m, S, T, U, V;
int c[N], w[N];
vector<pair<int,int>> adj[N];
struct mmb
{
int vertex, dlab;
bool operator < (const mmb& other) const
{
return dlab > other.dlab;
}
};
priority_queue<mmb> Q;
void DFS(int u,int par)
{
for(auto v : adj[u])
{
if(c[v.fi] + w[v.se] == c[u] && v.fi != par)
{
# | 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... |