#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;
#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()
cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;
template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;
cl N = 7e4 + 7;
ll par [N], L [N], R [N], ans [N], n, m;
vector <array <ll, 2>> aj [N];
vector <ll> adj [N], vec;
set <ll> Mn [N], Mx [N];
void dfs (cl &v = 1, cl &pr = 0) {
par[v] = pr; L[v] = -inf, R[v] = inf; ans[v] = -1;
for (auto &u : adj[v]) if (u != pr) {
dfs(u, v);
if (SZ(Mx[v]) < SZ(Mx[u])) Mx[v].swap(Mx[u]);
for (auto &x : Mx[u]) {
if (Mx[v].count(x)) Mx[v].erase(x);
else Mx[v].insert(x);
}
if (SZ(Mn[v]) < SZ(Mn[u])) Mn[v].swap(Mn[u]);
for (auto &x : Mn[u]) {
if (Mn[v].count(x)) Mn[v].erase(x);
else Mn[v].insert(x);
}
}
if (!Mx[v].empty()) R[v] = *Mx[v].begin();
if (!Mn[v].empty()) L[v] = *Mn[v].rbegin();
}
void DFS () {
array <ll, N> deg; array <bool, N> mark; set <pll> st;
for (ll i = 0; i < m; i++) st.insert({deg[i] = SZ(aj[i]), i});
for (ll x; !st.empty();) {
x = st.begin()->sc; st.erase(st.begin());
for (auto [y, v] : aj[x]) if (!mark[v]) {
mark[v] = 1;
ans[v] = x;
if (x != y) st.erase({deg[y], y}), st.insert({--deg[y], y});
break;
}
}
}
int main ()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>> n;
for (ll i = 1, v, u; i < n; i++) {
cin>> v >> u;
adj[v].push_back(u);
adj[u].push_back(v);
}
cin>> m;
for (ll i = 0, v, u, x; i < m; i++) {
char tp; cin>> tp >> v >> u >> x;
vec.push_back(x);
if (tp == 'm') Mn[v].insert(x), Mn[u].insert(x);
else Mx[v].insert(x), Mx[u].insert(x);
}
dfs();
sort(All(vec));
for (ll v = 2; v <= n; v++) {
if (L[v] >= 0) L[v] = lower_bound(All(vec), L[v]) - vec.begin();
if (R[v] < mod) R[v] = lower_bound(All(vec), R[v]) - vec.begin();
if (0 <= L[v] && R[v] <= m) { aj[L[v]].push_back({R[v], v}); aj[R[v]].push_back({L[v], v}); }
else if (0 <= L[v]) aj[L[v]].push_back({L[v], v});
else if (R[v] <= m) aj[R[v]].push_back({R[v], v});
}
DFS();
for (ll v = 2; v <= n; v++) {
if (ans[v] == -1) ans[v] = max(0, L[v]);
else ans[v] = vec[ans[v]];
cout<< v << ' ' << par[v] << ' ' << ans[v] << '\n';
}
cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
/*
4
1 2
2 3
3 4
3
M 1 2 1
m 1 4 0
M 2 3 100
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
10192 KB |
Output is correct |
| 2 |
Correct |
6 ms |
10188 KB |
Output is correct |
| 3 |
Correct |
6 ms |
10188 KB |
Output is correct |
| 4 |
Correct |
6 ms |
10188 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
200 ms |
30228 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
105 ms |
18612 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
10192 KB |
Output is correct |
| 2 |
Correct |
6 ms |
10188 KB |
Output is correct |
| 3 |
Correct |
6 ms |
10188 KB |
Output is correct |
| 4 |
Correct |
6 ms |
10188 KB |
Output is correct |
| 5 |
Incorrect |
200 ms |
30228 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
