oj.uz

답안 #246030

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246030 2020-07-08T04:47:16 Z leaked Mag (COCI16_mag) C++14
108 / 120
 579 ms 167288 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=999999937;
int a[N];
int n,v,u;
pll ans={1e18,1};
int f[N];
vector<int>g[N];
void dfs(int v,int p){
    f[v]=a[v]==1;
    for(auto &z :g[v]){
        if(z^p){
            dfs(z,v);
            if(a[v]==1) f[v]=max(f[v],f[z]+1);
        }
    }
}
bool cmp(pll a,pll b){
    ll gc=a.s*b.s/__gcd(a.s,b.s);
    a.f*=gc/a.s;b.f*=gc/b.s;
    return a.f<b.f;
}
void dfs1(int v,int p,int to){
  //  ans=min(ans,{a[v],1});
    if(ans.f==1e18) ans={a[v],1};
    if(cmp({a[v],1},ans))ans={a[v],1};
//    debug()<<imie(to)<<imie(v)<<imie(ans)<<imie(f[v]);
    int mx=to;
    for(auto &z :g[v]){
        if(z^p){
            if(a[v]<=2){
                if(cmp({a[v],1+mx+f[z]},ans)) ans={a[v],1+mx+f[z]};
                mx=max(mx,f[z]);
//                    debug()<<imie(to)<<imie(v)<<imie(ans)<<imie(f[v]);

            }
            dfs1(z,v,(a[v]==1 ? to+1 : 0));
        }
    }
}
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);
    dfs1(0,0,0);
    ll gc=__gcd(ans.f,ans.s);
    cout<<ans.f/gc<<'/'<<ans.s/gc;
    return 0;
}
///stuff you should look for :
/*
	* 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

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23936 KB Output is correct
2 Correct 19 ms 23936 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23928 KB Output is correct

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 450 ms 103800 KB Output isn't correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 579 ms 167288 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 579 ms 156576 KB Output is correct

Subtask #6
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 509 ms 75900 KB Output is correct
2 Correct 362 ms 62712 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 449 ms 64708 KB Output is correct
2 Correct 85 ms 29436 KB Output is correct
3 Correct 574 ms 157304 KB Output is correct

Subtask #8
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 29176 KB Output is correct
2 Correct 486 ms 75512 KB Output is correct
3 Correct 407 ms 51704 KB Output is correct

Subtask #9
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 445 ms 74108 KB Output is correct
2 Correct 478 ms 64480 KB Output is correct

Subtask #10
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 526 ms 76408 KB Output is correct
2 Correct 385 ms 51576 KB Output is correct