# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537579 | 2022-03-15T09:02:18 Z | tqbfjotld | Paths (RMI21_paths) | C++14 | 184 ms | 35916 KB |
#include <bits/stdc++.h> using namespace std; #define int long long int K; map<int,int > memo[100005]; vector<pair<int,int> > adjl[100005]; int dfs(int node, int pa, bool ig){ if (memo[node].count(pa)) return memo[node][pa]; int ans = 0; int ans2 = -999999999; int from1 = node; for (auto x : adjl[node]){ if (ig && x.first==pa) continue; auto res = dfs(x.first,node,ig)+x.second; if (res>=ans){ from1 = x.first; ans2 = ans; ans = res; } else if (res>=ans2){ ans2 = res; } } if (ig){ return memo[node][pa] = ans; } for (auto x : adjl[node]){ if (x.first==from1) memo[node][x.first] = ans2; else memo[node][x.first] = ans; } memo[node][0] = ans; return memo[node][pa]; } main(){ int n; scanf("%lld%lld",&n,&K); for (int x = 0; x<n-1; x++){ int a,b,c; scanf("%lld%lld%lld",&a,&b,&c); adjl[a].push_back({b,c}); adjl[b].push_back({a,c}); } for (int x = 1; x<=n; x++){ auto res = dfs(x,0,x==1); int ans = res; printf("%lld\n",ans); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 7252 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 7252 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 7252 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 7252 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 160 ms | 32284 KB | Output is correct |
2 | Correct | 166 ms | 35916 KB | Output is correct |
3 | Correct | 109 ms | 32176 KB | Output is correct |
4 | Correct | 156 ms | 32248 KB | Output is correct |
5 | Correct | 184 ms | 33656 KB | Output is correct |
6 | Correct | 154 ms | 32080 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 7252 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |