# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122877 | Plurm | Two Transportations (JOI19_transportations) | C++14 | 928 ms | 55112 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 "Azer.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
class state{
public:
int u;
int w;
state(int x, int y) : u(x), w(y) {}
friend bool operator<(state x, state y){
return x.w > y.w;
}
};
int N;
vector<pair<int, int> > g[2048];
int dist[2048];
vector<bool> cur;
void computeShortestPath(){
for(int i = 1; i < N; i++){
dist[i] = 1 << 21;
}
dist[0] = 0;
priority_queue<state> pq;
pq.emplace(0,0);
while(!pq.empty()){
state curr = pq.top();
pq.pop();
for(auto v : g[curr.u]){
if(dist[v.first] > curr.w + v.second){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |