oj.uz

답안 #241417

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241417 2020-06-24T07:32:42 Z ne4eHbKa Mag (COCI16_mag) C++17
120 / 120
 563 ms 109944 KB 
//{ <defines>
#include <bits/stdc++.h>
using namespace std;

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}

int md = 998244353;

inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}

int m_bpow(ll A, ll b) {
    int a = A % md;
    ll ans = 1;
    for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
        (ans *= ans) %= md;
        if(p & b)
            (ans *= a) %= md;
    }
    re ans;
}

//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 1e6 + 5;

ll p, q;

void upd(ll P, ll Q) {
    ll u = __gcd(P, Q);
    P /= u, Q /= u;
    if(p * Q <= P * q) return;
    p = P, q = Q;
}

int n, x[N];
int f[N];
vi g[N];

void upd(pii &a, int b) {
    if(a.ft < b) {
        a.sd = a.ft;
        a.ft = b;
    } ef(a.sd < b) {
        a.sd = b;
    }
}

void rec(int v = 0, int pr = -1) {
    if(v) g[v].erase(find(bnd(g[v]), pr));
    f[v] = x[v] == 1;
    for(int u : g[v]) {
        rec(u, v);
        if(f[v]) umax(f[v], f[u] + 1);
    }
}

void dfs(int v = 0, int t = 0) {
    pii z = {t, 0};
    for(int u : g[v]) upd(z, f[u]);
    upd(x[v], z.ft + z.sd + 1);
    for(int u : g[v])
        dfs(u, x[v] > 1 ? 0 : 1 + (z.ft == f[u] ? z.sd : z.ft));
}

void solve() {
    cin >> n;
    fo(n) g[i].clear();
    for(int i = 0; i < n - 1; ++i) {
        int x, y; cin >> x >> y; --x, --y;
        g[x].pb(y), g[y].pb(x);
    }
    for(int i = 0; i < n; ++i) cin >> x[i];
    p = x[0], q = 1;
    rec();
    dfs();
    cout << p << '/' << q << endl;
}

int main() {
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    for(int test = 1; test <= tests; ++test) {
		cerr << "case #" << test << endl;
        solve();
        cerr << endl;
    }
#else
//    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    solve();
#endif
    return 0;
}

Compilation message

mag.cpp: In function 'int m_bpow(ll, ll)':
mag.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
     for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
                       ~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 23812 KB Output is correct
2 Correct 525 ms 109160 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 486 ms 62832 KB Output is correct
2 Correct 365 ms 63736 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 450 ms 63840 KB Output is correct
2 Correct 84 ms 27888 KB Output is correct
3 Correct 544 ms 109944 KB Output is correct

Subtask #8
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 27896 KB Output is correct
2 Correct 494 ms 78332 KB Output is correct
3 Correct 372 ms 51576 KB Output is correct

Subtask #9
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 433 ms 60272 KB Output is correct
2 Correct 493 ms 79224 KB Output is correct

Subtask #10
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 486 ms 63224 KB Output is correct
2 Correct 451 ms 51576 KB Output is correct