# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1122417 | enzy | Two Transportations (JOI19_transportations) | C++14 | 595 ms | 984 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;
const int maxn=2010;
const int inf=1e9+7;
vector<pair<int,int>>v[maxn];
vector<int> a, b, c;
int dist[maxn], m, cnt, at;
void dijkstra(){
for(int i=1;i<m;i++) dist[i]=inf;
set<pair<int,int>>s;
for(int i=0;i<m;i++) s.insert({dist[i],i});
while(!s.empty()){
auto f=s.begin();
int u=f->second; s.erase(f);
for(auto p : v[u]){
int viz=p.first, peso=p.second;
if(dist[u]+peso<dist[viz]){
s.erase({dist[viz],viz});
dist[viz]=dist[u]+peso;
s.insert({dist[viz],viz});
}
}
}
}
void InitA(int N, int A, vector<int> U, vector<int> V,vector<int> C){
m=N;
//if(U.size()+a.size()<m-1) return;
for(int i=0;i<m;i++) v[i].clear();
for(int i=0;i<U.size();i++){
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... |