# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976548 | Haanhtien | Relay Marathon (NOI20_relaymarathon) | C++14 | 178 ms | 68872 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;
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
struct datax{
ll u, v, w;
};
ll n, m, k, cities[100005], ans, t, u, v, w, dist[100005], h[100005], a, b, spe[100005];
ll flat[100005];
vector<ii> adj[100005];
datax queries[400005];
ii dijkstra(ll s){
priority_queue<ii, vector<ii>, greater<ii>> pq;
for(int i=1; i<=n; i++) dist[i] = 1e9;
dist[s]=0;
pq.push({0, s});
while(!pq.empty()){
ll val = pq.top().fi;
ll u = pq.top().se;
pq.pop();
if(dist[u]!=val) continue;
if(spe[u]){
return {dist[u], u};
Compilation message (stderr)
# | 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... |