# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
535716 | sam571128 | Olympic Bus (JOI20_ho_t4) | C++17 | 1095 ms | 4272 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 fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 205;
struct edge{
int u,v,w,x;
};
vector<edge> edges;
vector<int> adj[N];
int dis[N];
int n,m;
int ans = 1e18;
void dijkstra(int tmp){
int res = 0;
fill(dis,dis+N,1e18);
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<>> pq;
dis[1] = 0;
pq.push({0,1});
while(!pq.empty()){
auto [ww,u] = pq.top(); pq.pop();
if(ww > dis[u]) continue;
# | 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... |