#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>,
rb_tree_tag, tree_order_statistics_node_update>;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using db = double;
using str = string; // yay python!
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
#define tcT template<class T
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
// pairs
#define mp make_pair
#define f first
#define s second
// vectors
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const int IINF = 1e9;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
// helper funcs
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x))
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
tcT> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
#define tcTU tcT, class U
tcTU> T fstTrue(T lo, T hi, U f) {
hi ++; assert(lo <= hi); // assuming f is increasing
while (lo < hi) { // find first index such that f is true
T mid = lo+(hi-lo)/2;
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
lo --; assert(lo <= hi); // assuming f is decreasing
while (lo < hi) { // find first index such that f is true
T mid = lo+(hi-lo+1)/2;
f(mid) ? lo = mid : hi = mid-1;
}
return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
auto it = t.find(u); assert(it != end(t));
t.erase(u); } // element that doesn't exist from (multi)set
// INPUT
#define tcTUU tcT, class ...U
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(vector<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);
tcT> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }
tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(vector<T>& x) { trav(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { trav(a,x) re(a); }
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
#ifdef LOCAL
return b ? "true" : "false";
#else
return ts((int)b);
#endif
}
tcT> str ts(complex<T> c) {
stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
str res = ""; F0R(i,SZ) res += char('0'+b[i]);
return res; }
tcTU> str ts(pair<T,U> p);
tcT> str ts(T v) { // containers with begin(), end()
#ifdef LOCAL
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
#else
bool fst = 1; str res = "";
for (const auto& x: v) {
if (!fst) res += " ";
fst = 0; res += ts(x);
}
return res;
#endif
}
tcTU> str ts(pair<T,U> p) {
#ifdef LOCAL
return "("+ts(p.f)+", "+ts(p.s)+")";
#else
return ts(p.f)+" "+ts(p.s);
#endif
}
// OUTPUT
tcT> void pr(T x) { cout << ts(x); }
tcTUU> void pr(const T& t, const U&... u) {
pr(t); pr(u...); }
void ps() { pr("\n"); } // print w/ spaces
tcTUU> void ps(const T& t, const U&... u) {
pr(t); if (sizeof...(u)) pr(" "); ps(u...); }
// DEBUG
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
cerr << ts(t); if (sizeof...(u)) cerr << ", ";
DBG(u...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
<< __FUNCTION__ << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
#define dbg(...) 0
#define chk(...) 0
#endif
// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
unsyncIO();
// cin.exceptions(cin.failbit);
// throws exception when do smth illegal
// ex. try to read letter into int
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int depth[131072], par[131072];
template<class T, int SZ> struct LazySeg {
static_assert(pct(SZ) == 1); // SZ must be power of 2
const T ID = 0; T comb(T a, T b) { return a+b; }
T seg[2*SZ], lazy[2*SZ];
LazySeg() { F0R(i,2*SZ) seg[i] = ID, lazy[i] = -1; }
void push(int ind, int L, int R) { /// modify values for current node
if(lazy[ind] != -1){
seg[ind] = (R-L+1)*lazy[ind]; // dependent on operation
if (L != R) F0R(i,2) lazy[2*ind+i] = lazy[ind]; /// prop to children
}
lazy[ind] = -1;
} // recalc values for current node
void pull(int ind) { seg[ind] = comb(seg[2*ind],seg[2*ind+1]); }
void build() { ROF(i,1,SZ) pull(i); }
void upd(int lo,int hi,T inc,int ind=1,int L=0, int R=SZ-1) {
push(ind,L,R); if (hi < L || R < lo) return;
if (lo <= L && R <= hi) {
lazy[ind] = inc; push(ind,L,R); return; }
int M = (L+R)/2; upd(lo,hi,inc,2*ind,L,M);
upd(lo,hi,inc,2*ind+1,M+1,R); pull(ind);
}
T query(int lo, int hi, int ind=1, int L=0, int R=SZ-1) {
push(ind,L,R); if (lo > R || L > hi) return ID;
if (lo <= L && R <= hi) return seg[ind];
int M = (L+R)/2;
return comb(query(lo,hi,2*ind,L,M),query(lo,hi,2*ind+1,M+1,R));
}
};
template<int SZ, bool VALS_IN_EDGES> struct HLD {
int N; vi adj[SZ];
int root[SZ], sz[SZ], info[SZ], ti;
int anc[SZ][20];
int pos[SZ]; vi rpos; // rpos not used, but could be useful
void ae(int x, int y) { adj[x].pb(y), adj[y].pb(x); }
void dfsSz(int x) {
sz[x] = 1;
trav(y,adj[x]) {
par[y] = x; depth[y] = depth[x]+1;
adj[y].erase(find(all(adj[y]),x)); // remove parent from adj list
dfsSz(y); sz[x] += sz[y];
if (sz[y] > sz[adj[x][0]]) swap(y,adj[x][0]);
}
}
void dfsHld(int x) {
pos[x] = ti++; rpos.pb(x);
trav(y,adj[x]) {
root[y] = (y == adj[x][0] ? root[x] : y);
dfsHld(y); }
}
void init(int _N, int R = 0) { N = _N;
par[R] = depth[R] = ti = 0; dfsSz(R);
root[R] = R; dfsHld(R);
fill(info, info + SZ, 1);
F0R(a, N)
anc[a][0] = par[a];
F0R(a, N)
FOR(b, 1, 20)
anc[a][b] = anc[anc[a][b - 1]][b - 1];
}
LazySeg<ll,SZ> tree; // segtree for ancestor
template <class BinaryOp>
void processPath(int x, int y, BinaryOp op) {
for (; root[x] != root[y]; y = par[root[y]]) {
if (depth[root[x]] > depth[root[y]]) swap(x,y);
op(pos[root[y]],pos[y]); }
if (depth[x] > depth[y]) swap(x,y);
op(pos[x]+VALS_IN_EDGES,pos[y]);
}
void modifyPath(int x, int y, int v) {
processPath(x,y,[this,&v](int l, int r) {
tree.upd(l,r,v); }); }
ll queryPath(int x, int y) {
ll res = 0; processPath(x,y,[this,&res](int l, int r) {
res += tree.query(l,r); });
return res; }
int getroot(int x){ // 1 = root, 0 = normal
if(queryPath(x, x) > 0)
return x;
R0F(a, 20)
if(queryPath(anc[x][a], x) == 0)
x = anc[x][a];
return anc[x][0];
}
void setroot(int x, int v) {
modifyPath(x, x, v);
}
int getnum(int x){
return info[x];
}
void setnum(int x, ll v){
info[x] = v;
}
};
vpi edg;
bool on[131072];
ll last[131072];
int main(){
setIO();
HLD<131072, false> l;
int N, M, Q;
cin >> N >> M >> Q;
F0R(a, N - 1){
int X, Y;
cin >> X >> Y;
X--, Y--;
l.ae(X, Y);
edg.pb({X, Y});
}
l.init(N);
F0R(a, N + 10)
l.tree.upd(a, a, 1);
F0R(a, M){
int D;
cin >> D;
D--;
if(on[D]){
on[D] = false;
int lo = edg[D].f, hi = edg[D].s;
if(depth[lo] < depth[hi])
swap(lo, hi);
int r = l.getroot(hi);
last[D] = l.getnum(r);
l.setroot(lo, 1);
l.setnum(lo, last[D]);
}
else{
on[D] = true;
int lo = edg[D].f, hi = edg[D].s;
if(depth[lo] < depth[hi])
swap(lo, hi);
int r = l.getroot(hi);
l.setroot(lo, 0);
int nval = l.getnum(r) + l.getnum(lo) - last[D];
l.setnum(r, nval);
}
}
while(Q--){
int x;
cin >> x;
x--;
cout << l.getnum(l.getroot(x)) << endl;
}
// you should actually read the stuff at the bottom
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/
Compilation message
synchronization.cpp: In function 'void setIn(str)':
synchronization.cpp:190:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
190 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
synchronization.cpp: In function 'void setOut(str)':
synchronization.cpp:191:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
191 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
8044 KB |
Output is correct |
| 2 |
Correct |
5 ms |
8044 KB |
Output is correct |
| 3 |
Correct |
5 ms |
8044 KB |
Output is correct |
| 4 |
Correct |
5 ms |
8044 KB |
Output is correct |
| 5 |
Correct |
6 ms |
8044 KB |
Output is correct |
| 6 |
Correct |
13 ms |
8300 KB |
Output is correct |
| 7 |
Correct |
114 ms |
9836 KB |
Output is correct |
| 8 |
Correct |
124 ms |
9964 KB |
Output is correct |
| 9 |
Correct |
123 ms |
9836 KB |
Output is correct |
| 10 |
Correct |
1629 ms |
26084 KB |
Output is correct |
| 11 |
Incorrect |
1635 ms |
26220 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
677 ms |
27940 KB |
Output is correct |
| 2 |
Correct |
627 ms |
27616 KB |
Output is correct |
| 3 |
Correct |
419 ms |
32480 KB |
Output is correct |
| 4 |
Correct |
410 ms |
32224 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
8044 KB |
Output is correct |
| 2 |
Correct |
5 ms |
8044 KB |
Output is correct |
| 3 |
Correct |
6 ms |
8044 KB |
Output is correct |
| 4 |
Correct |
6 ms |
8044 KB |
Output is correct |
| 5 |
Correct |
6 ms |
8044 KB |
Output is correct |
| 6 |
Correct |
15 ms |
8300 KB |
Output is correct |
| 7 |
Correct |
109 ms |
10604 KB |
Output is correct |
| 8 |
Correct |
1358 ms |
33376 KB |
Output is correct |
| 9 |
Correct |
1343 ms |
33144 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1359 ms |
33408 KB |
Output is correct |
| 2 |
Correct |
1172 ms |
32900 KB |
Output is correct |
| 3 |
Correct |
1190 ms |
32992 KB |
Output is correct |
| 4 |
Correct |
1192 ms |
33032 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
8044 KB |
Output is correct |
| 2 |
Correct |
5 ms |
8044 KB |
Output is correct |
| 3 |
Correct |
5 ms |
8044 KB |
Output is correct |
| 4 |
Incorrect |
8 ms |
8044 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
