# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1063101 | _8_8_ | Olympic Bus (JOI20_ho_t4) | C++17 | 648 ms | 9852 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;
const int N = 1e5 + 12, MOD = (int)1e9 + 7;
#define int ll
const ll inf = 1e16;
int n,m;
int U[N],V[N],C[N],D[N];
void dijkstra(int ver,vector<ll> &d,vector<int> &pr) {
d.resize(n);
pr.resize(n);
for(int i = 0;i < n;i++) {
d[i] = inf;
}
d[ver] = 0;
vector<int> vis(n,0);
vector<vector<int>> g;g.resize(n);
for(int i = 0;i < m;++i) {
g[U[i]].push_back(i);
}
for(int i = 0;i < n;i++) {
int v = -1;
for(int j = 0;j < n;j++) {
if(vis[j]) continue;
if(v == -1 || d[j] < d[v]) {
v = j;
}
}
# | 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... |