# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1175084 | duonggsimp | Commuter Pass (JOI18_commuter_pass) | C++20 | 196 ms | 41236 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll,ll> ii;
typedef pair <ii,ll> iii;
#define pb push_back
#define fi first
#define se second
#define endl '\n'
#define MOD 1000000007
const int N = 2e6;
ll n,m;
ll s,t,u,v;
ll ds[1000005];
ll dt[1000005];
ll du[1000005];
ll dv[1000005];
vector <ii> a[1000005];
priority_queue <ii,vector<ii>,greater<ii>> q;
void ditcha(ll d[],ll x){
for (long i=1; i<=n; i++) d[i] = 1e15;
d[x] = 0;
q.push({0,x});
while (!q.empty()){
ii t = q.top(); q.pop();
# | 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... |