제출 #1308372

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1308372		minh30082008	Tourism (JOI23_tourism)	C++20	28 / 100	5093 ms	27268 KiB

tourism

#include<bits/stdc++.h>
#define fi first
#define se second
#define FOR(i, k, n) for(int i = k; i <= n; i++)
#define FOR1(i, k, n) for(int i = k; i >= n; i--)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
#define re return 0
#define mii map<int, int>
#define input "BALLOON.inp"
#define output "BALLOON.out"
#define rf 	freopen(input, "r", stdin); freopen(output, "w", stdout)
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
const int base = 998244353;
const int base1 = 31;
const int SZ = 320;
const ll INF = 1e18;
void add(int &a, int b) 
{
	a += b; 
	if(a >= mod) a -= mod; 
	if(a < 0) a += mod; 
}
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r)
{
	return uniform_int_distribution<int>(l, r) (rd);
}
int a[maxn], cnt[maxn], block[maxn];
struct que{
	int l, r, id;
} query[maxn];
vi euler;
int st[maxn], en[maxn], lg[maxn];
int depth[maxn], lca[20][maxn];
vi adj[maxn];
bool cmp(que x, que y)
{
	if(block[x.l] == block[y.l])
		return x.r < y.r;
	return x.l < y.l;
}
void DFS(int u, int par)
{
	euler.pb(u);
	st[u] = euler.size() - 1;
	for(auto v : adj[u])
	{
		if(v == par)
			continue;
		depth[v] = depth[u] + 1;
		DFS(v, u);
		euler.pb(u);
	}
	en[u] = euler.size() - 1;
}
int LCA(int l, int r)
{
	int k = lg[r - l + 1];
	if(depth[lca[k][l]] < depth[lca[k][r - (1 << k) + 1]])
		return lca[k][l];
	return lca[k][r - (1 << k) + 1];	
}
struct shape{
	int x;
	bool operator <(const shape &t) const{
		return st[x] < st[t.x];
	}
};
set<shape> s;
int get(int u, int v)
{
	int lca = LCA(min(st[u], st[v]), max(st[u], st[v]));
	return depth[u] - depth[lca] + depth[v] - depth[lca];
}
int kq[maxn];
bool cmp1(int x, int y)
{
	return st[x] < st[y];
}
int main()
{
	fastio;
	int n, m, q;
	cin >> n >> m >> q;
	FOR(i, 1, n - 1)
	{
		int u, v;
		cin >> u >> v;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	FOR(i, 1, m)
		cin >> a[i];
	FOR(i, 1, q)
	{
		cin >> query[i].l >> query[i].r;
		query[i].id = i;
	}
	FOR(i, 1, m)
		block[i] = (i - 1) / SZ + 1;
	sort(query + 1, query + 1 + q, cmp);
	DFS(1, 0);
	FOR(i, 0, (int)euler.size() - 1)
		lca[0][i] = euler[i];
	FOR(j, 1, 19)
		FOR(i, 0, (int)euler.size() - (1 << j))
			if(depth[lca[j - 1][i]] < depth[lca[j - 1][i + (1 << (j - 1))]])
				lca[j][i] = lca[j - 1][i];
			else
				lca[j][i] = lca[j - 1][i + (1 << (j - 1))];
	FOR(i, 1, (int)euler.size())
		lg[i] = __lg(i);
	int l = 1, r = 0;
	int ans = 0;
	vi vv;
	FOR(i, 1, n)
		vv.pb(i);
	sort(vv.begin(), vv.end(), cmp1);
	FOR(i, 1, q)
	{
		while(r < query[i].r)
		{
			r++;
			cnt[a[r]]++;
			if(cnt[a[r]] > 1)
				continue;
			shape tmp;
			tmp.x = a[r];
			if(s.empty())
			{
				s.insert(tmp);
				continue;
			}
			auto ri = s.lower_bound(tmp);
			auto le = ri;
			if(ri == s.end())
				le = --s.end(), ri = s.begin();
			else
				if(ri == s.begin())
					le = --s.end();
				else
					le = ri, --le;
			ans -= get((*le).x, (*ri).x);
			ans += get(a[r], (*le).x);
			ans += get(a[r], (*ri).x);
			s.insert(tmp);
 		}
		while(l > query[i].l)
		{
			--l;
			cnt[a[l]]++;
			if(cnt[a[l]] > 1)
				continue;
			shape tmp;
			tmp.x = a[l];
			if(s.empty())
			{
				s.insert(tmp);
				continue;
			}
			auto ri = s.lower_bound(tmp);
			auto le = ri;
			if(ri == s.end())
				le = --s.end(), ri = s.begin();
			else
				if(ri == s.begin())
					le = --s.end();
				else
					le = ri, --le;
			ans -= get((*le).x, (*ri).x);
			ans += get(a[l], (*le).x);
			ans += get(a[l], (*ri).x);
			s.insert(tmp);
		}
		while(r > query[i].r)
		{
			cnt[a[r]]--;
			if(cnt[a[r]])
			{
				r--;
				continue;
			}
			shape tmp;
			tmp.x = a[r];
			if(s.size() == 1)
				s.erase(tmp);
			tmp.x = a[r];
			auto ri = s.lower_bound(tmp);
			auto le = ri;
			if(ri == --s.end())
			{
				ri = s.begin();
				--le;
			}
			else
				if(ri == s.begin())
				{
					le = --s.end();
					++ri;
				}
				else
					--le, ++ri;
			ans -= get((*le).x, a[r]);
			ans -= get((*ri).x, a[r]);
			ans += get((*ri).x, (*le).x);
			s.erase(tmp);
			r--;
		}
		while(l < query[i].l)
		{
			cnt[a[l]]--;
			if(cnt[a[l]])
			{
				l++;
				continue;
			}
			shape tmp;
			tmp.x = a[l];
			if(s.size() == 1)
				s.erase(tmp);
			tmp.x = a[l];
			auto ri = s.lower_bound(tmp);
			auto le = ri;
			if(ri == --s.end())
			{
				ri = s.begin();
				--le;
			}
			else
				if(ri == s.begin())
				{
					le = --s.end();
					++ri;
				}
				else
					--le, ++ri;
			ans -= get((*le).x, a[l]);
			ans -= get((*ri).x, a[l]);
			ans += get((*ri).x, (*le).x);
			s.erase(tmp);
			l++;
		}
		kq[query[i].id] = ans / 2 + 1;
	}
	FOR(i, 1, q)
		cout << kq[i] << "\n";
	re;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 7
• Subtask 4: 18 / 18
• Subtask 5: 0 / 24
• Subtask 6: 0 / 41