test

Author: coderxiang

SGU/218.java

@@ -0,0 +1,73 @@
+import java.io.BufferedInputStream;
+import java.util.Arrays;
+import java.util.Scanner;
+
+
+public class Solution {
+	
+	final static int N = 511;
+	static int match[] = new int[N];
+	static boolean st[] = new boolean [N];
+	static boolean g[][]  = new boolean [N][N];
+	static int a[][] = new int [N][N];
+	static int n;
+	
+	boolean DFS (int x) {
+		int i, t;
+		for (i = 1; i <= n; ++i) if (!st[i] && g[i][x]) {
+			t = match[i];
+			match[i] = x;
+			st[i] = true;
+			if (t == 0 || DFS (t)) return true;
+			match[i] = t;
+		}
+		return false;
+	}
+	
+	boolean chk (int x) {
+		int i, j, k;
+		for (i = 1; i <= n; ++i)
+			for (j = 1; j <= n; ++j)
+				g[i][j] = a[i][j] <= x ? true : false;
+		
+		int ans = 0; Arrays.fill (match, 0);
+		for (i = 1; i <= n; ++i) {
+			Arrays.fill (st, false);
+			if (DFS (i)) ans++;
+		}
+		return ans == n;
+	}
+	
+	void sgu218 () {
+		Scanner in = new Scanner (new BufferedInputStream (System.in));
+		int c[] = new int [N*N];		
+		int i, j, k;
+		
+		n = in.nextInt();
+		k = 0;
+		for (i = 1; i <= n; ++i)
+			for (j = 1; j <= n; ++j) {
+				a[i][j] = in.nextInt();
+				c[k] = a[i][j];
+				k++;
+			}
+		Arrays.sort (c, 0, k);
+		int low = 0, up = k - 1;
+		while (up > low) {
+			int mid = (low + up) / 2;
+			if (chk (c[mid]))
+				up = mid;
+			else 
+				low = mid + 1;
+		}
+		chk (c[up]);
+		System.out.println(c[up]);
+		for (i = 1; i <= n; ++i)
+			System.out.printf ("%d %d\n", i, match[i]);
+	}
+	
+	public static void main(String[] args) {
+		Solution sguSolver = new Solution ();
+		sguSolver.sgu218 ();
+	}
+}

SGU/222.java

@@ -0,0 +1,32 @@
+import java.io.BufferedInputStream;
+import java.util.Scanner;
+
+
+public class Solution {
+	
+	void sgu222 () {
+		Scanner in = new Scanner (new BufferedInputStream (System.in));
+		int C[][] = new int [11][11];
+		int n, k, i, j;
+	
+		for (i = 0; i <= 10; ++i) {
+			C[i][0] = C[i][i] = 1;
+		}
+		for (i = 2; i <= 10; ++i)
+			for (j = 1; j < i; ++j)
+				C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
+		
+		n = in.nextInt(); k = in.nextInt ();
+		if (k > n) System.out.println ('0');
+		else {
+			int ans = 1;
+			for (i = n; i > n - k; --i) ans *= i;
+			System.out.println(ans * C[n][k]);
+		}
+	}
+	
+	public static void main(String[] args) {
+		Solution sguSolver = new Solution ();
+		sguSolver.sgu222 ();
+	}
+}

SGU/223.java

@@ -0,0 +1,70 @@
+import java.io.BufferedInputStream;
+import java.util.Scanner;
+
+
+public class Solution {
+	
+	static int n;
+	int chk (int x) {
+		int d[] = new int [10];
+		int i, j = 0, n = 0;
+		while (x != 0) {
+			d[n] = x % 2;
+			x /= 2;
+			j += d[n]; n++;
+		}
+		for (i = 0; i < n; ++i) if (d[i] > 0) {
+			if (i > 1 && d[i-1] > 0 || i < n - 1 && d[i+1] > 0) return -1;
+		}
+		return j;
+	}
+	boolean cpt (int x, int y) {
+		int i;
+		for (i = 0; i < n; ++i) if ((x & (1<<i)) > 0) {
+			if ((y & (1<<i)) > 0) return false;
+			if (i > 0 && (y & (1<<(i-1))) > 0) return false;
+			if (i < n - 1 && (y & (1<<(i+1))) > 0) return false;
+		}
+		return true;
+	}
+	
+	void sgu223 () {
+		Scanner in = new Scanner (new BufferedInputStream (System.in));
+		int i, j, m;
+		n = in.nextInt (); m = in.nextInt ();
+		int tot = 1<<n;
+		int [] cnt = new int[150];
+		int [] L = new int [150]; int ln = 0;
+		boolean ok[][] = new boolean [150][150];
+		long d[][][] = new long [n + 1][n*n*3][150];
+		
+		for (i = 0; i < tot; ++i)
+			if ((j = chk (i)) >= 0) {
+				ln++;
+				L[ln] = i;
+				cnt[ln] = j;
+			}
+		
+		for (i = 1; i <= ln; ++i)
+			for (j = i; j <= ln; ++j)
+				ok[j][i] = ok[i][j] = cpt (L[i], L[j]);
+		
+		for (i = 1; i <= ln; ++i)
+			d[1][cnt[i]][i] = 1;
+		for (i = 1; i < n; ++i)
+			for (j = 0; j <= m; ++j)
+				for (int s1 = 1; s1 <= ln; ++s1)
+					for (int s2 = 1; s2 <= ln; ++s2) if (ok[s1][s2])
+						d[i+1][j + cnt[s2]][s2] += d[i][j][s1];
+		
+		long ans = 0;
+		for (int s = 1; s <= ln; ++s)
+			ans += d[n][m][s];
+		System.out.println (ans);
+	}
+	
+	public static void main(String[] args) {
+		Solution sguSolver = new Solution ();
+		sguSolver.sgu223 ();
+	}
+}

SGU/281.java

@@ -0,0 +1,44 @@
+import java.io.BufferedInputStream;
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.Comparator;
+import java.util.Hashtable;
+import java.util.Scanner;
+
+
+public class Solution {
+	
+	void sgu281 () {
+		Hashtable <String, Integer> dic = new Hashtable <String, Integer> ();
+		String s;
+		ArrayList<String> t = new ArrayList<String>	();
+		int n, i, k;
+		Scanner in = new Scanner (new BufferedInputStream (System.in));
+		n = in.nextInt ();
+		for (i = 0; i < n; ++i) {
+			s = in.next();
+			dic.put (s, i);
+		}
+		int last = 0;
+		for (k = 0; k < n; ++k) {
+			s = in.next();
+			t.add (s);
+			last = Math.max (last, dic.get(s));
+			if (last == k) {
+				Collections.sort(t, new Comparator<String> () {
+					public int compare (String a, String b) {
+						return a.compareTo(b);
+					}
+				});
+				for (String str : t)
+					System.out.println(str);
+				t.clear();
+			}
+		}
+	}
+	
+	public static void main(String[] args) {
+		Solution sguSolver = new Solution ();
+		sguSolver.sgu281 ();
+	}
+}