regular update

Author: coderxiang

Codeforces/258E_157.cpp

@@ -0,0 +1,103 @@
+#include <cstdio>
+#include <algorithm>
+#include <vector>
+#include <cstring>
+
+using namespace std;
+
+const int N = 100011;
+
+int L[N<<2], R[N<<2], d[N<<2], cnt[N<<2];
+vector<int> ad[N];
+
+inline int sz (int u) { return R[u] - L[u] + 1;}
+void build (int u, int x, int y) {
+	L[u] = x; R[u] = y; d[u] = 0; cnt[u] = 0;
+	if (x < y) {
+		int mid = (x + y) / 2;
+		build (u * 2, x, mid);
+		build (u * 2 + 1, mid + 1, y);
+	}
+}
+
+void maintain (int u) {
+	if (d[u])
+		cnt[u] = sz(u);
+	else
+		cnt[u] = L[u] == R[u] ? 0 : cnt[u<<1] + cnt[u<<1|1];
+}
+
+void update (int u, int x, int y, int v) {
+	if (x <= L[u] && y >= R[u]) {
+		d[u] += v;
+		maintain(u);
+		return;
+	}
+	
+	int mid = (L[u] + R[u]) / 2;
+	if (x <= mid)
+		update (u * 2, x, y, v);
+	if (y > mid)
+		update (u * 2 + 1, x, y, v);
+
+	maintain (u);
+	if (!d[u])
+		cnt[u] = cnt[u<<1] + cnt[u<<1|1];
+}
+
+int be[N], en[N];
+int no;
+vector<int> b[N];
+int ans[N];
+
+void DFS (int x, int pre) {
+	be[x] = ++no;
+	int i, k = ad[x].size ();
+	for (i = 0; i < k; ++i) {
+		int y = ad[x][i];
+		if (y != pre) DFS (y, x);
+	}
+	en[x] = no;
+}
+
+void cal (int x, int pre) {
+	int i, k = b[x].size ();
+	for (i = 0; i < k; ++i) 
+		update (1, be[b[x][i]], en[b[x][i]], 1);
+	
+	ans[x] = cnt[1];
+	k = ad[x].size ();
+	for (i = 0; i < k; ++i) {
+		int y = ad[x][i];
+		if (y != pre) cal (y, x);
+	}
+	k = b[x].size ();
+	for (i = 0; i < k; ++i) 
+		update (1, be[b[x][i]], en[b[x][i]], -1);
+	
+}
+int n, m;
+
+int main () {
+	int i, j, k;
+	scanf ("%d%d", &n, &m);
+	build (1, 1, n);
+
+	for (k = 1; k < n; ++k) {
+		scanf ("%d%d", &i, &j);
+		ad[i].push_back (j);
+		ad[j].push_back (i);
+	}
+	no = 0;
+	memset (ans, 0, sizeof (ans));
+	DFS (1, 0);
+	for (; m; --m) {
+		scanf ("%d%d", &i, &j);
+		b[i].push_back (i); b[i].push_back (j);
+		b[j].push_back (i); b[j].push_back (j);
+	}
+	cal (1, 0);
+	for (i = 1; i <= n; ++i)
+		printf ("%d%c", ans[i]? ans[i] - 1 : 0, i == n ? '\n' : ' ');
+	return 0;
+}

Codeforces/280A_172.cpp

@@ -0,0 +1,38 @@
+#include <cstdio>
+#include <iostream>
+#include <cstring>
+#include <cmath>
+#include <string>
+#include <vector>
+#include <map>
+#include <set>
+#include <algorithm>
+#include <queue>
+
+using namespace std;
+
+int main () {
+	long double w, h, a, p, q, x, y, b;
+	
+	scanf ("%Lf%Lf%Lf", &w, &h, &a);
+	if (w < h) swap (w, h);
+	if (a > 90) a = 180 - a;
+	if (a == 90) {
+		printf ("%.15Lf\n", h * h);
+		return 0;
+	}
+	a = a / 180 * acos(-1.0);
+	if (tan(a/2) * w < h) {
+		p = 1 + sqrt (1 + tan(a) * tan(a));
+		q = tan(a);
+		y = (h * p - w * q) / (p*p - q*q);
+		b = (h * q - w * p) / (q*q - p*p);
+		//cout << w * h - y*y*tan(a) - b*b*tan(a) << endl;
+		printf ("%.15Lf\n", w * h - y*y*tan(a) - b*b*tan(a));
+	}
+	else{
+		//cout << w * h- h * h / tan(a) - h * (w - h * (1/tan(a) + 1/sin(a))) << endl;
+		printf("%.15Lf\n", h*h/sin(a));
+	}
+	return 0;
+}

Codeforces/280B_172.cpp

