# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384678 | zoooma13 | Mag (COCI16_mag) | C++14 | 2722 ms | 157864 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;
int n ,ans = 0;
vector <vector<int>> adj;
vector <int> x;
int dfs(int u ,int p=-1){
cout << u << endl;
int mx = 0 ,mx2 = 0;
for(int&v : adj[u]) if(v != p){
int r = dfs(v ,u);
if(r > mx){
mx2 = mx;
mx = r;
}else if(r > mx2){
mx2 = r;
}
}
if(x[u] == 1){
ans = max(ans ,1+mx+mx2);
return mx+1;
}
return 0;
}
int main()
{
scanf("%d",&n);
adj.resize(n+1);
x.resize(n+1);
for(int a,b,i=1; i<n; i++){
scanf("%d%d",&a,&b);
adj[a].push_back(b);
adj[b].push_back(a);
}
for(int i=1; i<=n; i++)
scanf("%d",&x[i]);
dfs(1);
if(ans)
cout << "1/" << ans << endl;
else
cout << *min_element(x.begin()+1 ,x.end()) << "/1" << endl;
}
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... |
# | 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... |