#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>
#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9
// more abusive notation (use at your own risk):
//#define int ll
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */
// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7
void setIO(const string& str) {// fast input/output
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
if (str.empty()) return;
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
int N;
vi x;
vc<vi> adj;
vi dp1, dp2, up, p;
void dfs(int v, int par) {
p[v] = par;
pqg<int> pq;
int sum = 0;
fch(u, adj[v]) if (u != par) {
if (x[u] == 1) up[u] = up[v] + 1;
dfs(u, v);
pq.push(dp1[u]);
if (x[v] == 1) {
ckmax(dp1[v], dp1[u] + 1);
}
sum += dp1[u];
while (sz(pq) > 2) {
sum -= pq.top();
pq.pop();
}
}
if (x[v] == 2) {
ckmax(dp2[v], sum + 1);
}
}
void upd(pll& pp, pll q) {
if ((ll)pp.ff * q.ss > (ll)q.ff * pp.ss) {
pp = q;
}
}
signed main() { // TIME YOURSELF !!!
setIO("");
cin >> N;
adj.rsz(N+1);
for (int i = 0; i < N-1; ++i) {
int a, b;
cin >> a >> b;
adj[a].PB(b);
adj[b].PB(a);
}
x.rsz(N+1), dp1.rsz(N+1, 0), dp2.rsz(N+1, 0), up.rsz(N+1, 0), p.rsz(N+1, -1);
pll pq = {(ll)1e12, 1}; // assume answer is 0 at first
for (int i = 1; i <= N; ++i) {
cin >> x[i];
upd(pq, {x[i], 1});
if (x[i] == 1) {
dp1[i] = 1;
up[i] = 1;
} else if (x[i] == 2) {
dp2[i] = 1;
}
}
dfs(1, -1);
for (int i = 1; i <= N; ++i) {
if (dp1[i] != 0) {
upd(pq, {1, dp1[i] + (p[i] != -1 ? up[p[i]] : 0)});
}
}
for (int i = 1; i <= N; ++i) {
if (x[i] == 2) upd(pq, {2, dp2[i]});
if (p[i] != -1) {
int mx = 0;
fch(u, adj[i]) {
ckmax(mx, dp1[u]);
}
if (x[i] == 2) upd(pq, {2, mx + 1 + (p[i] != -1 ? up[p[i]] : 0)});
}
}
for (int i = 1; i <= N; ++i) {
int sum = 0;
pqg<int> pg;
fch(u, adj[i]) if (u != p[i]) {
sum += dp1[u];
pg.push(dp1[u]);
while (sz(pg) > 2) {
sum -= pg.top();
pg.pop();
}
}
if (x[i] == 1) {
upd(pq, {1, 1 + sum});
}
}
cout << pq.ff << '/' << pq.ss << '\n';
return 0;
}
// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler
Compilation message
mag.cpp: In function 'void setIO(const string&)':
mag.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
88 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mag.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
89 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
242 ms |
116080 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
354 ms |
213644 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
370 ms |
210376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
262 ms |
74144 KB |
Output is correct |
| 2 |
Correct |
202 ms |
54868 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
225 ms |
75232 KB |
Output is correct |
| 2 |
Correct |
34 ms |
7824 KB |
Output is correct |
| 3 |
Correct |
324 ms |
215632 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
44 ms |
7960 KB |
Output is correct |
| 2 |
Correct |
258 ms |
75460 KB |
Output is correct |
| 3 |
Correct |
198 ms |
37968 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
223 ms |
70088 KB |
Output is correct |
| 2 |
Correct |
268 ms |
73296 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
250 ms |
75776 KB |
Output is correct |
| 2 |
Correct |
203 ms |
38032 KB |
Output is correct |
