Added Spoj submisions

Author: IvanIsCoding

SPOJ/ACQUIRE.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+int pointer;
+typedef pair<int,int> ii;
+vector<long long> M;
+vector<long long> B;
+bool bad(int l1,int l2,int l3){
+	return (B[l3]-B[l1])*(M[l1]-M[l2])<(B[l1]-B[l2])*(M[l3]-M[l1]);
+}
+void add(long long m,long long b){
+	M.push_back(m);
+	B.push_back(b);
+	while (M.size()>=3&&bad(M.size()-3,M.size()-2,M.size()-1))
+	{
+		M.erase(M.end()-2);
+		B.erase(B.end()-2);
+	}
+}
+long long query(long long x){
+	if (pointer>=M.size())
+		pointer=M.size()-1;
+	while (pointer<M.size()-1&&
+	  M[pointer+1]*x+B[pointer+1]<M[pointer]*x+B[pointer])
+		pointer++;
+	return M[pointer]*x+B[pointer];
+}
+int main(){
+	int M,N,i;
+	vector<ii> rect,a;
+	scanf("%d",&M);
+	for (i=0; i<M; i++){
+		int aa,bb;
+		scanf("%d %d",&aa,&bb);
+		a.push_back(make_pair(aa,bb));
+	}
+	sort(a.begin(),a.end());
+	for (i=0; i<M; i++){
+		while (rect.size()>0&&rect[rect.size()-1].second<=a[i].second) rect.pop_back();
+		rect.push_back(a[i]);
+	}
+	N = rect.size();
+	long long best;
+	add(rect[0].second,0);
+	pointer=0;
+	for (i=0; i<N; i++){
+		best=query(rect[i].first);
+		add(rect[i+1].second,best);
+	}
+	printf("%lld\n",best);
+	return 0;
+}

SPOJ/ADAAPHID.cpp

@@ -0,0 +1,57 @@
+#include <cstdio>
+#include <vector>
+using namespace std;
+typedef long long ll;
+const ll ini = 0;
+const ll fim = (1LL << 60);
+vector<ll> esq,dir,val;
+ll it,n,last;
+void update(ll pos,ll left,ll right,ll x,ll delta){
+	val[pos] += delta;
+	if(left == right) return;
+	ll mid = (left+right)/2;
+	if(x <= mid){
+		if(esq[pos] == -1){
+			esq[pos] = ++it;
+			esq.push_back(-1);
+			dir.push_back(-1);
+			val.push_back(0);
+		}
+		update(esq[pos],left,mid,x,delta);
+	}
+	else{
+		if(dir[pos] == -1){
+			dir[pos] = ++it;
+			esq.push_back(-1);
+			dir.push_back(-1);
+			val.push_back(0);
+		}
+		update(dir[pos],mid+1,right,x,delta);
+	}
+}
+ll query(ll pos,ll left,ll right,ll i,ll j){
+	if(left > right || left > j || right < i) return 0;
+	if(left >= i && right <= j){
+		return val[pos];
+	}
+	ll mid = (left+right)/2;
+	ll sinistra = (esq[pos] == -1) ? 0 : query(esq[pos],left,mid,i,j);
+	ll destra = (dir[pos] == -1) ? 0 : query(dir[pos],mid+1,right,i,j);
+	return sinistra + destra;
+}
+int main(){
+	esq.push_back(-1);
+	dir.push_back(-1);
+	val.push_back(0);
+	scanf("%lld",&n);
+	while(n--){
+		ll x,y;
+		scanf("%lld %lld",&x,&y);
+		x ^= last;
+		y ^= last;
+		update(0,ini,fim,x,y);
+		last = query(0,0,fim,0,x);
+		printf("%lld %lld\n",x,last);
+	}
+	return 0;
+}

SPOJ/ADAAPPLE.cpp

