#include <vector> 
#include <algorithm>
#include <cstdio> 

using namespace std; 

typedef long long ll;
typedef vector<int> vi;

const int LOG = 17;
const int N = 1 << LOG; 

int F[N]; 

void add(int x, int val) { 
	for(; x < N; x += x & -x) F[x] += val;
}

int sum(int x) {
	int ret = 0;
	for(; x; x -= x & -x) ret += F[x]; 
	return ret;
}

vi simulateCollapse(int n, vi T, vi X, vi Y, vi W, vi P) {
	vi ANS(W.size());
	vi I(W.size());

	for(int i = 0; i < (int) T.size(); ++i) {
		++X[i];
		++Y[i];
		if(X[i] > Y[i]) swap(X[i], Y[i]);
	}

	for(int i = 0; i < W.size(); ++i) I[i] = i;
	sort(I.begin(), I.end(), [&W](int a, int b) { return W[a] < W[b]; }); 

	int e = 0;
	for(int j = 0, k = 0; k < W.size(); ++k) {
		int i = I[k];
		for(; j < W[i]; ++j) {
			int x = T[j] ? -1 : 1;
			e += x;
//			printf("{%d, %d] += %d\n", X[j], Y[j], x);
			add(X[j], x);
			add(Y[j], -x);
		}
//		printf("ANS[%d] = %d (%d)\n", i, n - e + sum(P[i]), sum(P[i]));
		ANS[i] = n - (e - sum(P[i] + 1));
	}
	return ANS;
}