# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733511 | pcc | Olympic Bus (JOI20_ho_t4) | C++14 | 1077 ms | 3928 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;
#pragma GCC optimize("O3")
#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second
const int mxn = 202;
const int mxn2 = 5e4+10;
const ll inf = 1e18;
ll dist[mxn];
struct edge{
ll from,to,val,id,cost;
edge(){}
edge(ll ff,ll tt,ll vv,ll cc,ll ii){
from = ff,to = tt,val = vv,cost = cc;
id = ii;
}
};
vector<edge> paths[mxn];
edge edges[mxn2];
int n,m;
ll dijkstra(int s,int no){
priority_queue<pll,vector<pll>,greater<pll>> pq;
fill(dist,dist+mxn,inf);
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... |