BZOJ folder added

Author: coderxiang

SGU/253.cpp

@@ -0,0 +1,65 @@
+/*
+ * SGU 253: Theodore Roosevelt
+ * Computational Geometry: whether a point lies in an ORDERED (counter-clockwise) convex polygon
+ *
+ *  Created on: 2012-3-31
+ *      Author: shuo
+ */
+
+#include <cstdio>
+#include <cmath>
+#include <algorithm>
+using namespace std;
+
+const double eps = 1e-15;
+const int N = 100010;
+inline int _sign(double x) { return x > eps ? 1 : (fabs(x) < eps ? 0 : -1); }
+
+struct Point { double x, y;}cv[N];
+double xmult (Point O, Point A, Point B) {
+	return ((A.x - O.x) * (B.y - O.y) - (A.y - O.y) * (B.x - O.x));
+}
+
+inline bool online (Point t, Point A, Point B) {
+	return t.x >= min (A.x, B.x) && t.x <= max (A.x, B.x) && t.y >= min (A.y, B.y) && t.y <= max (A.y, B.y);
+}
+
+// Points are listed counter-clockwisely, all points are distinct.
+bool insidePolygon (const Point cv[], int n, const Point A) {
+	if (_sign(xmult (cv[0], cv[1], A)) < 0) return false;
+	if (_sign(xmult (cv[0], cv[n-1], A)) > 0) return false;
+	int up = n - 1, low = 1;
+	while (up > low) {
+		int mid = (up + low) >> 1;
+		if (_sign(xmult (cv[0], A, cv[mid]) >= 0)) up = mid;
+		else low = mid + 1;
+	}
+	if (up == 1 && !online (A, cv[0], cv[1]) ) return false;
+	return _sign (xmult (A, cv[up - 1], cv[up])) >= 0;
+}
+
+int main ()
+{
+	int i, n, m, q;
+	scanf ("%d%d%d", &n, &m, & q);
+	for (i = 0; i < n; i++)
+		scanf ("%lf%lf", &cv[i].x, &cv[i].y);
+	int ans = 0;
+	for (; m; m--) {
+		Point tmp;
+		scanf ("%lf%lf", &tmp.x, &tmp.y);
+		if (insidePolygon (cv, n, tmp))
+			ans++;
+	}
+	return ans >= q ? printf ("YES\n") : printf ("NO\n"), 0;
+}
+
+
+
+
+
+
+
+
+
+

SGU/374.java

@@ -0,0 +1,17 @@
+import java.math.BigInteger;
+import java.util.*;
+import java.io.*;
+
+public class Solution {
+
+	
+	public static void main(String[] args) {
+		Scanner in = new Scanner (new BufferedInputStream (System.in));
+		int a, b, k;
+		a = in.nextInt(); b = in.nextInt(); k = in.nextInt();
+		BigInteger x = BigInteger.valueOf(a + b);
+		System.out.print(x.pow(k));
+
+	}
+
+}

SGU/508.java

@@ -0,0 +1,44 @@
+import java.util.*;
+import java.io.*;
+
+public class Solution {
+	
+	public static void main (String [] args) {
+		Scanner in = new Scanner (new BufferedInputStream (System.in));
+		long C[][] = new long [51][51];
+		int n, l1, l2, rho;
+		n = in.nextInt ();
+		l1 = in.nextInt (); 
+		l2 = in.nextInt (); 
+		rho = in.nextInt ();
+		int a = 0, d, b = 0, i, j;
+		
+		for (i = 0; i <= 50; ++i) {
+			C[i][i] = 1;
+			C[i][0] = 1;
+		}
+		for (i = 1; i <= 50; ++i)
+			for (j = 1; j < i; ++j)
+				C[i][j] = C[i-1][j] + C[i-1][j-1];
+	
+		boolean flag = false;
+		for (d = 1; !flag && d <= n + 1; ++d) {
+			for (a = 0; a <= n && a + d - 1 <= n; ++a){
+				b = a + d - 1;
+				double nu = 0, de = 0;
+				for (int x = l1; x <= n - l2; ++x) {
+					if (x >= a && x <= b)
+						nu += C[x][l1] * C[n-x][l2];
+					de += C[x][l1] * C[n-x][l2];
+				}
+				if (nu * 100  >= rho * de) {
+					flag = true;
+					break;
+				}
+			}
+		}
+		System.out.printf("%d %d\n", a, b);
+	}
+
+}
+

SGU/515.cpp