@@ -0,0 +1,155 @@
+#include <cstdio>
+#include <vector>
+#include <algorithm>
+#define MP make_pair
+#define LSOne(S) (S & (-S))
+using namespace std;
+typedef pair<int,int> ii;
+const int MAXN = 3*1e5 + 10;
+const ii NULO = MP(MAXN,MAXN);
+vector<int> grafo[MAXN];
+char entrada[MAXN];
+int dfsNum,chainNum,chainPtr,vetor[MAXN],nivel[MAXN],chainId[MAXN],chainHead[MAXN],chainPos[MAXN],bit[MAXN],pai[MAXN],tamanho[MAXN],cor[MAXN],n,q;
+ii arvore[8*MAXN],vetorzao[2*MAXN];
+void update_bit(int pos,int val){
+	while(pos < MAXN){
+		bit[pos] += val;
+		pos += LSOne(pos);
+	}
+}
+int read_bit(int pos){
+	int ans = 0;
+	while(pos > 0){
+		ans += bit[pos];
+		pos -= LSOne(pos);
+	}
+	return ans;
+}
+int query_bit(int a,int b){
+	return read_bit(b) - read_bit(a-1);
+}
+void dfs(int x,int p){
+	vetor[x] = ++dfsNum;
+	vetorzao[dfsNum] = MP(nivel[x],x);
+	tamanho[x]++;
+	for(int v : grafo[x]){
+		if(v == p) continue;
+		nivel[v] = nivel[x] + 1;
+		pai[v] = x;
+		dfs(v,x);
+		tamanho[x] += tamanho[v];
+		vetorzao[++dfsNum] = MP(nivel[x],x);
+	}
+}
+void HLD(int x,int p){
+	if(!chainHead[chainNum]){
+		chainHead[chainNum] = x;
+	}
+	chainId[x] = chainNum;
+	chainPos[x] = ++chainPtr;
+	update_bit(chainPtr,cor[x]);
+	if(tamanho[x] == 1) return;
+	int sc = -1,maximo = 0;
+	for(int v : grafo[x]){
+		if(v == p) continue;
+		if(tamanho[v] > maximo){
+			maximo = tamanho[v];
+			sc = v;
+		}
+	}
+	HLD(sc,x);
+	for(int v : grafo[x]){
+		if(v == p || v == sc) continue;
+		chainNum++;
+		HLD(v,x);
+	}
+}
+void build_seg(int pos,int left,int right){
+	if(left == right){
+		arvore[pos] = vetorzao[left];
+		return;
+	}
+	int mid = (left + right)/2;
+	build_seg(2*pos,left,mid);
+	build_seg(2*pos+1,mid+1,right);
+	arvore[pos] = min(arvore[2*pos],arvore[2*pos+1]);
+}
+ii query_seg(int pos,int left,int right,int i,int j){
+	if(left > right || left > j || right < i) return NULO;
+	if(left >= i && right <= j){
+		return arvore[pos];
+	}
+	int mid = (left+right)/2;
+	return min(query_seg(2*pos,left,mid,i,j),query_seg(2*pos+1,mid+1,right,i,j));
+}
+int LCA(int u,int v){
+	return query_seg(1,1,dfsNum,min(vetor[u],vetor[v]),max(vetor[u],vetor[v])).second;
+}
+int query_up(int u,int v){
+	int uchain,vchain;
+	vchain = chainId[v];
+	int ans = 0;
+	while(true){
+		uchain = chainId[u];
+		if(uchain == vchain){
+			ans += query_bit(chainPos[v],chainPos[u]);
+			break;
+		}
+		ans += query_bit(chainPos[chainHead[uchain]],chainPos[u]);
+		u = chainHead[uchain];
+		u = pai[u];
+	}
+	return ans;
+}
+int doQuery(int u,int v){
+	int ancestral = LCA(u,v);
+	int vertices = nivel[u] + nivel[v] + 1 - 2*nivel[ancestral];
+	int qtd = query_up(u,ancestral) + query_up(v,ancestral) - cor[ancestral];
+	if(qtd == vertices || qtd == 0) return 1;
+	return 0;
+}
+int main(){
+	scanf("%d %d",&n,&q);
+	scanf("%s",entrada);
+	for(int i=0;i<n;i++){
+		cor[i+1] = (entrada[i] == '1');
+	}
+	for(int i=1;i<n;i++){
+		int u,v;
+		scanf("%d %d",&u,&v);
+		u++;
+		v++;
+		grafo[u].push_back(v);
+		grafo[v].push_back(u);
+	}
+	pai[1] = 1;
+	dfs(1,-1);
+	build_seg(1,1,dfsNum);
+	HLD(1,-1);
+	while(q--){
+		int op;
+		scanf("%d",&op);
+		if(op == 0){
+			int i;
+			scanf("%d",&i);
+			i++;
+			if(cor[i] == 0){
+				update_bit(chainPos[i],1);
+				cor[i] = 1;
+			}
+			else{
+				update_bit(chainPos[i],-1);
+				cor[i] = 0;
+			}
+		}
+		else{
+			int a,b;
+			scanf("%d %d",&a,&b);
+			a++;
+			b++;
+			if(doQuery(a,b)) printf("YES\n");
+			else printf("NO\n");
+		}
+	}
+	return 0;
+}

