# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1062999 | isaachew | Two Transportations (JOI19_transportations) | C++17 | 628 ms | 58016 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>
#include "Azer.h"
/*
*/
namespace{
int state=0,nbits=0,result=0;//Comparing, Receiving Location
int curdist=0;
int othdist=0,othnum=0;
int nrounds=0;
std::vector<int> dists;
std::vector<std::vector<std::pair<int,int>>> edges;
std::priority_queue<std::pair<int,int>> distspq;
int n;
void upddists(int vert,int dist){
dists[vert]=dist;
for(std::pair<int,int> i:edges[vert]){
distspq.push({-(dist+i.second),i.first});
}
}
void senddist(){
if(nrounds++==n-1)return;
state=0;
while(!distspq.empty()&&dists[distspq.top().second]!=1e9){
distspq.pop();
}
std::pair<int,int> topdist=distspq.empty()?std::pair<int,int>(-1e9,-1):distspq.top();
int val=(-topdist.first)==1e9?511:-topdist.first-curdist;
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... |