# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81785 | tjdgus4384 | 두 로봇 (KOI18_robot) | C++14 | 111 ms | 56968 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<cstdio>
#include<vector>
#include<queue>
#include<string.h>
#include<algorithm>
#define INF 1000000000
using namespace std;
vector<pair<int, int> > v[100001];
int dist[100001];
pair<int, int> pa[100001];
int main()
{
int n, s, e, a, b, c;
scanf("%d %d %d", &n, &s, &e);
for(int i = 1;i < n;i++)
{
scanf("%d %d %d", &a, &b, &c);
v[a].push_back({b, c});
v[b].push_back({a, c});
}
if(s == e)
{
printf("0");
return 0;
}
priority_queue<pair<int, pair<int, pair<int, int> > >, vector<pair<int, pair<int, pair<int, int> > > >, greater<pair<int, pair<int, pair<int, int> > > > > pq;
fill(dist, dist + n + 1, INF);
pq.push({0, {s, {s, 0}}});
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... |