Submission #1853186
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define fol(i,n) for(int i=0;i<n;i++) #define pb push_back typedef long long ll; typedef pair<int,int> P; typedef vector<P> vip; const int MAX_V=100000; const ll INF=pow(10,17); int V; struct edge{int to,cost;};//Dijkstra vector<edge> G[MAX_V]; bool used[MAX_V]; ll d[MAX_V]; void dijkstra(int s){ priority_queue<P,vector<P>,greater<P> > que; fill(d,d+V,INF); d[s]=0; que.push(P(0,s)); while(!que.empty()){ P p = que.top();que.pop(); int v = p.second; if(d[v]<p.first) continue; for(int i=0;i<G[v].size();i++){ edge e = G[v][i]; if(d[e.to]>d[v]+e.cost){ d[e.to] = d[v] + e.cost; que.push(P(d[e.to],e.to)); } } } } void solve(){ cin>>V;++V; int from; fol(i,V-2){ edge t; cin >> from>>t.to>>t.cost; G[from].pb(t); swap(from,t.to); G[from].pb(t); } int q,k; cin>>q>>k; dijkstra(k); int x,y; fol(i,q){ cin>>x>>y; cout <<d[x]+d[y]<<endl; } } int main(){ solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Transit Tree Path |
User | ravie403 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1211 Byte |
Status | RE |
Exec Time | 213 ms |
Memory | 7168 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 2 ms | 2560 KB |
sample_02.txt | AC | 2 ms | 2560 KB |
sample_03.txt | AC | 2 ms | 2560 KB |
subtask_1_1.txt | AC | 2 ms | 2560 KB |
subtask_1_10.txt | AC | 128 ms | 3456 KB |
subtask_1_11.txt | AC | 4 ms | 2560 KB |
subtask_1_12.txt | AC | 13 ms | 2688 KB |
subtask_1_13.txt | AC | 43 ms | 2816 KB |
subtask_1_14.txt | AC | 2 ms | 2560 KB |
subtask_1_15.txt | AC | 8 ms | 2816 KB |
subtask_1_16.txt | RE | 202 ms | 6272 KB |
subtask_1_17.txt | RE | 213 ms | 6272 KB |
subtask_1_18.txt | RE | 177 ms | 5632 KB |
subtask_1_19.txt | RE | 150 ms | 4864 KB |
subtask_1_2.txt | AC | 4 ms | 2688 KB |
subtask_1_20.txt | RE | 199 ms | 5760 KB |
subtask_1_21.txt | RE | 200 ms | 5760 KB |
subtask_1_22.txt | RE | 201 ms | 5760 KB |
subtask_1_23.txt | RE | 199 ms | 5760 KB |
subtask_1_24.txt | RE | 183 ms | 6516 KB |
subtask_1_25.txt | RE | 184 ms | 6516 KB |
subtask_1_26.txt | RE | 183 ms | 6516 KB |
subtask_1_27.txt | RE | 183 ms | 6516 KB |
subtask_1_28.txt | RE | 203 ms | 5760 KB |
subtask_1_3.txt | AC | 199 ms | 6528 KB |
subtask_1_4.txt | AC | 2 ms | 2560 KB |
subtask_1_5.txt | AC | 179 ms | 3584 KB |
subtask_1_6.txt | AC | 33 ms | 3072 KB |
subtask_1_7.txt | AC | 149 ms | 3456 KB |
subtask_1_8.txt | AC | 2 ms | 2560 KB |
subtask_1_9.txt | AC | 173 ms | 7168 KB |