Submission #1689679
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long LL; using edge = struct {int to;LL cost;}; vector<edge> v[100001]; LL depth[100001]; void dfs(int i,int j,LL count){ auto e=v[i].begin(); depth[i]=count; for(int s=0;s<v[i].size();s++,e++){ if(e->to==j) continue; dfs(e->to,i,count+e->cost); } } int main(){ int N; cin >> N; for(int i=0;i<N-1;i++){ int x,y; LL r; cin >> x >> y >> r; v[x].push_back({y,r}); v[y].push_back({x,r}); } int Q,K; cin >> Q >> K; dfs(K,-1,0); for(int i=0;i<Q;i++){ int x,y; cin >> x >> y ; cout << depth[x]+depth[y] << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Transit Tree Path |
User | Yukly |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 749 Byte |
Status | AC |
Exec Time | 407 ms |
Memory | 15872 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 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 | 3 ms | 2560 KB |
sample_02.txt | AC | 3 ms | 2560 KB |
sample_03.txt | AC | 3 ms | 2560 KB |
subtask_1_1.txt | AC | 3 ms | 2560 KB |
subtask_1_10.txt | AC | 137 ms | 3328 KB |
subtask_1_11.txt | AC | 4 ms | 2560 KB |
subtask_1_12.txt | AC | 15 ms | 2688 KB |
subtask_1_13.txt | AC | 47 ms | 2816 KB |
subtask_1_14.txt | AC | 3 ms | 2560 KB |
subtask_1_15.txt | AC | 9 ms | 2944 KB |
subtask_1_16.txt | AC | 402 ms | 9984 KB |
subtask_1_17.txt | AC | 407 ms | 9984 KB |
subtask_1_18.txt | AC | 394 ms | 9984 KB |
subtask_1_19.txt | AC | 372 ms | 9984 KB |
subtask_1_2.txt | AC | 4 ms | 2688 KB |
subtask_1_20.txt | AC | 366 ms | 15744 KB |
subtask_1_21.txt | AC | 367 ms | 15744 KB |
subtask_1_22.txt | AC | 364 ms | 15360 KB |
subtask_1_23.txt | AC | 360 ms | 13056 KB |
subtask_1_24.txt | AC | 334 ms | 9072 KB |
subtask_1_25.txt | AC | 340 ms | 9072 KB |
subtask_1_26.txt | AC | 339 ms | 9072 KB |
subtask_1_27.txt | AC | 345 ms | 9072 KB |
subtask_1_28.txt | AC | 336 ms | 15872 KB |
subtask_1_3.txt | AC | 221 ms | 7936 KB |
subtask_1_4.txt | AC | 3 ms | 2560 KB |
subtask_1_5.txt | AC | 195 ms | 3584 KB |
subtask_1_6.txt | AC | 36 ms | 3328 KB |
subtask_1_7.txt | AC | 164 ms | 3456 KB |
subtask_1_8.txt | AC | 3 ms | 2560 KB |
subtask_1_9.txt | AC | 182 ms | 8832 KB |