# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
679353 | Hiennoob123 | Commuter Pass (JOI18_commuter_pass) | C++14 | 392 ms | 41968 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
#define int long long
#define ld long double
#define cd complex<ld>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pld pair<ld,ld>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll n, m;
vector<pll> T[100005];
ll save[4];
ll dis[4][100005];
bool chk[100005];
bool in[100005];
ll dp[100005];
ll sum[100005];
vector<ll> adj[100005];
ll ans = LLONG_MAX;
void dijsktra(ll type)
{
for(int i = 1; i<= n; i++) dis[type][i] = LLONG_MAX;
for(int i = 1; i<= n; i++) chk[i] = 0;
priority_queue<pll,vector<pll>, greater<pll>> q;
dis[type][save[type]] = 0;
q.push(mp(0 , save[type]));
# | 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... |