@@ -0,0 +1,46 @@
+#include <cstdio>
+#include <iostream>
+#include <cstring>
+#include <string>
+#include <vector>
+#include <map>
+#include <set>
+#include <algorithm>
+#include <queue>
+
+using namespace std;
+
+const int N = 100011;
+int a[N], f[N], st[N], top;
+int n;
+
+int main () {
+	int i, j, k;
+	scanf ("%d", &n);
+	for (i = 1; i <= n; ++i)
+		scanf ("%d", &a[i]);
+
+	top = 0;
+	memset (f, -1, sizeof (f));
+	for (i = 1; i <= n; ++i) {
+		while (top > 0 && a[i] > a[st[top]]) {
+			f[i] = max (f[i], (a[i] ^ a[st[top]]));
+			top--;
+		}
+		st[++top] = i;
+	}
+	reverse (a + 1, a + n + 1);
+	reverse (f + 1, f + n + 1);
+
+
+	top = 0;
+	for (i = 1; i <= n; ++i) {
+		while (top > 0 && a[i] > a[st[top]]) {
+			f[i] = max (f[i], (a[i] ^ a[st[top]]));
+			top--;
+		}
+		st[++top] = i;
+	}
+	printf ("%d\n", *max_element (f + 1, f + n + 1));
+}
+

Codeforces/283A_174.cpp

@@ -0,0 +1,77 @@
+#include <cstdio>
+#include <algorithm>
+#include <cstring>
+
+using namespace std;
+
+const int N = 200011;
+
+long long L[N<<2], R[N<<2], s[N<<2], d[N<<2];
+
+inline long long sz (int u) {return R[u] - L[u] + 1;}
+void push_down (int u) {
+	d[u<<1] += d[u]; d[u<<1|1] += d[u]; 
+	s[u<<1] += d[u] * sz(u<<1); s[u<<1|1] += d[u] * sz(u<<1|1);
+	d[u] = 0;
+}
+
+void maintain (int u) {
+	if (L[u] == R[u]) d[u] = 0;
+	else s[u] = s[u<<1] + s[u<<1|1];
+}
+
+void build (int u, int x, int y) {
+	L[u] = x; R[u] = y; s[u] = 0; d[u] = 0;
+	if (x < y) {
+		int mid = (x + y) / 2;
+		build (u << 1, x, mid);
+		build (u << 1 | 1, mid + 1, y);
+	}
+}
+
+void add (int u, int x, int y, int t) {
+	if (x <= L[u] && y >= R[u]) {
+		s[u] += sz(u) * t; 
+		d[u] += t;
+		return;
+	}
+	push_down (u);
+	int mid = (L[u] + R[u]) / 2;
+	if (x <= mid) add (u<<1, x, y, t);
+	if (y > mid) add (u<<1|1, x, y, t);
+	maintain (u);
+}
+
+void del (int u, int x) {
+	if (L[u] == x && R[u] == x) {
+		s[u] = d[u] = 0;
+		return;
+	}
+	push_down (u);
+	int mid = (L[u] + R[u]) / 2;
+	if (x <= mid) del (u<<1, x);
+	if (x > mid) del (u<<1|1, x);
+	maintain (u);
+}
+int main () {
+	int i, j, k, n, cnt = 1;
+	build (1, 1, N);
+
+	for (scanf ("%d", &n); n; --n) {
+		scanf ("%d", &k);
+		if (k == 1) {
+			scanf ("%d%d", &j, &i);
+			add (1, 1, j, i);
+		}
+		else if (k == 2){
+			cnt++;
+			scanf ("%d", &i);
+			add (1, cnt, cnt, i);
+		}
+		else 
+			del (1, cnt--);
+		printf ("%.15lf\n", double (s[1]) / cnt);
+	}
+	return 0;
+}
+	

Codeforces/283A_174_2.cpp

@@ -0,0 +1,37 @@
+#include <cstdio>
+#include <algorithm>
+#include <cstring>
+
+using namespace std;
+
+const int N = 200011;
+
+int a[N], n, cur;
+long long ans;
+
+int main () {
+	int i, j, k;
+	a[cur = 1] = 0;
+	for (scanf ("%d", &n); n; --n) {
+		scanf ("%d", &k);
+		if (k == 1) {
+			scanf ("%d%d", &i, &j);
+			if (cur == i)
+				a[i] += j;
+			else
+				a[i] -= j;
+			ans += j * i;
+		}
+		else if (k == 2) {
+			scanf ("%d", &i);
+			a[cur] = i - a[cur];
+			a[++cur] = i; ans += i;
+		}
+		else {
+			a[cur - 1] = a[cur] - a[cur - 1];
+			ans -= a[cur--];
+		}
+		printf ("%.15lf\n", double (ans) / cur);
+	}
+	return 0;
+}