# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
716461 | ajab_01 | Dynamic Diameter (CEOI19_diameter) | C++17 | 5052 ms | 15008 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>
using namespace std;
#define int long long
const int N = 1e5 + 5;
vector<pair<pair<int , int> , int> > edge;
vector<pair<int , int> > g[N];
int dp[N][2] , level[N] , d , e , n , q , w , last , star = -1;
bool ch = 1;
multiset<int , greater<int>> st;
void dfs(int ver , int par){
for(auto i : g[ver]){
int uu = i.first , ww = i.second;
if(uu == par) continue;
level[uu] = level[ver] + ww;
dfs(uu , ver);
}
}
void cal(){
for(int i = 1 ; i <= n ; i++) g[i].clear();
for(auto i : edge){
int U = i.first.first , V = i.first.second , W = i.second;
g[U].push_back({V , W});
g[V].push_back({U , W});
}
dfs(1 , 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |