Submission #245711

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
245711	2020-07-07T08:44:27 Z	leaked	Mag (COCI16_mag)	C++14	24 / 120	718 ms	248724 KB

#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout<< *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=1e6+1;
const int M=1e9+7;
pll dp[N];
ld lol[N];
ll a[N];
int n,v,u;
vector<int>g[N];
ld ans=1e18+1;
pll answ;
void dfs(int v,int p){
    dp[v]={a[v],1};
    lol[v]=a[v];
    vector<pair<ld,pair<ll,int>>>wf;
    for(auto &z : g[v]){
        if(z^p){
            dfs(z,v);
            wf.p_b({lol[z],{dp[z].f,z}});
        }
    }
    sort(all(wf));
    for(auto &z : wf){
        int u=z.s.s;
        ld nw=(dp[u].f*dp[v].f)/(ld)(dp[u].s+dp[v].s);
        if(nw<a[v]){
            lol[v]=nw;
            dp[v].f*=dp[u].f;
            dp[v].s+=dp[u].s;
        }
    }
    if(lol[v]<ans){
        ans=lol[v];
        answ=dp[v];
    }
}
signed main(){
    fast_io;
    cin>>n;
    for(int i=1;i<n;i++){
        cin>>v>>u;--v;--u;
        g[v].p_b(u);g[u].p_b(v);
    }
    for(int i=0;i<n;i++) cin>>a[i];
    dfs(0,0);
    ll gc=__gcd(answ.f,answ.s);
    cout<<answ.f/gc<<"/"<<answ.s/gc;
    return 0;
}
///stuff you should look for :
/*

6
abc
bc
c
a
da
cda

	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* read the conditions carefully
	* WRITE STUFF DOWN
*/

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	23936 KB	Output is correct
2	Correct	19 ms	23936 KB	Output is correct

Subtask #2
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	23 ms	23936 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	444 ms	150368 KB	Output isn't correct

Subtask #4
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	23808 KB	Output is correct
2	Incorrect	609 ms	248724 KB	Output isn't correct

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	718 ms	246880 KB	Output is correct

Subtask #6
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	567 ms	109220 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	601 ms	122676 KB	Output is correct
2	Incorrect	131 ms	32480 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #8
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	107 ms	32400 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	530 ms	108888 KB	Output is correct
2	Incorrect	530 ms	110520 KB	Output isn't correct

Subtask #10
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	499 ms	110796 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Submission #245711

Compilation message