Submission #1240686
Source Code Expand
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;
#define MOD 1000000007
double d[200000];
double dd[200000];
vector<vector<ll> > vv;
double f(ll p, ll parent){
double ret = 0.0;
ll c = 0;
rep(i,0,vv[p].sz){
if(vv[p][i] == parent)continue;
ret += f(vv[p][i], p);
c++;
}
if(c>0)ret = 1. + ret / c;
return d[p] = ret;
}
void f1(ll p, double a, ll parent){
double ret = 0.0;
rep(i,0,vv[p].sz){
if(vv[p][i] == parent){
ret += 1. + a;
}
else{
ret += 1. + d[vv[p][i]];
}
}
dd[p] = ret / vv[p].sz;
rep(i,0,vv[p].sz){
if(vv[p][i] == parent)continue;
if(vv[p].sz-1==0){
f1(vv[p][i], 0.,p);
}
else{
f1(vv[p][i], (ret-d[vv[p][i]]-1.)/(vv[p].sz-1),p);
}
}
}
int main() {
ll n;
cin>>n;
vector<vector<ll> > vv_(n,vector<ll>());
vv = vv_;
rep(i,0,n-1){
ll a,b;
cin>>a>>b;
a--;b--;
vv[a].pb(b);
vv[b].pb(a);
}
f(0,-1);
f1(0,0,-1);
rep(i,0,n){
printf("%20.20f\n",dd[i]);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Driving on a Tree |
User |
nmnmnmnmnmnmnm |
Language |
C++14 (GCC 5.4.1) |
Score |
800 |
Code Size |
1720 Byte |
Status |
AC |
Exec Time |
210 ms |
Memory |
23552 KB |
Judge Result
Set Name |
Subtask1 |
Subtask2 |
Subtask3 |
Score / Max Score |
190 / 190 |
220 / 220 |
390 / 390 |
Status |
|
|
|
Set Name |
Test Cases |
Subtask1 |
sub1_in1.txt, sub1_in2.txt, sub1_in3.txt |
Subtask2 |
sub2_in1.txt, sub2_in2.txt |
Subtask3 |
sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub3_in1.txt, sub3_in2.txt, sub3_in3.txt |
Case Name |
Status |
Exec Time |
Memory |
sub1_in1.txt |
AC |
1 ms |
256 KB |
sub1_in2.txt |
AC |
2 ms |
384 KB |
sub1_in3.txt |
AC |
168 ms |
16896 KB |
sub2_in1.txt |
AC |
2 ms |
384 KB |
sub2_in2.txt |
AC |
2 ms |
384 KB |
sub3_in1.txt |
AC |
210 ms |
18432 KB |
sub3_in2.txt |
AC |
138 ms |
18800 KB |
sub3_in3.txt |
AC |
175 ms |
23552 KB |