Submission #1087761

#TimeUsernameProblemLanguageResultExecution timeMemory
1087761TrinhKhanhDungMag (COCI16_mag)C++14
24 / 120
262 ms112816 KiB
#include <bits/stdc++.h> #define ll long long #define fi first #define se second #define sz(x) (int)x.size() #define ALL(v) v.begin(),v.end() #define MASK(k) (1LL << (k)) #define BIT(x, i) (((x) >> (i)) & 1) #define oo (ll)1e18 #define INF (ll)1e9 #define MOD (ll)(1e9 + 7) using namespace std; template<class T1, class T2> bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;} template<class T1, class T2> bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;} template<class T1, class T2> void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;} template<class T1, class T2> void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;} template<class T> void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());} const int MAX = 1e6 + 10; int N; vector<int> adj[MAX]; int a[MAX], f[MAX]; vector<pair<int, int>> edges; int ans; void dfs(int u, int p = -1){ int first = 0, second = 0; for(int v: adj[u]){ if(v == p) continue; dfs(v, u); if(f[v] > first){ second = first; first = f[v]; } else maximize(second, f[v]); } f[u] = first + 1; maximize(ans, first + second + 1); } void solve(){ cin >> N; for(int i = 1; i < N; i++){ int u, v; cin >> u >> v; edges.push_back(make_pair(u, v)); } int mi = INF; for(int i = 1; i <= N; i++){ cin >> a[i]; minimize(mi, a[i]); } if(mi > 1){ cout << mi << "/1\n"; return; } for(auto o: edges){ if(a[o.fi] != 1 || a[o.se] != 1) continue; adj[o.fi].push_back(o.se); adj[o.se].push_back(o.fi); } for(int i = 1; i <= N; i++) if(f[i] == 0){ dfs(i); } cout << "1/" << ans << '\n'; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); // freopen("numtable.inp","r",stdin); // freopen("numtable.out","w",stdout); solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...