CF 205

Author: coderxiang

Codeforces/205/353A_205.py

@@ -0,0 +1,25 @@
+n = input ()
+su, sd = 0, 0
+eo, oe = False, False
+for i in xrange (n):
+	[a, b] = map (int, raw_input().split())
+	su += a
+	sd += b
+	if a % 2 == 0 and b % 2 == 1:
+		eo = True
+	if a % 2 == 1 and b % 2 == 0:
+		oe = True
+
+
+if su % 2 == 0 and sd % 2 == 0:
+	print 0
+elif su % 2 == 1 and sd % 2 == 1:
+	if eo or oe:
+		print 1
+	else:
+		print -1
+else:
+	print -1
+	
+	
+	

Codeforces/205/353B_205.cpp

@@ -0,0 +1,84 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <string>
+#include <list>
+#include <set>
+#include <map>
+#include <sstream>
+#include <algorithm>
+#include <cstring>
+#include <cmath>
+#include <ctime>
+#include <cstdio>
+#include <cassert>
+
+using namespace std;
+
+typedef long long ll;
+typedef pair<int,int> PII;
+typedef vector<int> VI;
+typedef vector<string> VS;
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define sz(v) (int)v.size()
+#define clr(x, v) memset(x, v, sizeof(x))
+#define rep(i, l, u) for(int i = (l); i < (u); i++)
+#define repv(i, v) for(i = 0; i < (int)v.size(); i++)
+#define repi(it, c) for(typeof(c.begin()) it = c.begin(); it != c.end(); ++it)
+
+const int N = 111;
+
+
+vector<PII> a;
+int ans[N*2];
+
+bool st1[N], st2[N], st[2*N];
+
+int main () {
+	int n, i, j, k;
+	scanf ("%d", &n);
+	for (i = 1; i <= 2 * n; ++i) {
+		scanf ("%d", &j);
+		a.pb(mp(j, i));
+	}
+	sort (a.begin(), a.end());
+	int cnt1 = 0, cnt2 = 0;
+	for (i = 0; i < 2 * n; ) {
+		if (i < 2 * n - 1 && a[i].ff == a[i+1].ff) {
+			cnt1++;
+			cnt2++;
+			st[i] = st[i+1] = true;
+			ans[a[i].ss] = 1;
+			ans[a[i+1].ss] = 2;
+			st1[a[i].ff] = st2[a[i].ff] = true;
+			while (i < 2 * n - 1 && a[i].ff == a[i+1].ff) i++;
+		}
+		i++;
+	}
+	for (i = 0; i < 2 * n; ++i) {
+		if (i < 2 * n - 1 && a[i].ff == a[i+1].ff)
+			while (i < 2 * n - 1 && a[i].ff == a[i+1].ff) i++;
+		else {
+			ans[a[i].ss] = (cnt1 <= cnt2 ? (st1[a[i].ff] = true, ++cnt1, 1) : (st2[a[i].ff] = true, ++cnt2, 2));
+			st[i] = true;
+		}
+	}
+	for (i = 0; i < 2 * n; ++i)
+		if (!st[i]) {
+			ans[a[i].ss] = (cnt1 <= cnt2 ? (st1[a[i].ff] = true, ++cnt1, 1) : (st2[a[i].ff] = true, ++cnt2, 2));
+		}
+
+	int s1 = 0, s2 = 0;
+	for (i = 10; i <= 99; ++i){
+		s1 += st1[i];
+		s2 += st2[i];
+	}
+	printf("%d\n", s1 * s2);
+	for (i = 1; i <= 2 * n; ++i)
+		printf("%d%c", ans[i], i == 2 * n ? '\n': ' ');
+	return 0;
+}
+

Codeforces/205/353C_205.cpp

@@ -0,0 +1,54 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <string>
+#include <list>
+#include <set>
+#include <map>
+#include <sstream>
+#include <algorithm>
+#include <cstring>
+#include <cmath>
+#include <ctime>
+#include <cstdio>
+#include <cassert>
+
+using namespace std;
+
+typedef long long ll;
+typedef pair<int,int> PII;
+typedef vector<int> VI;
+typedef vector<string> VS;
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define sz(v) (int)v.size()
+#define clr(x, v) memset(x, v, sizeof(x))
+#define rep(i, l, u) for(int i = (l); i < (u); i++)
+#define repv(i, v) for(i = 0; i < (int)v.size(); i++)
+#define repi(it, c) for(typeof(c.begin()) it = c.begin(); it != c.end(); ++it)
+
+/*
+const int N = 100011;
+
+int a[N], s[N], n, d[N];
+
+int main () {
+	int n, i, j, k;
+	scanf ("%d", &n);
+	for (i = 1; i <= n; ++i) {
+		scanf ("%d", &a[i]);
+		s[i] = s[i - 1] + a[i];
+	}
+	int last = 0;
+	for (i = 1; i <= n; ++i) {
+		scanf ("%1d", &k);
+		if (k == 0) continue;
+		d[k] = max (s[i-1], a[i] + d[last]);
+		last = k;
+	}
+	printf ("%d\n", d[last]);
+	return 0;
+}
+*/

Codeforces/205/353D_205.cpp

@@ -0,0 +1,52 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <string>
+#include <list>
+#include <set>
+#include <map>
+#include <sstream>
+#include <algorithm>
+#include <cstring>
+#include <cmath>
+#include <ctime>
+#include <cstdio>
+#include <cassert>
+
+using namespace std;
+
+typedef long long ll;
+typedef pair<int,int> PII;
+typedef vector<int> VI;
+typedef vector<string> VS;
+#define pb push_back
+#define mp make_pair
+#define ff first
+#define ss second
+#define sz(v) (int)v.size()
+#define clr(x, v) memset(x, v, sizeof(x))
+#define rep(i, l, u) for(int i = (l); i < (u); i++)
+#define repv(i, v) for(i = 0; i < (int)v.size(); i++)
+#define repi(it, c) for(typeof(c.begin()) it = c.begin(); it != c.end(); ++it)
+
+const int N = 1000011;
+
+/*
+int main () {
+	int i, j, k, sn, cntM = 0, ans = 0, lastF = 0;
+	string s, t;
+	cin >> s;
+	sn = s.length();
+	for (i = 0; i < sn && s[i] == 'F'; ++i);
+	for (; i < sn; ++i) {
+		if (s[i] == 'M')
+			cntM++;
+		else {
+			lastF = max (lastF + 1, cntM);
+			ans = max(ans, lastF);
+		}
+	}
+	printf ("%d\n", ans);
+	return 0;
+}
+*/