# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201230 | ainta | Olympic Bus (JOI20_ho_t4) | C++17 | 52 ms | 3756 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<cstdio>
#include<algorithm>
#include<queue>
#define N_ 2010
#define pli pair<long long,int>
using namespace std;
vector<int>E[N_], F[N_], G[N_];
vector<int>L[N_], Num[N_];
int n, m, Path[N_], chk[101000];
int SP[N_], EP[N_], imp[N_], H[N_], vv[N_];
long long SD[N_], ED[N_], D[N_], DD[101000][2], INF = 1e18, U[N_];
int ord[N_];
priority_queue<pli>PQ;
struct Edge {
int a, b, c, d;
}Ed[101000];
void Push(int a, int p, long long c) {
if (D[a] <= c)return;
D[a] = c;
Path[a] = p;
PQ.push({ -c,a });
}
void Dijk(int a) {
int i;
for (i = 1; i <= n; i++)D[i] = INF, Path[i] = 0, vv[i] = 0;
Push(a, 0, 0);
while (!PQ.empty()) {
pli tp = PQ.top();
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... |