SPOJ/ADABERRY.cpp

@@ -0,0 +1,103 @@
+#include <cstdio>
+#include <algorithm>
+#include <vector>
+#define LSOne(S) (S & (-S))
+using namespace std;
+const int MAXN = 2*1e5 + 10;
+const int MAX2N = 4*1e5 + 20;
+const int lo = 0;
+const int hi = 1e6;
+vector<int> grafo[MAXN],esq[MAX2N],dir[MAX2N],val[MAX2N];
+int vetor[MAX2N],numero[MAXN],ini[MAXN],fim[MAXN],dfsNum,segIt[MAX2N],n,m;
+void dfs(int x,int p){
+	ini[x] = ++dfsNum;
+	vetor[dfsNum] = numero[x];
+	for(int i = 0;i < grafo[x].size();i++){
+		int v = grafo[x][i];
+		if(v == p) continue;
+		dfs(v,x);
+	}
+	fim[x] = ++dfsNum;
+	vetor[dfsNum] = numero[x];
+}
+void update_sparse(int id,int pos,int left,int right,int x){
+	val[id][pos]++;
+	if(left == right) return;
+	int mid = (left+right)/2;
+	if(x <= mid){
+		if(esq[id][pos] == -1){
+			segIt[id]++;
+			esq[id].push_back(-1);
+			dir[id].push_back(-1);
+			val[id].push_back(0);
+			esq[id][pos] = segIt[id];
+		}
+		update_sparse(id,esq[id][pos],left,mid,x);
+	}
+	else{
+		if(dir[id][pos] == -1){
+			segIt[id]++;
+			esq[id].push_back(-1);
+			dir[id].push_back(-1);
+			val[id].push_back(0);
+			dir[id][pos] = segIt[id];
+		}
+		update_sparse(id,dir[id][pos],mid+1,right,x);
+	}
+}
+int query_sparse(int id,int pos,int left,int right,int i,int j){
+	if(left > right || left > j || right < i) return 0;
+	if(left >= i && right <= j){
+		return val[id][pos];
+	} 
+	int mid = (left + right)/2;
+	int sinistra = (esq[id][pos] == -1) ? 0 : query_sparse(id,esq[id][pos],left,mid,i,j);
+	int destra = (dir[id][pos] == -1) ? 0 : query_sparse(id,dir[id][pos],mid+1,right,i,j);
+	return sinistra + destra;
+}
+void update_bit(int posx,int posy){
+	while(posx <= dfsNum){
+		update_sparse(posx,0,lo,hi,posy);
+		posx += LSOne(posx);
+	}
+}
+int read_bit(int posx,int posy){
+	int ans = 0;
+	while(posx > 0){
+		ans += query_sparse(posx,0,lo,hi,lo,posy);
+		posx -= LSOne(posx);
+	}
+	return ans;
+}
+int query_bit(int a,int b,int c){
+	return read_bit(b,c) - read_bit(a-1,c);
+}
+int main(){
+	scanf("%d %d",&n,&m);
+	for(int i=0;i<n;i++) scanf("%d",&numero[i]);
+	for(int i=1;i<n;i++){
+		int u,v;
+		scanf("%d %d",&u,&v);
+		grafo[u].push_back(v);
+		grafo[v].push_back(u);
+	}
+	dfs(0,0);
+	//printf("DFS\n");
+	for(int i=0;i<=dfsNum+1;i++){
+		val[i].push_back(0);
+		dir[i].push_back(-1);
+		esq[i].push_back(-1);
+	}
+	//printf("Foi\n");
+	for(int i=1;i<=dfsNum;i++){
+		update_bit(i,vetor[i]);
+	}
+	while(m--){
+		int a,b;
+		scanf("%d %d",&a,&b);
+		printf("%d\n",query_bit(ini[a],fim[a],b)/2);
+		update_bit(ini[a],b);
+		update_bit(fim[a],b);
+	}
+	return 0;
+}