# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223804 | rama_pang | Sky Walking (IOI19_walk) | C++14 | 3128 ms | 233496 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;
class Graph {
private:
struct edge_t {
int v;
long long w;
edge_t() {}
edge_t(int v, long long w) : v(v), w(w) {}
bool operator < (const edge_t &o) const { return w > o.w; }
};
vector<vector<edge_t>> adj;
public:
Graph() {}
int AddVertex() {
adj.emplace_back();
return (int) adj.size() - 1;
}
void AddEdge(int u, int v, long long w) {
adj[u].emplace_back(v, w);
adj[v].emplace_back(u, w);
}
long long Dijkstra(int s, int g) {
priority_queue<edge_t> pq;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |