# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
206717 | Saboon | Olympic Bus (JOI20_ho_t4) | C++14 | 322 ms | 2424 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;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int maxn = 200 + 10;
const int maxm = 5e4 + 10;
const int inf = 1e9;
int n, m;
int a[maxm], b[maxm], c[maxm], d[maxm];
vector<pair<int,int> > g[maxn];
int dp[maxn], pd[maxn], cn[maxn], pr[maxn];
bool mark[maxn];
int dijkstra(int src, int snk){
memset(dp, 63, sizeof dp);
memset(mark, 0, sizeof mark);
memset(cn, 0, sizeof cn);
dp[src] = 0;
for (int i = 0; i < n; i++){
int v = -1;
for (int j = 1; j <= n; j++)
if (!mark[j] and (v == -1 or dp[v] > dp[j]))
v = j;
if (v == -1)
break;
# | 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... |