# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23371 | TAMREF | 주유소 (KOI16_gas) | C++11 | 763 ms | 57588 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>
#define fst first
#define snd second
using namespace std;
typedef long long ll;
typedef pair<ll,int> Pair;
typedef pair<ll,pair<int,int> > ppap;
const int MX = 2505;
const ll INF = 1e15;
int V, E, i, j, k=1, x, y, z, tam, ding;
ll D[MX][MX], oil[MX];
vector<Pair> adj[MX];
priority_queue<ppap,vector<ppap>,greater<ppap> > q;
void input(){
scanf("%d%d",&V,&E);
for(i=1;i<=V;i++) scanf("%lld",&oil[i]);
while(E--){
scanf("%d%d%d",&x,&y,&z);
adj[x].push_back(make_pair(z,y));
adj[y].push_back(make_pair(z,x));
}
for(i=1;i<=V;i++){
fill(D[i]+1,D[i]+V+1,INF);
}
D[1][1]=0;
}
void dijk(){
ppap b;
q.push(make_pair(0,make_pair(1,1)));
while(!q.empty()){
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... |