#include <bits/stdc++.h>
using namespace std;
struct AIB {
int l, r;
vector<int> aib;
void init( int _l, int _r ) {
l = _l;
r = _r;
aib.clear();
aib.resize( r - l + 2 );
}
void update( int i, int x ) {
i -= l - 1;
while ( i <= r - l + 1 ) {
aib[i] += x;
i += (i & -i);
}
}
int query( int i ) {
int s = 0;
i -= l - 1;
while ( i > 0 ) {
s += aib[i];
i -= (i & -i);
}
return s;
}
} aib;
struct Tree {
struct edge {
int u, v, c;
int other( int w ) {
return u ^ v ^ w;
}
};
int n;
vector<edge> edges;
vector<vector<int>> adj;
vector<int> depth, timeIn, timeOut;
vector<vector<int>> parent;
vector<int> maxLQ, minHQ;
void resize( int _size ) {
n = _size;
edges.clear();
adj.clear();
adj.resize( n + 1 );
depth.clear();
depth.resize( n + 1 );
timeIn.clear();
timeIn.resize( n + 1 );
timeOut.clear();
timeOut.resize( n + 1 );
maxLQ.resize( n + 1 );
for ( int i = 0; i <= n; i++ )
maxLQ[i] = 0;
minHQ.resize( n + 1 );
for ( int i = 0; i <= n; i++ )
minHQ[i] = INT_MAX;
parent.clear();
parent.resize( (int)log2( n ) + 1 );
for ( int i = 0; i <= log2( n ); i++ )
parent[i].resize( n + 1 );
}
void add_edge( int u, int v, int c ) {
adj[u].push_back( edges.size() );
adj[v].push_back( edges.size() );
edges.push_back( { u, v, c } );
}
void addMaxLQ( int v, int val ) {
maxLQ[v] = max( maxLQ[v], val );
}
void addMinHQ( int v, int val ) {
minHQ[v] = min( minHQ[v], val );
}
int timee;
void dfs( int u, int p ) {
parent[0][u] = p;
timeIn[u] = ++timee;
for ( int e: adj[u] ) {
int v = edges[e].other( u ), c = edges[e].c;
if ( v == p )
continue;
depth[v] = depth[u] + c;
dfs( v, u );
maxLQ[u] = max( maxLQ[u], maxLQ[v] );
minHQ[u] = min( minHQ[u], minHQ[v] );
}
timeOut[u] = timee;
}
void init( int root ) {
timee = 0;
dfs( root, 0 );
for ( int l = 1; l <= log2( n ); l++ ) {
for ( int v = 1; v <= n; v++ )
parent[l][v] = parent[l - 1][parent[l - 1][v]];
}
}
int lca( int u, int v ) {
if ( depth[u] > depth[v] )
swap( u, v );
for ( int l = log2( n ); l >= 0; l-- ) {
if ( depth[parent[l][v]] >= depth[u] )
v = parent[l][v];
}
if ( u == v )
return v;
for ( int l = log2( n ); l >= 0; l-- ) {
if ( parent[l][u] != parent[l][v] ) {
u = parent[l][u];
v = parent[l][v];
}
}
return parent[0][v];
}
bool inSubtree( int u, int v ) {
return (timeIn[u] <= timeIn[v]) && (timeOut[v] <= timeOut[u]);
}
};
struct update {
int l, r, x;
};
const int MAX_N = 1e5;
const int MAX_M = 1e5;
const int MAX_Q = 1e5;
Tree islandTree;
int spots[MAX_M + 1], leftQ[MAX_Q + 1], rightQ[MAX_Q + 1], ans[MAX_Q + 1];
vector<update> updates[MAX_N + 2];
vector<int> queries[MAX_N + 1];
void solve( int l, int r ) {
if ( l > r )
return;
int mid = (l + r) / 2;
solve( l, mid - 1 );
solve( mid + 1, r );
vector<int> rangeSpots, virtualSpots;
virtualSpots.push_back( 0 );
for ( int i = l; i <= r; i++ ) {
rangeSpots.push_back( spots[i] );
virtualSpots.push_back( spots[i] );
}
sort( rangeSpots.begin(), rangeSpots.end(), []( int u, int v ) { return islandTree.timeIn[u] < islandTree.timeIn[v]; } );
for ( int i = 0; i < rangeSpots.size() - 1; i++ )
virtualSpots.push_back( islandTree.lca( rangeSpots[i], rangeSpots[i + 1] ) );
sort( virtualSpots.begin(), virtualSpots.end(), []( int u, int v ) { return islandTree.timeIn[u] < islandTree.timeIn[v]; } );
virtualSpots.resize( unique( virtualSpots.begin(), virtualSpots.end() ) - virtualSpots.begin() );
Tree virtualSpotsTree;
virtualSpotsTree.resize( virtualSpots.size() - 1 );
vector<int> stack;
stack.push_back( 1 );
for ( int i = 2; i < virtualSpots.size(); i++ ) {
while ( !stack.empty() && !islandTree.inSubtree( virtualSpots[stack.back()], virtualSpots[i] ) ) {
stack.pop_back();
}
virtualSpotsTree.add_edge( stack.back(), i, islandTree.depth[virtualSpots[i]] - islandTree.depth[virtualSpots[stack.back()]] );
stack.push_back( i );
}
unordered_map<int, int> valToPos;
for ( int i = 1; i < virtualSpots.size(); i++ )
valToPos[virtualSpots[i]] = i;
for ( int i = l; i <= mid; i++ )
virtualSpotsTree.addMaxLQ( valToPos[spots[i]], i );
for ( int i = mid; i <= r; i++ )
virtualSpotsTree.addMinHQ( valToPos[spots[i]], i );
virtualSpotsTree.init( valToPos[spots[mid]] );
for ( int i = l; i <= r; i++ )
updates[i].clear();
for ( auto e: virtualSpotsTree.edges ) {
if ( virtualSpotsTree.depth[e.u] > virtualSpotsTree.depth[e.v] )
swap( e.u, e.v );
int x = max( l - 1, virtualSpotsTree.maxLQ[e.v] ), y = min( r + 1, virtualSpotsTree.minHQ[e.v] );
updates[l].push_back( { mid, r, e.c } );
updates[x + 1].push_back( { mid, r, -e.c } );
updates[x + 1].push_back( { y, r, e.c } );
}
aib.init( mid, r );
for ( int i = l; i <= mid; i++ ) {
for ( update u: updates[i] ) {
aib.update( u.l, u.x );
aib.update( u.r + 1, -u.x );
}
for ( int q: queries[i] )
ans[q] = aib.query( rightQ[q] );
}
}
int main() {
int n, m, q;
cin >> n >> m >> q;
islandTree.resize( n );
for ( int i = 0; i < n - 1; i++ ) {
int u, v;
cin >> u >> v;
islandTree.add_edge( u, v, 1 );
}
for ( int i = 1; i <= m; i++ )
cin >> spots[i];
for ( int i = 1; i <= q; i++ ) {
cin >> leftQ[i] >> rightQ[i];
queries[leftQ[i]].push_back( i );
}
islandTree.init( 1 );
solve( 1, m );
for ( int i = 1; i <= q; i++ )
cout << ans[i] + 1 << "\n";
return 0;
}
Compilation message
tourism.cpp: In function 'void solve(int, int)':
tourism.cpp:173:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
173 | for ( int i = 0; i < rangeSpots.size() - 1; i++ )
| ~~^~~~~~~~~~~~~~~~~~~~~~~
tourism.cpp:183:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
183 | for ( int i = 2; i < virtualSpots.size(); i++ ) {
| ~~^~~~~~~~~~~~~~~~~~~~~
tourism.cpp:192:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
192 | for ( int i = 1; i < virtualSpots.size(); i++ )
| ~~^~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4956 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
4956 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4956 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
4956 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
4956 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4956 KB |
Output is correct |
| 2 |
Incorrect |
750 ms |
44848 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4956 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4956 KB |
Output is correct |
| 3 |
Correct |
5 ms |
5212 KB |
Output is correct |
| 4 |
Runtime error |
101 ms |
32532 KB |
Execution killed with signal 11 |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4956 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
4956 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
