Submission #1119013

#	Time	Username	Problem	Language	Result	Execution time	Memory
1119013		vjudge1	Synchronization (JOI13_synchronization)	C++17	100 / 100	378 ms	43648 KiB

synchronization

#include <bits/stdc++.h>
 
#define                int  long long
#define                pii  pair<int, int>
#define                 fi  first
#define                 se  second
#define                 ld  long double
#define                 vi  vector<int>
#define                vii  vector<vector<int>>
#define             all(v)  (v).begin(), (v).end()
#define       rep(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i)
#define       per(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i)
 
using namespace std;
 
const int MOD = 1e9 + 7;
 
int add(int a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
  return a;
}
 
int mul(int a, int b) {
  (a *= b) %= MOD;
  return a;
}
 
int ceil(int x, int y) {
  return (x + y - 1) / y;
}
 
int bin_pow(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = res * x % MOD;
    x = x * x % MOD;
    y >>= 1;
  }
  return res;
}
 
template<class T> bool minimize(T& a, T b) {
  if (a > b) return a = b, true;
  return false;
}
 
template<class T> bool maximize(T& a, T b) {
  if (a < b) return a = b, true;
  return false;
}
 
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
 
const int INF = 1e17;
const int maxn = 2e5 + 5;
const int BASE = 1e6;
const int LG = 17;
 
// thay vì ta lưu thông tin trên các nút đang liên thông nhau thì ta chỉ cần lưu trên một nút cố định là đc
// đây là một trick để lưu
 
int n, m, q, timeDfs;
int fen[maxn + 5];
int tin[maxn + 5], tout[maxn + 5];
int up[maxn + 5][LG + 5];
int h[maxn + 5], res[maxn + 5], data_save[maxn + 5];
 
vector<int> g[maxn + 5];
vector<pair<int, int>> edge(maxn + 5);
 
void dfs(int u, int p) {
  tin[u] = ++timeDfs;
  for (int v : g[u]) {
	if (v == p) continue;
	up[v][0] = u;
	h[v] = h[u] + 1;
	dfs(v, u);
  }
  tout[u] = timeDfs;
}
 
void upd(int v, int x) {
  for (; v <= n; v += v & (-v))
	fen[v] += x;
}
 
int get(int v) {
  int ans = 0;
  for (; v; v -= v & (-v))
	ans += fen[v];
  return ans;
}
 
int go_up(int u) {
  for (int j = LG; ~j; --j) {
	if ((1ll << j) > h[u]) continue;
	int p = up[u][j];
	if (h[u] - h[p] == get(tin[u]) - get(tin[p]))
	  u = up[u][j];
  }
  return u;
}
 
void solve(int tc) {
	
  cin >> n >> m >> q;
	
  for (int i = 1; i < n; ++i) {
	cin >> edge[i].fi >> edge[i].se;
	g[edge[i].fi].push_back(edge[i].se);
	g[edge[i].se].push_back(edge[i].fi);
  }
	
  dfs(1, 0);
  up[1][0] = 1;
 
  for (int j = 1; j <= LG; ++j) 
	for (int i = 1; i <= n; ++i)
	  up[i][j] = up[up[i][j - 1]][j - 1];
	
  for (int i = 1; i < n; ++i) {
	int u = edge[i].fi;
	int v = edge[i].se;
	if (h[u] > h[v]) 
	  swap(edge[i].fi, edge[i].se);
  }
	
  vector<int> status(n + 1, 0);
  for (int i = 1; i <= n; ++i) res[i] = 1;
 
  for (int i = 1; i <= m; ++i) {
		
	int d; cin >> d;
	int u = edge[d].first, v = edge[d].second;
	int par = go_up(u);
		
	status[d] ^= 1;
		
	if (status[d]) {
	  res[par] += res[v] - data_save[d];
	  upd(tin[v], 1);
	  upd(tout[v] + 1, -1);
	} else {
	  res[v] = res[par];
	  data_save[d] = res[par];
	  upd(tin[v], -1);
	  upd(tout[v] + 1, 1);
	}
  }
 
  for (int i = 1; i <= q; ++i) {
	int u; cin >> u;
	u = go_up(u);
	cout << res[u] << ' ';
  }
}
 
signed main() {
 
  ios_base::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);
 
  int tc = 1;
  //cin >> tc;
 
  for (int i = 1; i <= tc; ++i) {
    solve(i);
  }
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 10 / 10
• Subtask 4: 20 / 20
• Subtask 5: 40 / 40