@@ -0,0 +1,108 @@
+#include <cstdio>
+#include <queue>
+#include <set>
+#include <vector>
+#include <cstring>
+#include <algorithm>
+
+using namespace std;
+
+const int N = 100010;
+const int M = 2 * N;
+int dis[N], pre[N], pe[N], last[N];
+bool ped[N], yy[N];
+int to[M], w[M], nxt[M], id[M];
+int en, eb[N];
+int n, m, nn;
+
+void adde (int x, int y, int t, int d) {
+	to[en] = y; w[en] = t; nxt[en] = eb[x]; id[en] = d;
+	eb[x] = en ++;
+
+	to[en] = x; w[en] = t; nxt[en] = eb[y]; id[en] = d;
+	eb[y] = en ++;
+}
+
+void Dijkstra (int s) {
+	int i, j, k;
+	memset (dis, 0x7f, sizeof (dis));
+	memset (last, 0, sizeof (last));
+	memset (ped, false, sizeof (ped));
+	dis[0] = -1; dis[s] = 0; pe[s] = 0; pre[s] = 0;
+	priority_queue <pair<pair<int,int> , int> > pq;
+	pq.push (make_pair(make_pair (0, 0), s));
+
+	int cnt = 0;
+	while (!pq.empty () && cnt < n) {
+		pair<pair<int,int>,int> hd = pq.top ();
+		pq.pop ();
+		i = hd.second;
+		if (ped[i]) continue;
+		else {
+			ped[i] = true;
+			cnt ++;
+		}
+		if (yy[i]) last[i] = i;
+		for (int e = eb[i]; e != -1; e = nxt[e]) {
+			j = to[e];
+			if (dis[i] + w[e] < dis[j] || (dis[i] + w[e] == dis[j] && dis[last[i]] > dis[last[j]])) {
+				dis[j] = dis[i] + w[e];
+				last[j] = last[i];
+				pre[j] = i; pe[j] = id[e];
+				pq.push (make_pair (make_pair(-dis[j], dis[last[j]]), j));
+			}
+		}
+	}
+}
+
+void output (int x) {
+	if (pe[x] == 0) {
+		return;
+	}
+	output (pre[x]);
+	printf ("%d ", pe[x]);
+}
+
+
+int a[N];
+
+
+int main () {
+	int i, j, k;
+	en = 0;
+	memset (eb, -1, sizeof (eb));
+
+	scanf ("%d%d", &n, &m);
+	for (int cnt = 1; cnt <= m; ++cnt) {
+		scanf ("%d%d%d", &i, &j, &k);
+		adde (i, j, k, cnt);
+	}
+	scanf ("%d", &nn);
+	for (i = 1; i <= nn; ++i) {
+		scanf ("%d", &a[i]);
+		yy[a[i]] = true;
+	}
+	Dijkstra (a[1]);
+	int sc, ma = -1;
+	for (i = 1; i <= nn; ++i) if (dis[a[i]] > ma) {
+		ma = dis[a[i]];
+		sc = a[i];
+	}
+	Dijkstra (sc);
+	int des; ma = -1;
+	for (i = 1; i <= nn; ++i) if (dis[a[i]] > ma) {
+		ma = dis[a[i]];
+		des = a[i];
+	}
+	j = des; k = 0;
+	while (j != sc) {j = pre[j]; k++;}
+	printf ("%d\n", k);
+	output (des); printf ("\n");
+	return 0;
+}
+
+
+
+
+
+

SGU/518.cpp

@@ -0,0 +1,57 @@
+/*
+ * 518.cpp
+ *
+ *  Created on: Jul 11, 2012 5:17 pm, Accepted 5:28 pm
+ *      Author: shuo
+ */
+
+#include <cstdio>
+#include <algorithm>
+
+using namespace std;
+
+const int N = 210;
+
+int a[N][N], n;
+int b[N], m;
+bool d[N][N];
+bool st[N];
+
+void DFS (int x, int y) {
+	d[x][y] = true;
+	if (y == m + 1) {
+		st[x] = true;
+		return;
+	}
+	for (int i = 1; i <= n; ++i) {
+		if (a[x][i] == b[y] && !d[i][y+1]) {
+			DFS (i, y + 1);
+		}
+	}
+}
+
+int main () {
+	int i, j, k;
+	scanf ("%d", &n);
+	for (i = 1; i <= n; ++i)
+		for (j = 1; j <= n; ++j)
+			scanf ("%d", &a[i][j]);
+	scanf ("%d", &m);
+	for (i = 1; i <= m; ++i)
+		scanf ("%d", &b[i]);
+	DFS (1, 1);
+	int ans = 0;
+	for (i = 1; i <= n; ++i) if (st[i])
+		++ans;
+	printf ("%d\n", ans);
+	for (i = 1, j = 0; i <= n; i++) if (st[i]) {
+		++ j;
+		printf ("%d%c", i, j == ans ? '\n' : ' ');
+	}
+	return 0;
+}
+
+
+
+
+

SGU/523.java

@@ -0,0 +1,41 @@
+import java.io.*;
+import java.util.*;
+
+public class Solution {
+	public static void main (String args[]) {
+		int i, j, k, n, cur;
+		int [] a = new int [101];
+		boolean [] st = new boolean [101];
+		boolean [] pos = new boolean [101];
+		Scanner in = new Scanner (new BufferedInputStream (System.in));
+		n = in.nextInt(); cur = in.nextInt ();
+		for (i = 1; i <= n; ++i) {
+			a[i] = in.nextInt ();
+			st[i] = false;
+		}
+		for (i = 1; i <= n; ++i) {
+			Arrays.fill (pos, false);
+			for (j = 1; j <= n && st[j]; ++j);
+			if (j == n + 1) break;
+			for (k = 1; k <= n; ++k) if (!st[k]) {
+				if (a[k] > cur && a[k] < a[j] || a[k] > a[j] && a[k] < cur) {
+					pos[a[k]] = true;
+					st[k] = true;
+				}
+			}
+			if (a[j] > cur) {
+				for (k = 1; k <= 100; ++k)
+					if (pos[k])
+						System.out.printf ("%d ", k);
+			}
+			else {
+				for (k = 100; k >= 1; --k)
+					if (pos[k])
+						System.out.printf ("%d ", k);
+			}
+			System.out.printf ("%d ", a[j]);
+			cur = a[j]; st[j] = true;
+		}		
+		System.out.println();
+	}
+}